{"id":"https://openalex.org/W6944583177","doi":"https://doi.org/10.18420/btw2025-09","title":"Optimizing Linearized Join Enumeration by Adapting to the Query Structure","display_name":"Optimizing Linearized Join Enumeration by Adapting to the Query Structure","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6944583177","doi":"https://doi.org/10.18420/btw2025-09"},"language":"en","primary_location":{"id":"doi:10.18420/btw2025-09","is_oa":true,"landing_page_url":"https://doi.org/10.18420/btw2025-09","pdf_url":null,"source":{"id":"https://openalex.org/S7407052918","display_name":"Gesellschaft f\u00fcr Informatik (GI)","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":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.18420/btw2025-09","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Birler, Altan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Birler, Altan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Stoian, Mihail","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stoian, Mihail","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Neumann, Thomas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neumann, Thomas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2161,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90823491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.6796000003814697,"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.6796000003814697,"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.14640000462532043,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.09139999747276306,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.8474000096321106},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.7469000220298767},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6373999714851379},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5906999707221985},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5684999823570251},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.4390999972820282},{"id":"https://openalex.org/keywords/spatial-query","display_name":"Spatial query","score":0.37220001220703125},{"id":"https://openalex.org/keywords/database-query","display_name":"Database query","score":0.3700000047683716}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8474000096321106},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.7469000220298767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6643999814987183},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6373999714851379},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5906999707221985},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5756999850273132},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5684999823570251},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.4390999972820282},{"id":"https://openalex.org/C172722865","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial query","level":5,"score":0.37220001220703125},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.35899999737739563},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.3474000096321106},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.3050000071525574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3043999969959259},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.30149999260902405},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29030001163482666},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.2705000042915344},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2694999873638153},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.26570001244544983},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.18420/btw2025-09","is_oa":true,"landing_page_url":"https://doi.org/10.18420/btw2025-09","pdf_url":null,"source":{"id":"https://openalex.org/S7407052918","display_name":"Gesellschaft f\u00fcr Informatik (GI)","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-journal"}],"best_oa_location":{"id":"doi:10.18420/btw2025-09","is_oa":true,"landing_page_url":"https://doi.org/10.18420/btw2025-09","pdf_url":null,"source":{"id":"https://openalex.org/S7407052918","display_name":"Gesellschaft f\u00fcr Informatik (GI)","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":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"database":[1],"systems,":[2],"join":[3,47],"enumeration":[4,48,65],"is":[5],"a":[6,16],"critical":[7],"but":[8],"NP-hard":[9],"problem,":[10],"especially":[11],"challenging":[12],"for":[13,57,88],"queries":[14,90,104],"with":[15],"large":[17,59],"number":[18],"of":[19,78,101,105,107],"joins,":[20],"as":[21],"often":[22],"found":[23],"in":[24],"graph":[25,41,73],"workloads.":[26],"To":[27],"manage":[28],"this":[29],"complexity,":[30],"some":[31],"state-of-the-art":[32],"methods":[33],"reduce":[34],"the":[35,71,76,85,99],"search":[36],"space":[37],"by":[38],"employing":[39],"query":[40,72],"linearization.":[42],"However,":[43],"even":[44],"after":[45],"linearization,":[46],"still":[49],"has":[50],"cubic":[51],"runtime,":[52],"which":[53],"can":[54],"be":[55],"inefficient":[56],"very":[58],"queries.":[60],"We":[61],"propose":[62],"an":[63],"improved":[64],"algorithm":[66],"that":[67],"dynamically":[68],"adapts":[69],"to":[70,93],"structure,":[74],"avoiding":[75],"generation":[77],"invalid":[79],"or":[80],"redundant":[81],"plans.":[82],"This":[83],"reduces":[84],"time":[86],"complexity":[87],"star":[89],"from":[91],"O(n^3)":[92],"O(n":[94],"log":[95],"n)":[96],"and":[97],"enables":[98],"optimization":[100],"general":[102],"tree":[103],"thousands":[106],"joins":[108],"within":[109],"seconds.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}