Order preserving hash joins: sorting (almost) for free
Abstract: "Database systems must be able to produce ordered query results; either to pass them to application programs or end users or to compute standard or modern database operations for decision support such as aggregation, moving sums, moving averages, top N or bottom N. In this paper, we p...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1998
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1998,10 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Database systems must be able to produce ordered query results; either to pass them to application programs or end users or to compute standard or modern database operations for decision support such as aggregation, moving sums, moving averages, top N or bottom N. In this paper, we present a new approach that significantly speeds up the ability of database systems to produce ordered query results for join queries. We call the key element used in this approach order-preserving hash joins (or OHJ for short). Just like the well-known (index) nested-loop join method, OHJ preserves the order of one of its input tables, and thus, OHJ makes it possible to use indices or early sort operations in order to carry out the ordering part of a query very cheaply. Other than nested-loop joins, however, OHJs show good performance even if the tables involved in the query are very large, and thus, OHJs are also able to carry out the joining part of a query efficiently. We discuss a series of examples for which order-preserving hash joins are applicable and present the results of performance analyses which demonstrate that order-preserving hash joins significantly speed up the execution of many important classes of decision support queries." |
| Beschreibung: | 22, 5 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012248756 | ||
| 003 | DE-604 | ||
| 005 | 20060517 | ||
| 007 | t | ||
| 008 | 981106s1998 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)41138355 | ||
| 035 | |a (DE-599)BVBBV012248756 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-634 | ||
| 084 | |a SS 5600 |0 (DE-625)143571: |2 rvk | ||
| 100 | 1 | |a Claußen, Jens |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Order preserving hash joins |b sorting (almost) for free |c J. Claußen ; A. Kemper ; D. Kossmann |
| 246 | 1 | 3 | |a Order-preserving hash joins |
| 264 | 1 | |a Passau |c 1998 | |
| 300 | |a 22, 5 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1998,10 | |
| 520 | 3 | |a Abstract: "Database systems must be able to produce ordered query results; either to pass them to application programs or end users or to compute standard or modern database operations for decision support such as aggregation, moving sums, moving averages, top N or bottom N. In this paper, we present a new approach that significantly speeds up the ability of database systems to produce ordered query results for join queries. We call the key element used in this approach order-preserving hash joins (or OHJ for short). Just like the well-known (index) nested-loop join method, OHJ preserves the order of one of its input tables, and thus, OHJ makes it possible to use indices or early sort operations in order to carry out the ordering part of a query very cheaply. Other than nested-loop joins, however, OHJs show good performance even if the tables involved in the query are very large, and thus, OHJs are also able to carry out the joining part of a query efficiently. We discuss a series of examples for which order-preserving hash joins are applicable and present the results of performance analyses which demonstrate that order-preserving hash joins significantly speed up the execution of many important classes of decision support queries." | |
| 650 | 4 | |a Database management | |
| 650 | 4 | |a Hashing (Computer science) | |
| 650 | 4 | |a Information storage and retrieval systems | |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Kemper, Alfons |d 1958- |e Verfasser |0 (DE-588)131502573 |4 aut | |
| 700 | 1 | |a Kossmann, Donald |e Verfasser |4 aut | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1998,10 |w (DE-604)BV000905393 |9 1998,10 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008299494 | ||
Datensatz im Suchindex
| _version_ | 1804126865316642816 |
|---|---|
| any_adam_object | |
| author | Claußen, Jens Kemper, Alfons 1958- Kossmann, Donald |
| author_GND | (DE-588)131502573 |
| author_facet | Claußen, Jens Kemper, Alfons 1958- Kossmann, Donald |
| author_role | aut aut aut |
| author_sort | Claußen, Jens |
| author_variant | j c jc a k ak d k dk |
| building | Verbundindex |
| bvnumber | BV012248756 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)41138355 (DE-599)BVBBV012248756 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02924nam a2200445 cb4500</leader><controlfield tag="001">BV012248756</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060517 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">981106s1998 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)41138355</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012248756</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5600</subfield><subfield code="0">(DE-625)143571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Claußen, Jens</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Order preserving hash joins</subfield><subfield code="b">sorting (almost) for free</subfield><subfield code="c">J. Claußen ; A. Kemper ; D. Kossmann</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Order-preserving hash joins</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22, 5 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1998,10</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Database systems must be able to produce ordered query results; either to pass them to application programs or end users or to compute standard or modern database operations for decision support such as aggregation, moving sums, moving averages, top N or bottom N. In this paper, we present a new approach that significantly speeds up the ability of database systems to produce ordered query results for join queries. We call the key element used in this approach order-preserving hash joins (or OHJ for short). Just like the well-known (index) nested-loop join method, OHJ preserves the order of one of its input tables, and thus, OHJ makes it possible to use indices or early sort operations in order to carry out the ordering part of a query very cheaply. Other than nested-loop joins, however, OHJs show good performance even if the tables involved in the query are very large, and thus, OHJs are also able to carry out the joining part of a query efficiently. We discuss a series of examples for which order-preserving hash joins are applicable and present the results of performance analyses which demonstrate that order-preserving hash joins significantly speed up the execution of many important classes of decision support queries."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hashing (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information storage and retrieval systems</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kemper, Alfons</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)131502573</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kossmann, Donald</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1998,10</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1998,10</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008299494</subfield></datafield></record></collection> |
| id | DE-604.BV012248756 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:24:14Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008299494 |
| oclc_num | 41138355 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-634 |
| physical | 22, 5 S. graph. Darst. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Claußen, Jens Verfasser aut Order preserving hash joins sorting (almost) for free J. Claußen ; A. Kemper ; D. Kossmann Order-preserving hash joins Passau 1998 22, 5 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1998,10 Abstract: "Database systems must be able to produce ordered query results; either to pass them to application programs or end users or to compute standard or modern database operations for decision support such as aggregation, moving sums, moving averages, top N or bottom N. In this paper, we present a new approach that significantly speeds up the ability of database systems to produce ordered query results for join queries. We call the key element used in this approach order-preserving hash joins (or OHJ for short). Just like the well-known (index) nested-loop join method, OHJ preserves the order of one of its input tables, and thus, OHJ makes it possible to use indices or early sort operations in order to carry out the ordering part of a query very cheaply. Other than nested-loop joins, however, OHJs show good performance even if the tables involved in the query are very large, and thus, OHJs are also able to carry out the joining part of a query efficiently. We discuss a series of examples for which order-preserving hash joins are applicable and present the results of performance analyses which demonstrate that order-preserving hash joins significantly speed up the execution of many important classes of decision support queries." Database management Hashing (Computer science) Information storage and retrieval systems Mathematik (DE-588)4037944-9 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Kemper, Alfons 1958- Verfasser (DE-588)131502573 aut Kossmann, Donald Verfasser aut Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1998,10 (DE-604)BV000905393 1998,10 |
| spellingShingle | Claußen, Jens Kemper, Alfons 1958- Kossmann, Donald Order preserving hash joins sorting (almost) for free Database management Hashing (Computer science) Information storage and retrieval systems Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4037944-9 (DE-588)4026894-9 (DE-588)4196735-5 |
| title | Order preserving hash joins sorting (almost) for free |
| title_alt | Order-preserving hash joins |
| title_auth | Order preserving hash joins sorting (almost) for free |
| title_exact_search | Order preserving hash joins sorting (almost) for free |
| title_full | Order preserving hash joins sorting (almost) for free J. Claußen ; A. Kemper ; D. Kossmann |
| title_fullStr | Order preserving hash joins sorting (almost) for free J. Claußen ; A. Kemper ; D. Kossmann |
| title_full_unstemmed | Order preserving hash joins sorting (almost) for free J. Claußen ; A. Kemper ; D. Kossmann |
| title_short | Order preserving hash joins |
| title_sort | order preserving hash joins sorting almost for free |
| title_sub | sorting (almost) for free |
| topic | Database management Hashing (Computer science) Information storage and retrieval systems Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Database management Hashing (Computer science) Information storage and retrieval systems Mathematik Informatik Theoretische Informatik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT claußenjens orderpreservinghashjoinssortingalmostforfree AT kemperalfons orderpreservinghashjoinssortingalmostforfree AT kossmanndonald orderpreservinghashjoinssortingalmostforfree AT claußenjens orderpreservinghashjoins AT kemperalfons orderpreservinghashjoins AT kossmanndonald orderpreservinghashjoins |