An efficient hybrid join algorithm: a DB2 prototype
A new join method, called hybrid join, is proposed which uses the join-index filtering and the skip sequential prefetch mechanism for efficient data access. With this method, the outer table is sorted on the join column. Then, the outer is joined with the index on the join column of the inner. The i...
Saved in:
Published in | [1991] Proceedings. Seventh International Conference on Data Engineering pp. 171 - 180 |
---|---|
Main Authors | , , , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE Comput. Soc. Press
1991
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | A new join method, called hybrid join, is proposed which uses the join-index filtering and the skip sequential prefetch mechanism for efficient data access. With this method, the outer table is sorted on the join column. Then, the outer is joined with the index on the join column of the inner. The inner tuple is represented by its surrogate, equivalent of its physical disk address, which is carried in the index. The partial join result is sorted on the surrogate and then the inner table is accessed sequentially to complete the join result. Local predicate filtering can also be applied before the access of the inner relation through the index AND/ORing. Efficient methods for skip sequential access and prefetching of logically discontiguous leaf pages of B/sup +/-tree indexes are also presented.< > |
---|---|
AbstractList | A new join method, called hybrid join, is proposed which uses the join-index filtering and the skip sequential prefetch mechanism for efficient data access. With this method, the outer table is sorted on the join column. Then, the outer is joined with the index on the join column of the inner. The inner tuple is represented by its surrogate, equivalent of its physical disk address, which is carried in the index. The partial join result is sorted on the surrogate and then the inner table is accessed sequentially to complete the join result. Local predicate filtering can also be applied before the access of the inner relation through the index AND/ORing. Efficient methods for skip sequential access and prefetching of logically discontiguous leaf pages of B/sup +/-tree indexes are also presented.< > |
Author | Haderle, D. Iyer, B.R. Messinger, T. Mohan, C. Wang, Y. Cheng, J. Hedges, R. |
Author_xml | – sequence: 1 givenname: J. surname: Cheng fullname: Cheng, J. organization: IBM Santa Teresa Lab., San Jose, CA, USA – sequence: 2 givenname: D. surname: Haderle fullname: Haderle, D. organization: IBM Santa Teresa Lab., San Jose, CA, USA – sequence: 3 givenname: R. surname: Hedges fullname: Hedges, R. – sequence: 4 givenname: B.R. surname: Iyer fullname: Iyer, B.R. – sequence: 5 givenname: T. surname: Messinger fullname: Messinger, T. – sequence: 6 givenname: C. surname: Mohan fullname: Mohan, C. – sequence: 7 givenname: Y. surname: Wang fullname: Wang, Y. |
BookMark | eNotj7FOwzAURS1BJaDNjpj8Awl-fklss5W0hUqVWLpXTmxTV60dOVny90QqdznbObov5DHEYAl5BVYAMPW-bzbbApSCAhDKunwgmRKSSZA1B5T4RLJhuLB5ZQWo2DPBdaDWOd95G0Z6ntrkDb1EH6i-_sbkx_Ptg2q6-eS0T3GM49TbFVk4fR1s9s8lOe62x-Y7P_x87Zv1IfdSjLmqDVZaowMu5riWVnQ4V8sKHUfXYW2F4SU3KJTSvDW8AtdBLVsjGLQMl-TtrvXW2lOf_E2n6XQ_hn-Ua0MQ |
ContentType | Conference Proceeding |
DBID | 6IE 6IL CBEJK RIE RIL |
DOI | 10.1109/ICDE.1991.131464 |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP All) 1998-Present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
EndPage | 180 |
ExternalDocumentID | 131464 |
GroupedDBID | 6IE 6IK 6IL AAJGR ACGHX ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK OCL RIE RIL |
ID | FETCH-LOGICAL-i87t-96d35aa3f127213a8e7c3513453f23fc36e7d242d3799a2bd251fc168bd701b03 |
IEDL.DBID | RIE |
ISBN | 9780818621383 0818621389 |
IngestDate | Wed Jun 26 19:33:49 EDT 2024 |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-i87t-96d35aa3f127213a8e7c3513453f23fc36e7d242d3799a2bd251fc168bd701b03 |
PageCount | 10 |
ParticipantIDs | ieee_primary_131464 |
PublicationCentury | 1900 |
PublicationDate | 19910000 |
PublicationDateYYYYMMDD | 1991-01-01 |
PublicationDate_xml | – year: 1991 text: 19910000 |
PublicationDecade | 1990 |
PublicationTitle | [1991] Proceedings. Seventh International Conference on Data Engineering |
PublicationTitleAbbrev | ICDE |
PublicationYear | 1991 |
Publisher | IEEE Comput. Soc. Press |
Publisher_xml | – name: IEEE Comput. Soc. Press |
SSID | ssj0000451390 |
Score | 1.2529562 |
Snippet | A new join method, called hybrid join, is proposed which uses the join-index filtering and the skip sequential prefetch mechanism for efficient data access.... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 171 |
SubjectTerms | Cost function Filtering Milling machines Prefetching Probes Prototypes Query processing Sorting |
Title | An efficient hybrid join algorithm: a DB2 prototype |
URI | https://ieeexplore.ieee.org/document/131464 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ05T8MwGIYt2omJq4hbHljT2rETx2zQQwUJxFCkbpWPL7QcCSrpAL8e22mLQAxIGXIoVpwo-s73MULnxEidaWIjYomKuBUQSStFlEtpuLsigHqB8-1dOnzgN-NkvORsBy0MAITmM2j73VDLt6VZ-FRZhzL3X_MGamQkrqVa63SKx6S48D0QHqnz0n39bcnXWR2zVZWSyM51t9f3Qj3arsf8sbZKMC2DrVqz_R6IhL6j5Lm9qHTbfP7iNf7zqbdR61vDh-_X1mkHbUCxh9hlgSFAI9wtePrh5Vr4qZwVWL08lvNZNX29wAr3rmLsAQ6lT9C20GjQH3WH0XLZhGiWiSqSqWWJUiynsYvumMpAGOZeDk9YHrPcsBSEdYbZMiGlirV1Hk5uaJppKwjVhO2jZlEWcIBw6v07zjlok3CgXAG46EgmMXfjGCsO0a6f7uStBmNM6pke_Xn2GG3WXVZ-O0HNar6AU2fPK30WvuQXm6Gaog |
link.rule.ids | 310,311,786,790,795,796,802,4069,4070,27956,55107 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV05T8MwGLWgDDBxFXHjgTWtHTtxzAY91EJbMRSpW-UrtBwJKukAvx7baYtADEge7Fix4kTR-673DMAlUlwmEukAaSQCqpkJuOYsSDlX1M4wgx3BuT-IOw_0dhSNFjrbngtjjPHFZ6bmuj6Xr3M1d6GyOib2v6brYMPCPGIlWWsVUHFCKdaB9xqP2NrpLgO3UNhZjskyT4l4vdtothxVD9fKVX-cruLBpb1dsrbfvSahqyl5rs0LWVOfvxQb__ncO6D6zeKD9yt82gVrJtsH5DqDxstG2Fvg5MMRtuBTPs2geHnMZ9Ni8noFBWzehNBJOOQuRFsFw3Zr2OgEi4MTgmnCioDHmkRCkBSH1r8jIjFMEftyaETSkKSKxIZpC82aMM5FKLW1cVKF40RqhrBE5ABUsjwzhwDGzsKjlBqpImowFcZY_4hHIbXrKM2OwJ7b7vitlMYYlzs9_vPqBdjsDPu9ca87uDsBW2XNlWunoFLM5ubMonshz_1X_QL73p32 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=%5B1991%5D+Proceedings.+Seventh+International+Conference+on+Data+Engineering&rft.atitle=An+efficient+hybrid+join+algorithm%3A+a+DB2+prototype&rft.au=Cheng%2C+J.&rft.au=Haderle%2C+D.&rft.au=Hedges%2C+R.&rft.au=Iyer%2C+B.R.&rft.date=1991-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818621383&rft.spage=171&rft.epage=180&rft_id=info:doi/10.1109%2FICDE.1991.131464&rft.externalDocID=131464 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818621383/lc.gif&client=summon&freeimage=true |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818621383/mc.gif&client=summon&freeimage=true |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818621383/sc.gif&client=summon&freeimage=true |