ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Implementation of Multi-Key Extendible Hashing as an Access Method for a Relational DBMS.

Keith L. Kelley, Marek Rusinkiewicz: Implementation of Multi-Key Extendible Hashing as an Access Method for a Relational DBMS. ICDE 1986: 124-131
@inproceedings{DBLP:conf/icde/KelleyR86,
  author    = {Keith L. Kelley and
               Marek Rusinkiewicz},
  title     = {Implementation of Multi-Key Extendible Hashing as an Access Method
               for a Relational DBMS},
  booktitle = {Proceedings of the Second International Conference on Data Engineering,
               February 5-7, 1986, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1986},
  isbn      = {0-8186-0655-X},
  pages     = {124-131},
  ee        = {db/conf/icde/KelleyR86.html},
  crossref  = {DBLP:conf/icde/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

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


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Proceedings of the Second International Conference on Data Engineering, February 5-7, 1986, Los Angeles, California, USA. IEEE Computer Society 1986, ISBN 0-8186-0655-X
Contents BibTeX

References

[1]
Azad Bolour: Optimality Properties of Multiple-Key Hashing Functions. J. ACM 26(2): 196-210(1979) BibTeX
[2]
...
[3]
...
[4]
Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344(1979) BibTeX
[5]
...
[6]
Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984) BibTeX
[7]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
[8]
Per-Åke Larson: Dynamic Hashing. BIT 18(2): 184-201(1978) BibTeX
[9]
Per-Åke Larson: Expected Worst-Case Performance of Hash Files. Comput. J. 25(3): 347-352(1982) BibTeX
[10]
Witold Litwin: Virtual Hashing: A Dynamically Changing Hashing. VLDB 1978: 517-523 BibTeX
[11]
Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223 BibTeX
[12]
John W. Lloyd: Optimal Partial-Match Retrieval. BIT 20(4): 406-413(1980) BibTeX
[13]
John W. Lloyd, Kotagiri Ramamohanarao: Partial Match Retrieval for Dynamic Files. BIT 22(2): 150-168(1982) BibTeX
[14]
John L. Pfaltz, William J. Berman, Edgar M. Cagley: Partial-Match Retrieval Using Indexed Descriptor Files. Commun. ACM 23(9): 522-528(1980) BibTeX
[15]
Kotagiri Ramamohanarao, John W. Lloyd: Partial-Match Retrieval Using Hashing and Descriptors. ACM Trans. Database Syst. 8(4): 552-576(1983) BibTeX
[16]
...

Referenced by

  1. Masaru Kitsuregawa, Lilian Harada, Mikio Takagi: Join Strategies on KB-Tree Indexed Relations. ICDE 1989: 85-93
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ICDE Proceedings: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:17:25 2009