{"id":"https://openalex.org/W7155383398","doi":"https://doi.org/10.1145/3810900.3810901","title":"Technical Perspective: DPconv: Super-Polynomially Faster Join Ordering","display_name":"Technical Perspective: DPconv: Super-Polynomially Faster Join Ordering","publication_year":2026,"publication_date":"2026-04-23","ids":{"openalex":"https://openalex.org/W7155383398","doi":"https://doi.org/10.1145/3810900.3810901"},"language":"en","primary_location":{"id":"doi:10.1145/3810900.3810901","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3810900.3810901","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMOD Record","raw_type":"journal-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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Mannheim, Mannheim, Germany","institution_ids":["https://openalex.org/I177802217"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025678292"],"corresponding_institution_ids":["https://openalex.org/I177802217"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.73028588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"55","issue":"1","first_page":"7","last_page":"7"},"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.3905999958515167,"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.3905999958515167,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.18729999661445618,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.13369999825954437,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.8636999726295471},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.588699996471405},{"id":"https://openalex.org/keywords/sort-merge-join","display_name":"Sort-merge join","score":0.5048999786376953},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.47189998626708984},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4359000027179718},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.3828999996185303},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3801000118255615}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.8636999726295471},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.588699996471405},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.5048999786376953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49729999899864197},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4846000075340271},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.47189998626708984},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4359000027179718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43320000171661377},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3801000118255615},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3610999882221222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3549000024795532},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31850001215934753},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2581000030040741}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3810900.3810901","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3810900.3810901","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMOD Record","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2066623874","https://openalex.org/W2164399715","https://openalex.org/W2164645353","https://openalex.org/W2755385361","https://openalex.org/W4282041278"],"related_works":[],"abstract_inverted_index":{"On":[0],"the":[1,15,20,31,34,37,41,45,59,66,70,73,77,81,93,108,116,128,134,148,159,164,187,197,202],"floors":[2],"of":[3,33,155],"database":[4,11],"conferences,":[5],"one":[6],"can":[7,95,120,138],"often":[8],"listen":[9],"to":[10,152,172,182,200],"researchers":[12],"talking":[13],"about":[14],"join":[16,21,48,53,83,103,136,149,189],"ordering":[17,22,54,104,150,190],"problem.":[18],"However,":[19],"problem":[23,94,105,151,160,191],"does":[24],"not":[25],"exist!":[26],"In":[27],"fact,":[28],"depending":[29],"on":[30,115,127,186],"properties":[32],"query":[35,60,117],"graph,":[36],"cardinality":[38,67,129],"estimation":[39,130],"method,":[40,131],"cost":[42,74],"function,":[43],"and":[44,64,80,132,162],"resulting":[46,82,135],"output":[47],"tree,":[49],"there":[50],"exist":[51],"multiple":[52],"problems.":[55],"For":[56],"example,":[57],"if":[58],"graph":[61,118],"is":[62,85,110,168,196],"connected":[63],"acyclic,":[65],"estimator":[68],"uses":[69],"independence":[71],"assumption,":[72],"function":[75],"has":[76],"ASI":[78],"property,":[79],"tree":[84,88],"a":[86,178],"left-deep":[87],"without":[89],"cross":[90,142],"products,":[91],"then":[92],"be":[96,139],"solved":[97],"in":[98,107,170],"polynomial":[99],"time":[100],"[3].":[101],"The":[102,144],"discussed":[106],"paper":[109],"specified":[111],"by":[112],"no":[113,123,125],"restriction":[114,126],"(it":[119],"even":[121],"have":[122],"edges),":[124],"for":[133],"trees":[137],"bushy":[140],"with":[141],"products.":[143],"framework":[145],"DPconv":[146,176],"transforms":[147,163],"some":[153],"kind":[154],"subset":[156],"space,":[157],"solves":[158],"therein,":[161],"solution":[165],"back;":[166],"this":[167],"similar":[169],"spirit":[171],"discrete":[173],"FFT.":[174],"Thereby,":[175],"exhibits":[177],"reduced":[179],"complexity":[180,204],"compared":[181],"traditional":[183],"ones":[184],"working":[185],"same":[188],"(such":[192],"as":[193],"DPsub):":[194],"It":[195],"first":[198],"approach":[199],"beat":[201],"O(3n)":[203],"barrier.":[205]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-04-24T00:00:00"}