{"id":"https://openalex.org/W4380433183","doi":"https://doi.org/10.1145/3588927","title":"Efficiently Computing Join Orders with Heuristic Search","display_name":"Efficiently Computing Join Orders with Heuristic Search","publication_year":2023,"publication_date":"2023-05-26","ids":{"openalex":"https://openalex.org/W4380433183","doi":"https://doi.org/10.1145/3588927"},"language":"en","primary_location":{"id":"doi:10.1145/3588927","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3588927","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3588927","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043975329","display_name":"Immanuel Haffner","orcid":"https://orcid.org/0009-0003-8796-1129"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Immanuel Haffner","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0009-0003-8796-1129","affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091334588","display_name":"Jens Dittrich","orcid":"https://orcid.org/0000-0003-1015-804X"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Dittrich","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1015-804X","affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043975329"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":1.3198,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80773282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998999834060669,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9983999729156494,"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/heuristic","display_name":"Heuristic","score":0.6592367887496948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6478656530380249},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.6265263557434082},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.5897347927093506},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5537357926368713},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49986743927001953},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4883720278739929},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.48055532574653625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47709494829177856},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.47317221760749817},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.4720136821269989},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4249640107154846},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41626450419425964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3024653196334839},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2494906485080719},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1748892068862915},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.11937832832336426}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6592367887496948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478656530380249},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.6265263557434082},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.5897347927093506},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5537357926368713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49986743927001953},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4883720278739929},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.48055532574653625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47709494829177856},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.47317221760749817},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.4720136821269989},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4249640107154846},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41626450419425964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3024653196334839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2494906485080719},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1748892068862915},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.11937832832336426},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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":2,"locations":[{"id":"doi:10.1145/3588927","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3588927","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"doi:10.22028/d291-47812","is_oa":true,"landing_page_url":"https://doi.org/10.22028/d291-47812","pdf_url":null,"source":{"id":"https://openalex.org/S7407052975","display_name":"Universit\u00e4t des Saarlandes","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3588927","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3588927","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W166430344","https://openalex.org/W1556146035","https://openalex.org/W1775783412","https://openalex.org/W1777047301","https://openalex.org/W1804205637","https://openalex.org/W1893662221","https://openalex.org/W1943557536","https://openalex.org/W1969483458","https://openalex.org/W1975731516","https://openalex.org/W2026966899","https://openalex.org/W2026984353","https://openalex.org/W2033904205","https://openalex.org/W2035675039","https://openalex.org/W2058978608","https://openalex.org/W2066623874","https://openalex.org/W2079329679","https://openalex.org/W2106856755","https://openalex.org/W2134634502","https://openalex.org/W2160770337","https://openalex.org/W2164399715","https://openalex.org/W2169528473","https://openalex.org/W2396309311","https://openalex.org/W2424452828","https://openalex.org/W2798325362","https://openalex.org/W2922302645","https://openalex.org/W2970148517","https://openalex.org/W3003067944","https://openalex.org/W3099273181","https://openalex.org/W3176153696","https://openalex.org/W3176550827","https://openalex.org/W4246219036","https://openalex.org/W6606780865"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W2224555876","https://openalex.org/W2064794194","https://openalex.org/W1994919150","https://openalex.org/W4200104947","https://openalex.org/W3111117784","https://openalex.org/W2808808802","https://openalex.org/W2402589461","https://openalex.org/W2097038466"],"abstract_inverted_index":{"Join":[0],"order":[1,100,110,128,191],"optimization":[2,101,111,129],"is":[3,96,102],"one":[4],"of":[5,28,44,48,141,147,192,198],"the":[6,38,131,139,145,199,206],"most":[7],"fundamental":[8],"problems":[9],"in":[10,123,166],"processing":[11],"queries":[12],"on":[13,61],"relational":[14],"data.":[15],"It":[16],"has":[17],"been":[18],"studied":[19],"extensively":[20],"for":[21,180],"almost":[22],"four":[23],"decades":[24],"now.":[25],"Still,":[26],"because":[27],"its":[29],"NP":[30],"hardness,":[31],"no":[32],"generally":[33],"efficient":[34],"solution":[35],"exists":[36],"and":[37,92,144,170,182],"problem":[39,143],"remains":[40],"an":[41,172,190],"important":[42],"topic":[43],"research.":[45],"The":[46],"scope":[47],"algorithms":[49],"to":[50,58,64,67,70,83,98,130,154],"compute":[51,84],"join":[52,85,99,109,127,161],"orders":[53],"ranges":[54],"from":[55],"exhaustive":[56],"enumeration,":[57],"combinatorics":[59],"based":[60],"graph":[62],"properties,":[63],"greedy":[65],"search,":[66],"genetic":[68],"algorithms,":[69],"recently":[71],"investigated":[72],"machine":[73],"learning.":[74],"A":[75],"few":[76],"works":[77],"exist":[78],"that":[79,179],"use":[80],"heuristic":[81,94,113,148,156,164,185],"search":[82,95,157,165,186],"orders.":[86],"However,":[87],"a":[88,119,167],"theoretical":[89,121],"argument":[90],"why":[91],"how":[93],"applicable":[97],"lacking.":[103],"In":[104,115],"this":[105,142],"work,":[106],"we":[107,117,125],"investigate":[108],"via":[112,163],"search.":[114,149],"particular,":[116],"provide":[118],"strong":[120],"framework,":[122],"which":[124],"reduce":[126],"shortest":[132],"path":[133],"problem.":[134],"We":[135,150,159],"then":[136],"thoroughly":[137],"analyze":[138],"properties":[140],"applicability":[146],"devise":[151],"crucial":[152],"optimizations":[153],"make":[155],"tractable.":[158],"implement":[160],"ordering":[162],"real":[168],"DBMS":[169],"conduct":[171],"extensive":[173],"empirical":[174],"study.":[175],"Our":[176,201],"findings":[177],"show":[178],"star-":[181],"clique-shaped":[183],"queries,":[184],"finds":[187],"optimal":[188],"plans":[189],"magnitude":[193],"faster":[194],"than":[195],"current":[196],"state":[197],"art.":[200],"suboptimal":[202],"solutions":[203],"further":[204],"extend":[205],"cost/time":[207],"Pareto":[208],"frontier.":[209]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3}],"updated_date":"2026-05-14T08:36:36.166977","created_date":"2025-10-10T00:00:00"}