On Sort-Merge Algorithm for Band Joins.

@article{DBLP:journals/tkde/LuT95,
  author    = {Hongjun Lu and
               Kian-Lee Tan},
  title     = {On Sort-Merge Algorithm for Band Joins},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {7},
  number    = {3},
  year      = {1995},
  pages     = {508-510},
  ee        = {db/journals/tkde/LuT95.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society 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/An3-3 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

References

[1]

David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider: An Evaluation of Non-Equijoin Algorithms. VLDB 1991: 443-452 BibTeX

[2]

Priti Mishra, Margaret H. Eich: Join Processing in Relational Databases. ACM Comput. Surv. 24(1): 63-113(1992) BibTeX

[3]

Mauro Negri, Giuseppe Pelagatti: Join During Merge: An Improved Sort Based Algorithm. Inf. Process. Lett. 21(1): 11-16(1985) BibTeX

[4]

Valery Soloviev: A Truncating Hash Algorithm for Processing Band-Join Queries. ICDE 1993: 419-427 BibTeX

[5]

George Kingsley Zipf: Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology. Addison-Wesley 1949
BibTeX