Dynamic Hashing Schemes.

Richard J. Enbody, H. C. Du: Dynamic Hashing Schemes. ACM Comput. Surv. 20(2): 85-113(1988)

@article{DBLP:journals/csur/EnbodyD88,
  author    = {Richard J. Enbody and
               H. C. Du},
  title     = {Dynamic Hashing Schemes},
  journal   = {ACM Comput. Surv.},
  volume    = {20},
  number    = {2},
  year      = {1988},
  pages     = {85-113},
  ee        = {db/journals/csur/EnbodyD88.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.

Copyright © 1988 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 4 Issue 1, Books, VLDB-j, TODS, ..." and ...

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-1 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...

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: ACM Digital Library

Citation Page

References

[Carter and Wegman 1979]: Larry Carter, Mark N. Wegman: Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2): 143-154(1979)
[Comer and Sethi 1977]: Douglas Comer, Ravi Sethi: The Complexity of Trie Index Construction. J. ACM 24(3): 428-440(1977)
[Fagin et al. 1979]: 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)
[Flajolet 1983]: Philippe Flajolet: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Inf. 20: 345-369(1983)
[Larson 1978]: Per-Åke Larson: Dynamic Hashing. BIT 18(2): 184-201(1978)
[Larson 1980]: Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980: 224-232
[Larson 1982]: Per-Åke Larson: Performance Analysis of Linear Hashing with Partial Expansions. ACM Trans. Database Syst. 7(4): 566-587(1982)
[Larson 1985]: Per-Åke Larson: Linear Hashing with Overflow-Handling by Linear Probing. ACM Trans. Database Syst. 10(1): 75-89(1985)
[Litwin 1980]: Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223
[Lomet 1983]: David B. Lomet: Bounded Index Exponential Hashing. ACM Trans. Database Syst. 8(1): 136-165(1983)
[Lum et al. 1971]: Vincent Y. Lum, P. S. T. Yuen, M. Dodd: Key-to-Address Transform Techniques: A Fundamental Performance Study on Large Existing Formatted Files. Commun. ACM 14(4): 228-239(1971)
[Martin 1979]: ...
[Mendelson 1982]: Haim Mendelson: Analysis of Extendible Hashing. IEEE Trans. Software Eng. 8(6): 611-619(1982)
[Mullin 1981]: James K. Mullin: Tightly Controlled Linear Hashing without Separate Overflow Storage. BIT 21(4): 390-400(1981)
[Mullin 1984]: James K. Mullin: Unified Dynamic Hashing. VLDB 1984: 473-480
[Mullin 1985]: James K. Mullin: Spiral Storage: Efficient Dynamic Hashing with Constant Performance. Comput. J. 28(3): 330-334(1985)
[Otto 1988]: Ekow J. Otoo: Linearizing the Directory Growth in Order Preserving Extendible Hashing. ICDE 1988: 580-588
[Ramakrishna and Larson 1988]: M. V. Ramakrishna, Per-Åke Larson: File Organization Using Composite Perfect Hashing. ACM Trans. Database Syst. 14(2): 231-263(1989)
[Ramamohanarao and Lloyd 1982]: Kotagiri Ramamohanarao, John W. Lloyd: Dynamic Hashing Schemes. Comput. J. 25(4): 478-485(1982)
[Ramamohanarao and Sacks-Davies 1984]: Kotagiri Ramamohanarao, Ron Sacks-Davis: Recursive Linear Hashing. ACM Trans. Database Syst. 9(3): 369-391(1984)
[Scholl 1981]: Michel Scholl: New File Organizations Based on Dynamic Hashing. ACM Trans. Database Syst. 6(1): 194-211(1981)
[Severance and Duhne 1976]: Dennis G. Severance, Richardo Duhne: A Practitioner's Guide To Addressing Algorithms. Commun. ACM 19(6): 314-326(1976)
[Veklerov 1985]: Eugene Veklerov: Analysis of Dynamic Hashing with Deferred Splitting. ACM Trans. Database Syst. 10(1): 90-96(1985)
[Vitter 1982]: Jeffrey Scott Vitter: Implementations for Coalesced Hashing. Commun. ACM 25(12): 911-926(1982)