Why Sort-Merge Gives the Best Implementation of the Natural Join.

@article{DBLP:journals/sigmod/Merrett83,
  author    = {T. H. Merrett},
  title     = {Why Sort-Merge Gives the Best Implementation of the Natural Join},
  journal   = {SIGMOD Record},
  volume    = {13},
  number    = {2},
  year      = {1983},
  pages     = {39-51},
  ee        = {http://doi.acm.org/10.1145/984523.984526, db/journals/sigmod/Merrett83.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An4-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

Online Edition

Referenced by

1. Volker Markl, Martin Zirkel, Rudolf Bayer: Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm. ICDE 1999: 562-571
2. Evan P. Harris, Kotagiri Ramamohanarao: Join Algorithm Costs Revisited. VLDB J. 5(1): 64-84(1996)
3. Priti Mishra, Margaret H. Eich: Join Processing in Relational Databases. ACM Comput. Surv. 24(1): 63-113(1992)
4. Giovanni Maria Sacco: Fragmentation: A Technique for Efficient Query Processing. ACM Trans. Database Syst. 11(2): 113-133(1986)
5. Yukihiro Morita, Haruo Yokota, Kenji Nishida, Hidenori Itoh: Retrieval-By-Unification Operation on a Relational Knowledge Base. VLDB 1986: 52-59
6. Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984)