Outer Join Elimination in the Teradata RDBMS

Queries in rela tional DBMS are getting more and more complex especially in the decision support environment. Also, tools generate most SQL queries received by commercial DBMS engines with not much user control. Query rewrite plays an important role in optimizing these co mplex and tool – generated...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ghazal, Ahmad, Crolotte, Alain, Bhashyam, Ramesh
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 740
container_issue
container_start_page 730
container_title
container_volume
creator Ghazal, Ahmad
Crolotte, Alain
Bhashyam, Ramesh
description Queries in rela tional DBMS are getting more and more complex especially in the decision support environment. Also, tools generate most SQL queries received by commercial DBMS engines with not much user control. Query rewrite plays an important role in optimizing these co mplex and tool – generated queries. One important such technique is eliminating redu ndant joins whenever possible. In this paper, we present a new solution for outer join elimination. This solution was implemented in the Teradata DBMS part of V2R5.1. As an example, we show how applications based on vertical partitioning and universal views can greatly benefit from our outer join elimination technique. Finally, we describe performance improvement results of applying these techniques to the TPC-H benchmark.
doi_str_mv 10.1007/978-3-540-30075-5_70
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16164009</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16164009</sourcerecordid><originalsourceid>FETCH-LOGICAL-p228t-4fe53072575b673435bdde01dedd76520f61483c378aebc55010a4f0d10036463</originalsourceid><addsrcrecordid>eNotkMlOwzAQhs0mEUregEMu3DCMPV6SI7RlU1ElKGfLiR0ItEkVhwNvj9Myl9G_aKT5CLlgcM0A9E2hc4pUCqAYpaTSaDggZxidnVEckoQpxiiiKI5IGvtjxnmBCo5JElucFlrgKUlD-II4DCXkeUKulj-D77Pnrmmz-brZNK0dmq7Nohw-fbbyvXV2sNnr7O7l7Zyc1HYdfPq_J-T9fr6aPtLF8uFperugW87zgYraSwTNpZal0ihQls55YM47p5XkUCsmcqxQ59aXlZTAwIoaXHwWlVA4IZf7u1sbKruue9tWTTDbvtnY_tfEV5UAKGKP73shRu2H703Zdd_BMDAjNxM5GDSRhNlhMiM3_ANHWVgO</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Outer Join Elimination in the Teradata RDBMS</title><source>Springer Books</source><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ghazal, Ahmad ; Crolotte, Alain ; Bhashyam, Ramesh</creator><contributor>Galindo, Fernando ; Takizawa, Makoto ; Traunmüller, Roland</contributor><creatorcontrib>Ghazal, Ahmad ; Crolotte, Alain ; Bhashyam, Ramesh ; Galindo, Fernando ; Takizawa, Makoto ; Traunmüller, Roland</creatorcontrib><description>Queries in rela tional DBMS are getting more and more complex especially in the decision support environment. Also, tools generate most SQL queries received by commercial DBMS engines with not much user control. Query rewrite plays an important role in optimizing these co mplex and tool – generated queries. One important such technique is eliminating redu ndant joins whenever possible. In this paper, we present a new solution for outer join elimination. This solution was implemented in the Teradata DBMS part of V2R5.1. As an example, we show how applications based on vertical partitioning and universal views can greatly benefit from our outer join elimination technique. Finally, we describe performance improvement results of applying these techniques to the TPC-H benchmark.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540229360</identifier><identifier>ISBN: 3540229361</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540300759</identifier><identifier>EISBN: 9783540300755</identifier><identifier>DOI: 10.1007/978-3-540-30075-5_70</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Outer Table ; Query Optimization ; Referential Integrity ; Semantic Query ; Software ; Vertical Partitioning</subject><ispartof>Database and Expert Systems Applications, 2004, p.730-740</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30075-5_70$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30075-5_70$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16164009$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Galindo, Fernando</contributor><contributor>Takizawa, Makoto</contributor><contributor>Traunmüller, Roland</contributor><creatorcontrib>Ghazal, Ahmad</creatorcontrib><creatorcontrib>Crolotte, Alain</creatorcontrib><creatorcontrib>Bhashyam, Ramesh</creatorcontrib><title>Outer Join Elimination in the Teradata RDBMS</title><title>Database and Expert Systems Applications</title><description>Queries in rela tional DBMS are getting more and more complex especially in the decision support environment. Also, tools generate most SQL queries received by commercial DBMS engines with not much user control. Query rewrite plays an important role in optimizing these co mplex and tool – generated queries. One important such technique is eliminating redu ndant joins whenever possible. In this paper, we present a new solution for outer join elimination. This solution was implemented in the Teradata DBMS part of V2R5.1. As an example, we show how applications based on vertical partitioning and universal views can greatly benefit from our outer join elimination technique. Finally, we describe performance improvement results of applying these techniques to the TPC-H benchmark.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Outer Table</subject><subject>Query Optimization</subject><subject>Referential Integrity</subject><subject>Semantic Query</subject><subject>Software</subject><subject>Vertical Partitioning</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540229360</isbn><isbn>3540229361</isbn><isbn>3540300759</isbn><isbn>9783540300755</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkMlOwzAQhs0mEUregEMu3DCMPV6SI7RlU1ElKGfLiR0ItEkVhwNvj9Myl9G_aKT5CLlgcM0A9E2hc4pUCqAYpaTSaDggZxidnVEckoQpxiiiKI5IGvtjxnmBCo5JElucFlrgKUlD-II4DCXkeUKulj-D77Pnrmmz-brZNK0dmq7Nohw-fbbyvXV2sNnr7O7l7Zyc1HYdfPq_J-T9fr6aPtLF8uFperugW87zgYraSwTNpZal0ihQls55YM47p5XkUCsmcqxQ59aXlZTAwIoaXHwWlVA4IZf7u1sbKruue9tWTTDbvtnY_tfEV5UAKGKP73shRu2H703Zdd_BMDAjNxM5GDSRhNlhMiM3_ANHWVgO</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Ghazal, Ahmad</creator><creator>Crolotte, Alain</creator><creator>Bhashyam, Ramesh</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Outer Join Elimination in the Teradata RDBMS</title><author>Ghazal, Ahmad ; Crolotte, Alain ; Bhashyam, Ramesh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p228t-4fe53072575b673435bdde01dedd76520f61483c378aebc55010a4f0d10036463</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Outer Table</topic><topic>Query Optimization</topic><topic>Referential Integrity</topic><topic>Semantic Query</topic><topic>Software</topic><topic>Vertical Partitioning</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ghazal, Ahmad</creatorcontrib><creatorcontrib>Crolotte, Alain</creatorcontrib><creatorcontrib>Bhashyam, Ramesh</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ghazal, Ahmad</au><au>Crolotte, Alain</au><au>Bhashyam, Ramesh</au><au>Galindo, Fernando</au><au>Takizawa, Makoto</au><au>Traunmüller, Roland</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Outer Join Elimination in the Teradata RDBMS</atitle><btitle>Database and Expert Systems Applications</btitle><date>2004</date><risdate>2004</risdate><spage>730</spage><epage>740</epage><pages>730-740</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540229360</isbn><isbn>3540229361</isbn><eisbn>3540300759</eisbn><eisbn>9783540300755</eisbn><abstract>Queries in rela tional DBMS are getting more and more complex especially in the decision support environment. Also, tools generate most SQL queries received by commercial DBMS engines with not much user control. Query rewrite plays an important role in optimizing these co mplex and tool – generated queries. One important such technique is eliminating redu ndant joins whenever possible. In this paper, we present a new solution for outer join elimination. This solution was implemented in the Teradata DBMS part of V2R5.1. As an example, we show how applications based on vertical partitioning and universal views can greatly benefit from our outer join elimination technique. Finally, we describe performance improvement results of applying these techniques to the TPC-H benchmark.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30075-5_70</doi><tpages>11</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Database and Expert Systems Applications, 2004, p.730-740
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_16164009
source Springer Books; IEEE Electronic Library (IEL) Conference Proceedings
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Information systems. Data bases
Memory organisation. Data processing
Outer Table
Query Optimization
Referential Integrity
Semantic Query
Software
Vertical Partitioning
title Outer Join Elimination in the Teradata RDBMS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T13%3A03%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Outer%20Join%20Elimination%20in%20the%20Teradata%20RDBMS&rft.btitle=Database%20and%20Expert%20Systems%20Applications&rft.au=Ghazal,%20Ahmad&rft.date=2004&rft.spage=730&rft.epage=740&rft.pages=730-740&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540229360&rft.isbn_list=3540229361&rft_id=info:doi/10.1007/978-3-540-30075-5_70&rft_dat=%3Cpascalfrancis_sprin%3E16164009%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540300759&rft.eisbn_list=9783540300755&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true