A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table.

Wei-Pang Yang, M. W. Du: A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table. VLDB 1984: 245-254

@inproceedings{DBLP:conf/vldb/YangD84,
  author    = {Wei-Pang Yang and
               M. W. Du},
  editor    = {Umeshwar Dayal and
               Gunter Schlageter and
               Lim Huat Seng},
  title     = {A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator
               Table},
  booktitle = {Tenth International Conference on Very Large Data Bases, August
               27-31, 1984, Singapore, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1984},
  isbn      = {0-934613-16-8},
  pages     = {245-254},
  ee        = {db/conf/vldb/YangD84.html},
  crossref  = {DBLP:conf/vldb/84},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

This paper presents a new dynamic file organization scheme based on hashing. The hash functions used here, being defined by extended hash indicator tables (EHITs), are both dynamic and perfect. The allocated storage space can be enlarged and shrunk without reorganizing the data file. Simulation results show that the storage utilization is approximately equal to 70% in an experiment where the number of rehash functions s=7, the size of a segment r=lO, and the size of the key set n varies from 1 to 1000. Since the hash functions are perfect, the retrieval operation needs only one disk access.

Copyright © 1984 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" 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/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" 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/aDVD1 or /dvd

Printed Edition

Umeshwar Dayal, Gunter Schlageter, Lim Huat Seng (Eds.): Tenth International Conference on Very Large Data Bases, August 27-31, 1984, Singapore, Proceedings. Morgan Kaufmann 1984, ISBN 0-934613-16-8
Contents

References

[1]: M. R. Anderson, M. G. Anderson: Comments on Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. Commun. ACM 22(2): 104(1979)
[2]: C. C. Chang: The Study of an Ordered Minimal Perfect Hashing Scheme. Commun. ACM 27(4): 384-387(1984)
[3]: Richard J. Cichelli: Minimal Perfect Hash Functions Made Simple. Commun. ACM 23(1): 17-19(1980)
[4]: ...
[5]: ...
[6]: ...
[7]: M. W. Du, T. M. Hsieh, K. F. Jea, D. W. Shieh: The Study of a New Perfect Hash Scheme. IEEE Trans. Software Eng. 9(3): 305-313(1983)
[8]: 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)
[9]: ...
[10]: Gerhard Jaeschke: Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions. Commun. ACM 24(12): 829-833(1981)
[11]: Gary D. Knott: Expandable Open Addressing Hash Table Storage and Retrieval. SIGFIDET Workshop 1971: 187-206
[12]: Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
[13]: Per-Åke Larson: Dynamic Hashing. BIT 18(2): 184-201(1978)
[14]: Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980: 224-232
[15]: Per-Åke Larson: Performance Analysis of Linear Hashing with Partial Expansions. ACM Trans. Database Syst. 7(4): 566-587(1982)
[16]: Witold Litwin: Virtual Hashing: A Dynamically Changing Hashing. VLDB 1978: 517-523
[17]: Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223
[18]: Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29
[19]: W. D. Maurer: An Improved Hash Code for Scatter Storage. Commun. ACM 11(1): 35-37(1968)
[20]: W. D. Maurer, T. G. Lewis: Hash Table Methods. ACM Comput. Surv. 7(1): 5-19(1975)
[21]: Haim Mendelson: Analysis of Extendible Hashing. IEEE Trans. Software Eng. 8(6): 611-619(1982)
[22]: Robert Morris: Scatter Storage Techniques. Commun. ACM 11(1): 38-44(1968)
[23]: Kotagiri Ramamohanarao, John W. Lloyd: Dynamic Hashing Schemes. Comput. J. 25(4): 478-485(1982)
[24]: Michel Scholl: New File Organizations Based on Dynamic Hashing. ACM Trans. Database Syst. 6(1): 194-211(1981)
[25]: Dennis G. Severance: Identifier Search Mechanisms: A Survey and Generalized Model. ACM Comput. Surv. 6(3): 175-194(1974)
[26]: Renzo Sprugnoli: Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. Commun. ACM 20(11): 841-850(1977)
[27]: Markku Tamminen: Extendible Hashing with Overflow. Inf. Process. Lett. 15(5): 227-232(1982)
[28]: ...
[29]: ...
[30]: ...
[31]: Andrew Chi-Chih Yao: A Note on the Analysis of Extendible Hashing. Inf. Process. Lett. 11(2): 84-86(1980)