A new, highly efficient, and easy to implement top-down join enumeration algorithm

A new, highly efficient, and easy to implement top-down join enumeration algorithm

Finding an optimal execution order of join operations is a crucial task in every cost-based query optimizer. Since there are many possible join trees for a given query, the overhead of the join (tree) enumeration algorithm per valid join tree should be minimal. In the case of a clique-shaped query g...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Fender, P, Moerkotte, G
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Complexity theory
Data structures
Heuristic algorithms
Niobium
Optimization
Partitioning algorithms
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 875
container_issue
container_start_page 864
container_title
container_volume
creator Fender, P
Moerkotte, G
description Finding an optimal execution order of join operations is a crucial task in every cost-based query optimizer. Since there are many possible join trees for a given query, the overhead of the join (tree) enumeration algorithm per valid join tree should be minimal. In the case of a clique-shaped query graph, the best known top-down algorithm has a complexity of Θ(n 2 ) per join tree, where n is the number of relations. In this paper, we present an algorithm that has an according O(1) complexity in this case. We show experimentally that this more theoretical result has indeed a high impact on the performance in other non-clique settings. This is especially true for cyclic query graphs. Further, we evaluate the performance of our new algorithm and compare it with the best top-down and bottom-up algorithms described in the literature.
doi_str_mv 10.1109/ICDE.2011.5767901
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5767901</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5767901</ieee_id><sourcerecordid>5767901</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-54e57ea5f066e475312685b60eb0fa54511e44acd91cdd0112892758ea6b95063</originalsourceid><addsrcrecordid>eNotUNtqwzAU826wrusHjL34A5rOx_Gx48eSdluhMBgb7K04yUnrkjglySj9-wUWvQhJIJAYewKxABD2ZZOu1gspABZotLECrtgDKKlUYrWAazaRscFISP1zw2bWJGOGVt-yCQgdRzpO5D2bdd1RDLAKAMWEfS55oPOcH_z-UF04laXPPYV-zl0oOLnuwvuG-_pUUT3YgzhFRXMO_Nj4wCn81tS63jeBu2rftL4_1I_srnRVR7ORp-z7df2Vvkfbj7dNutxGHgz2ESpCQw5LoTUpgzFInWCmBWWidKgQgJRyeWEhL4phuUysNJiQ05nFYdGUPf_3eiLanVpfu_ayG--J_wAooVO8</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A new, highly efficient, and easy to implement top-down join enumeration algorithm</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Fender, P ; Moerkotte, G</creator><creatorcontrib>Fender, P ; Moerkotte, G</creatorcontrib><description>Finding an optimal execution order of join operations is a crucial task in every cost-based query optimizer. Since there are many possible join trees for a given query, the overhead of the join (tree) enumeration algorithm per valid join tree should be minimal. In the case of a clique-shaped query graph, the best known top-down algorithm has a complexity of Θ(n 2 ) per join tree, where n is the number of relations. In this paper, we present an algorithm that has an according O(1) complexity in this case. We show experimentally that this more theoretical result has indeed a high impact on the performance in other non-clique settings. This is especially true for cyclic query graphs. Further, we evaluate the performance of our new algorithm and compare it with the best top-down and bottom-up algorithms described in the literature.</description><identifier>ISSN: 1063-6382</identifier><identifier>ISBN: 9781424489596</identifier><identifier>ISBN: 1424489598</identifier><identifier>EISSN: 2375-026X</identifier><identifier>EISBN: 1424489601</identifier><identifier>EISBN: 142448958X</identifier><identifier>EISBN: 9781424489589</identifier><identifier>EISBN: 9781424489602</identifier><identifier>DOI: 10.1109/ICDE.2011.5767901</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Complexity theory ; Data structures ; Heuristic algorithms ; Niobium ; Optimization ; Partitioning algorithms</subject><ispartof>2011 IEEE 27th International Conference on Data Engineering, 2011, p.864-875</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5767901$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27912,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5767901$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fender, P</creatorcontrib><creatorcontrib>Moerkotte, G</creatorcontrib><title>A new, highly efficient, and easy to implement top-down join enumeration algorithm</title><title>2011 IEEE 27th International Conference on Data Engineering</title><addtitle>ICDE</addtitle><description>Finding an optimal execution order of join operations is a crucial task in every cost-based query optimizer. Since there are many possible join trees for a given query, the overhead of the join (tree) enumeration algorithm per valid join tree should be minimal. In the case of a clique-shaped query graph, the best known top-down algorithm has a complexity of Θ(n 2 ) per join tree, where n is the number of relations. In this paper, we present an algorithm that has an according O(1) complexity in this case. We show experimentally that this more theoretical result has indeed a high impact on the performance in other non-clique settings. This is especially true for cyclic query graphs. Further, we evaluate the performance of our new algorithm and compare it with the best top-down and bottom-up algorithms described in the literature.</description><subject>Algorithm design and analysis</subject><subject>Complexity theory</subject><subject>Data structures</subject><subject>Heuristic algorithms</subject><subject>Niobium</subject><subject>Optimization</subject><subject>Partitioning algorithms</subject><issn>1063-6382</issn><issn>2375-026X</issn><isbn>9781424489596</isbn><isbn>1424489598</isbn><isbn>1424489601</isbn><isbn>142448958X</isbn><isbn>9781424489589</isbn><isbn>9781424489602</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotUNtqwzAU826wrusHjL34A5rOx_Gx48eSdluhMBgb7K04yUnrkjglySj9-wUWvQhJIJAYewKxABD2ZZOu1gspABZotLECrtgDKKlUYrWAazaRscFISP1zw2bWJGOGVt-yCQgdRzpO5D2bdd1RDLAKAMWEfS55oPOcH_z-UF04laXPPYV-zl0oOLnuwvuG-_pUUT3YgzhFRXMO_Nj4wCn81tS63jeBu2rftL4_1I_srnRVR7ORp-z7df2Vvkfbj7dNutxGHgz2ESpCQw5LoTUpgzFInWCmBWWidKgQgJRyeWEhL4phuUysNJiQ05nFYdGUPf_3eiLanVpfu_ayG--J_wAooVO8</recordid><startdate>201104</startdate><enddate>201104</enddate><creator>Fender, P</creator><creator>Moerkotte, G</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201104</creationdate><title>A new, highly efficient, and easy to implement top-down join enumeration algorithm</title><author>Fender, P ; Moerkotte, G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-54e57ea5f066e475312685b60eb0fa54511e44acd91cdd0112892758ea6b95063</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithm design and analysis</topic><topic>Complexity theory</topic><topic>Data structures</topic><topic>Heuristic algorithms</topic><topic>Niobium</topic><topic>Optimization</topic><topic>Partitioning algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Fender, P</creatorcontrib><creatorcontrib>Moerkotte, G</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fender, P</au><au>Moerkotte, G</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A new, highly efficient, and easy to implement top-down join enumeration algorithm</atitle><btitle>2011 IEEE 27th International Conference on Data Engineering</btitle><stitle>ICDE</stitle><date>2011-04</date><risdate>2011</risdate><spage>864</spage><epage>875</epage><pages>864-875</pages><issn>1063-6382</issn><eissn>2375-026X</eissn><isbn>9781424489596</isbn><isbn>1424489598</isbn><eisbn>1424489601</eisbn><eisbn>142448958X</eisbn><eisbn>9781424489589</eisbn><eisbn>9781424489602</eisbn><abstract>Finding an optimal execution order of join operations is a crucial task in every cost-based query optimizer. Since there are many possible join trees for a given query, the overhead of the join (tree) enumeration algorithm per valid join tree should be minimal. In the case of a clique-shaped query graph, the best known top-down algorithm has a complexity of Θ(n 2 ) per join tree, where n is the number of relations. In this paper, we present an algorithm that has an according O(1) complexity in this case. We show experimentally that this more theoretical result has indeed a high impact on the performance in other non-clique settings. This is especially true for cyclic query graphs. Further, we evaluate the performance of our new algorithm and compare it with the best top-down and bottom-up algorithms described in the literature.</abstract><pub>IEEE</pub><doi>10.1109/ICDE.2011.5767901</doi><tpages>12</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-6382
ispartof 2011 IEEE 27th International Conference on Data Engineering, 2011, p.864-875
issn 1063-6382
2375-026X
language eng
recordid cdi_ieee_primary_5767901
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Complexity theory
Data structures
Heuristic algorithms
Niobium
Optimization
Partitioning algorithms
title A new, highly efficient, and easy to implement top-down join enumeration algorithm
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T22%3A17%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20new,%20highly%20efficient,%20and%20easy%20to%20implement%20top-down%20join%20enumeration%20algorithm&rft.btitle=2011%20IEEE%2027th%20International%20Conference%20on%20Data%20Engineering&rft.au=Fender,%20P&rft.date=2011-04&rft.spage=864&rft.epage=875&rft.pages=864-875&rft.issn=1063-6382&rft.eissn=2375-026X&rft.isbn=9781424489596&rft.isbn_list=1424489598&rft_id=info:doi/10.1109/ICDE.2011.5767901&rft_dat=%3Cieee_6IE%3E5767901%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424489601&rft.eisbn_list=142448958X&rft.eisbn_list=9781424489589&rft.eisbn_list=9781424489602&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5767901&rfr_iscdi=true