{"id":"https://openalex.org/W6925804964","doi":"https://doi.org/10.18420/btw2025-04","title":"Complexity Analysis of Pipeline Execution Order Enumeration for Query Execution Plans","display_name":"Complexity Analysis of Pipeline Execution Order Enumeration for Query Execution Plans","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6925804964","doi":"https://doi.org/10.18420/btw2025-04"},"language":"en","primary_location":{"id":"doi:10.18420/btw2025-04","is_oa":true,"landing_page_url":"https://doi.org/10.18420/btw2025-04","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-04","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Landgraf, Lukas Kurt G\u00fcnther","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Landgraf, Lukas Kurt G\u00fcnther","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Wolf, Florian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wolf, Florian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Lehner, Wolfgang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lehner, Wolfgang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.244,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.90942926,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"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/T11578","display_name":"Plant Pathogenic Bacteria Studies","score":0.5521000027656555,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T11578","display_name":"Plant Pathogenic Bacteria Studies","score":0.5521000027656555,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12824","display_name":"Infections and bacterial resistance","score":0.12680000066757202,"subfield":{"id":"https://openalex.org/subfields/1310","display_name":"Endocrinology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.06469999998807907,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.755299985408783},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.746999979019165},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6880000233650208},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.670799970626831},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.6277999877929688},{"id":"https://openalex.org/keywords/query-plan","display_name":"Query plan","score":0.5997999906539917},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.4449000060558319},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.40389999747276306}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8475000262260437},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.755299985408783},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.746999979019165},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6880000233650208},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.670799970626831},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.6277999877929688},{"id":"https://openalex.org/C2779729312","wikidata":"https://www.wikidata.org/wiki/Q784232","display_name":"Query plan","level":5,"score":0.5997999906539917},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.4449000060558319},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39739999175071716},{"id":"https://openalex.org/C2776834041","wikidata":"https://www.wikidata.org/wiki/Q25346349","display_name":"Execution model","level":2,"score":0.38429999351501465},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36070001125335693},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32199999690055847},{"id":"https://openalex.org/C24028149","wikidata":"https://www.wikidata.org/wiki/Q7094056","display_name":"Online aggregation","level":5,"score":0.3197999894618988},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30979999899864197},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29649999737739563},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.27630001306533813},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C175309249","wikidata":"https://www.wikidata.org/wiki/Q725864","display_name":"Pipeline transport","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.2685000002384186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.18420/btw2025-04","is_oa":true,"landing_page_url":"https://doi.org/10.18420/btw2025-04","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-04","is_oa":true,"landing_page_url":"https://doi.org/10.18420/btw2025-04","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Optimizing":[0],"for":[1,42,59,127],"memory":[2,128],"consumption":[3],"during":[4],"query":[5,16,45,62,101,115,133],"processing":[6],"can":[7],"be":[8],"facilitated":[9],"by":[10],"enumerating":[11],"pipeline":[12,39,56,140],"execution":[13,40,46,57,63,102,116,134,141],"orders":[14,41,58],"in":[15],"processors":[17],"to":[18,37,68,88,112,124],"minimize":[19],"the":[20,53,69,75,85,90,94,110,131],"lifetime":[21],"of":[22,26,51,55,74,98],"intermediates.":[23],"The":[24,118],"number":[25,54],"possible":[27,139],"enumerations":[28],"is":[29,79],"potentially":[30],"factorial.":[31],"Recent":[32],"literature":[33],"has":[34],"explored":[35],"algorithms":[36],"enumerate":[38],"a":[43,72],"given":[44,61,100,132],"plan.":[47],"However,":[48],"no":[49],"methods":[50],"calculating":[52],"any":[60,99],"plan":[64,103,135],"were":[65],"provided.":[66],"Due":[67],"factorial":[70],"complexity":[71],"pre-calculation":[73],"expected":[76,95],"enumeration":[77,96],"count":[78],"necessary.":[80],"This":[81],"work":[82],"will":[83],"provide":[84,109],"combinatorial":[86],"framework":[87],"calculate":[89],"structural":[91],"complexity,":[92],"i.e.":[93],"count,":[97],"without":[104],"traversing.":[105],"Through":[106],"this,":[107],"we":[108],"means":[111],"identify":[113],"expensive":[114],"plans.":[117],"precise":[119],"calculation":[120],"then":[121],"enables":[122],"optimizers":[123],"employ":[125],"heuristics":[126],"optimization":[129],"if":[130],"exposes":[136],"too":[137],"many":[138],"orders.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}