{"id":"https://openalex.org/W2153180521","doi":"https://doi.org/10.1145/1376616.1376672","title":"Dynamic programming strikes back","display_name":"Dynamic programming strikes back","publication_year":2008,"publication_date":"2008-06-09","ids":{"openalex":"https://openalex.org/W2153180521","doi":"https://doi.org/10.1145/1376616.1376672","mag":"2153180521"},"language":"en","primary_location":{"id":"doi:10.1145/1376616.1376672","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025678292","display_name":"Guido Moerkotte","orcid":null},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Guido Moerkotte","raw_affiliation_strings":["University of Mannheim, Mannheim, Germany"],"affiliations":[{"raw_affiliation_string":"University of Mannheim, Mannheim, Germany","institution_ids":["https://openalex.org/I177802217"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101880157","display_name":"Thomas Neumann","orcid":"https://orcid.org/0000-0001-5787-142X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Neumann","raw_affiliation_strings":["Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025678292"],"corresponding_institution_ids":["https://openalex.org/I177802217"],"apc_list":null,"apc_paid":null,"fwci":5.3369,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.95913395,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"539","last_page":"552"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.9671438932418823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8187916874885559},{"id":"https://openalex.org/keywords/memoization","display_name":"Memoization","score":0.7611874341964722},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6099494099617004},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5022428035736084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4894620180130005},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36079758405685425},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20801138877868652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11302098631858826}],"concepts":[{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.9671438932418823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8187916874885559},{"id":"https://openalex.org/C79516417","wikidata":"https://www.wikidata.org/wiki/Q1376168","display_name":"Memoization","level":4,"score":0.7611874341964722},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6099494099617004},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5022428035736084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4894620180130005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36079758405685425},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20801138877868652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11302098631858826},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1376616.1376672","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.323.5901","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.5901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://domino.mpi-inf.mpg.de/intranet/ag5/ag5publ.nsf/6a06bf33407d587ec12565dd006fb8de/dca408a1a5cf641ac12574f7004c26d7/$file/dphyper.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:428168","is_oa":false,"landing_page_url":"http://edoc.mpg.de/428168","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Shasha, Dennis; Wang, Jason T. L.: Proceedings of the ACM SIGMOD 2008 International Conference on Management of Data, ACM, 539-552 (2008)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1324533","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1B75-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the ACM SIGMOD 2008 International Conference on Management of Data","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W82241149","https://openalex.org/W106164280","https://openalex.org/W1532664273","https://openalex.org/W1536683787","https://openalex.org/W1553244311","https://openalex.org/W1567133979","https://openalex.org/W1589271613","https://openalex.org/W1875283749","https://openalex.org/W1968541019","https://openalex.org/W1994674921","https://openalex.org/W2026984353","https://openalex.org/W2049578111","https://openalex.org/W2075827270","https://openalex.org/W2089211036","https://openalex.org/W2103834747","https://openalex.org/W2127872176","https://openalex.org/W2136632987","https://openalex.org/W2145037882","https://openalex.org/W2149133292","https://openalex.org/W2152252136","https://openalex.org/W2153329411","https://openalex.org/W6604260118","https://openalex.org/W6632146538","https://openalex.org/W6675652314"],"related_works":["https://openalex.org/W2393491644","https://openalex.org/W4206577045","https://openalex.org/W3086237447","https://openalex.org/W650102067","https://openalex.org/W1550806730","https://openalex.org/W2589740103","https://openalex.org/W2172084996","https://openalex.org/W1966967794","https://openalex.org/W1501284171","https://openalex.org/W2397450670"],"abstract_inverted_index":{"Two":[0],"highly":[1],"efficient":[2,63],"algorithms":[3,146],"are":[4],"known":[5,64,145],"for":[6],"optimally":[7],"ordering":[8],"joins":[9,54,120,132],"while\\navoiding":[10],"cross":[11],"products:\\nDPccp,":[12],"which":[13],"is":[14,78],"based":[15],"on":[16,24],"dynamic":[17,157],"programming,":[18],"and":[19,37,99],"Top-Down":[20],"Partition":[21],"Search,":[22],"\\nbased":[23],"memoization.\\nBoth":[25],"have":[26],"two":[27],"severe":[28],"limitations:\\nThey":[29],"handle":[30,81],"only":[31],"(1)":[32],"simple":[33],"(binary)":[34],"join":[35,46,83],"predicates":[36,84,135],"(2)":[38],"inner":[39],"joins.\\nHowever,":[40],"real":[41],"queries":[42],"may":[43],"contain":[44],"complex":[45,82,134,149],"predicates,":[47],"involving":[48],"more":[49],"than":[50],"\\ntwo":[51],"relations,\\nand":[52],"outer":[53],"as":[55,57,68,93,133],"well":[56],"other":[58],"non-inner":[59,119,152],"joins.\\n\\nTaking":[60],"the":[61,90],"most":[62],"join-ordering":[65],"algorithm,":[66,76],"DPccp,":[67],"a":[69,74,94,107,159],"starting":[70],"\\npoint,\\nwe":[71],"first":[72],"develop":[73],"new":[75],"DPhyp,\\nwhich":[77],"capable":[79],"to":[80,109,113,144],"efficiently.\\nWe":[85],"do":[86],"so":[87,123],"by":[88,139],"modeling":[89],"query":[91],"graph":[92],"(variant":[95],"of":[96,118,141],"a)":[97],"hypergraph":[98],"then":[100],"\\nreason":[101],"about":[102],"its\\nconnected":[103],"subgraphs.\\nThen,":[104],"we":[105],"present":[106],"technique":[108],"exploit":[110],"this":[111,129,155],"capability":[112],"efficiently":[114],"handle\\nthe":[115],"widest":[116],"class":[117],"dealt":[121],"with":[122,148],"far.\\nOur":[124],"experimental":[125],"results":[126],"show":[127],"that":[128],"reformulation":[130],"of\\nnon-inner":[131],"can":[136],"improve":[137],"optimization\\ntime":[138],"orders":[140],"magnitude,":[142],"compared":[143],"dealing":[147],"\\njoin":[150],"predicates\\nand":[151],"joins.\\nOnce":[153],"again,":[154],"gives":[156],"programming":[158],"distinct":[160],"advantage":[161],"over":[162],"current":[163],"\\nmemoization":[164],"techniques.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}