Linearizing the Directory Growth in Order Preserving Extendible Hashing.

@inproceedings{DBLP:conf/icde/Otoo88,
  author    = {Ekow J. Otoo},
  title     = {Linearizing the Directory Growth in Order Preserving Extendible
               Hashing},
  booktitle = {Proceedings of the Fourth International Conference on Data Engineering,
               February 1-5, 1988, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1988},
  isbn      = {0-8186-0827-7},
  pages     = {580-588},
  ee        = {db/conf/icde/Otoo88.html},
  crossref  = {DBLP:conf/icde/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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

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/An2-6 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/aDVD1 or /dvd

Printed Edition

References

[1]

Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX

[2]

Rudolf Bayer, Karl Unterauer: Prefix B-Trees. ACM Trans. Database Syst. 2(1): 11-26(1977) BibTeX

[3]

Ulrich Bechtold, Klaus Küspert: On the Use of Extendible Hashing Without Hashing. Inf. Process. Lett. 19(1): 21-26(1984) BibTeX

[4]

...

[5]

Luc Devroye: A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort. Acta Inf. 21: 229-237(1984) BibTeX

[6]

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

[7]

Philippe Flajolet: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Inf. 20: 345-369(1983) BibTeX

[8]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[9]

Per-Åke Larson: Dynamic Hashing. BIT 18(2): 184-201(1978) BibTeX

[10]

Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223 BibTeX

[11]

Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29 BibTeX

[12]

David B. Lomet: Digital B-Trees. VLDB 1981: 333-344 BibTeX

[13]

Haim Mendelson: Analysis of Extendible Hashing. IEEE Trans. Software Eng. 8(6): 611-619(1982) BibTeX

[14]

...

[15]

Mireille Régnier: On the Average Height of Trees in Digital Search and Dynamic Hashing. Inf. Process. Lett. 13(2): 64-66(1981) BibTeX

[16]

Markku Tamminen: Order Preserving Extendible Hashing and Bucket Tries. BIT 21(4): 419-435(1981) BibTeX

Referenced by

1. André Eickler, Carsten Andreas Gerlhof, Donald Kossmann: A Performance Evaluation of OID Mapping Techniques. VLDB 1995: 18-29
2. Richard J. Enbody, H. C. Du: Dynamic Hashing Schemes. ACM Comput. Surv. 20(2): 85-113(1988)