article

Free access

Extendible hashing—a fast access method for dynamic files

Editor: David K. Hsiao Authors:

Jurg Nievergelt,

Nicholas Pippenger,

H. Raymond StrongAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 4, Issue 3

Pages 315 - 344

https://doi.org/10.1145/320083.320092

Published: 01 September 1979 Publication History

Abstract

Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data associated with a given unique identifier, or key. Unlike conventional hashing, extendible hashing has a dynamic structure that grows and shrinks gracefully as the database grows and shrinks. This approach simultaneously solves the problem of making hash tables that are extendible and of making radix search trees that are balanced. We study, by analysis and simulation, the performance of extendible hashing. The results indicate that extendible hashing provides an attractive alternative to other access methods, such as balanced trees.

References

[1]

ADELSON-VELSKII, G.M., AND LANDIS, Y.M. An algorithm for the organization of information. Dokl. Akad. Nauk SSSR 146 (1962), 263-266 (Russian). English transl, in Soviet Math. Dokl. 3 (1962), 1259-1262.

[2]

ANDERSON, T.W., AND SAMUELS, S.M. Some inequalities among binomial and Poisson probabilities. Proc. 5th Berkeley Symp. Math. Statist. and Probability, 1965, pp. 1-12.

[3]

BAYER, R., AND MCCREIGHT, E. Organization and maintenance of large ordered indexes. Acta Informatica I (1972), 173-189.

Digital Library

[4]

CARTER, J.L., AND WEGMAN, M. Universal classes of hash functions. Res. Rep. RC 6687, IBM T.J. Watson Res. Ctr., Yorktown Heights, N.Y., 1977. To appear in J. Comptr. Syst. Sci.

[5]

FREDKIN, E. Trie memory. Comm. ACM 3, 9 (Sept. 1960), 490-499.

Digital Library

[6]

OS/VS2 ISAM Logic, IBM SY26-3833.

[7]

KHINCHINE, A.Y. Mathematical Methods in the Theory of Queueing. Griffin, London, 1969.

[8]

KNOTT, G.D. Expandable open addressing hash table storage and retrieval. Proc. ACM SIGFI- DET Workshop on Data Description, Access, and Control, 1971, pp. 186-206.

Digital Library

[9]

KNUTH, D.E. The Art of Computer Programming. Addison-Wesley, Reading, Mass., 1973.

Digital Library

[10]

LARSON, P. Dynamic hashing. BIT 18 (1978), 184-201.

[11]

LITWIN, W. Virtual hashing: A dynamically changing hashing. Proc. Very Large Data Bases Conf., Berlin, 1978, pp. 517-523.

[12]

MARKOWSKY, G, CARTER, J.L., AND WEGMAN, M. Analysis of a universal class of hash functions. Lecture Notes in Computer Science 64, 1978, pp. 345-354.

[13]

MATTSON, R., GECSEI, J., SLUTZ, D., AND TRAIGER, i. Evaluation techniques for storage hierarchies. IBM Syst. J. 9, 2 (1970), 78-117.

Digital Library

[14]

MVNTZ, R, AND UZGALIS, R. Proc. Princeton Conf. on Inform. Sci. and Syst., 1970, pp. 345-349.

[15]

NEWELL, A., AND SIMON, H.A. The logic theory machine: A complex information processing system. IRE Trans. Inform. Theory 2, 3 (Sept. 1956), 61-79.

[16]

NIEVERGELT, J., AND REINGOLD, E.M. Binary search of trees of bounded balance. SIAM J. Comptng. 2 (1973), 33-43.

[17]

REINGOLD, E.M., NIEVERGELT J., AND DEO, N. Combinatorial Algorithms. Prentice-Hall, Englewood Cliffs, N.J., 1977, Ch. 6.

Digital Library

[18]

WALKER, W.A. Hybrid trees as a data structure. Ph.D. Diss., Dept. Comptr. Sci., U. of Toronto, Toronto, Ont., Canada, 1975.

Digital Library

[19]

YAO, A. C.-C. Random 3-2 trees. Acta lnformatica 9 {1978), 159-170.

Cited By

Huang WZhou JWang MZhou YZhang XZhu FLi SWang KWu F(2024)TieredHM: Hotspot-Optimized Hash Indexing for Memory-Semantic SSD-Based Hybrid MemoryIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2024.335469343:6(1755-1768)Online publication date: 16-Jan-2024
https://dl.acm.org/doi/10.1109/TCAD.2024.3354693
Ackermann EMauthe NBugiel S(2024)Work-in-Progress: Northcape: Embedded Real-Time Capability-Based Addressing2024 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)10.1109/EuroSPW61312.2024.00083(683-690)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSPW61312.2024.00083
Alam AChen K(2024)TEE-MR: Developer-friendly data oblivious programming for trusted execution environmentsComputers & Security10.1016/j.cose.2024.104119(104119)Online publication date: Sep-2024
https://doi.org/10.1016/j.cose.2024.104119
Show More Cited By

Index Terms

Extendible hashing—a fast access method for dynamic files
1. Information systems

Recommendations

Performance comparison of extendible hashing and linear hashing techniques

Based on seven assumptions, the following comparison factors are used to compare the performance of linear hashing with extendible hashing: 1. storage utilization; 2. average unsuccessful search cost; 3. average successful search cost; 4. split cost; 5. ...
A substring search algorithm in extendible hashing
Analysis of Extendible Hashing

Extendible hashing is an attractive direct-access technique which has been introduced recently. It is characterized by a combination of database-size flexibility and fast direct access. This paper derives performance measures for extendible hashing, and ...

Comments

Information & Contributors

Information

Published In

Copyright © 1979 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1979

Published in TODS Volume 4, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

566
Total Citations
View Citations
5,455
Total Downloads

Downloads (Last 12 months)747
Downloads (Last 6 weeks)70

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Huang WZhou JWang MZhou YZhang XZhu FLi SWang KWu F(2024)TieredHM: Hotspot-Optimized Hash Indexing for Memory-Semantic SSD-Based Hybrid MemoryIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2024.335469343:6(1755-1768)Online publication date: 16-Jan-2024
https://dl.acm.org/doi/10.1109/TCAD.2024.3354693
Ackermann EMauthe NBugiel S(2024)Work-in-Progress: Northcape: Embedded Real-Time Capability-Based Addressing2024 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)10.1109/EuroSPW61312.2024.00083(683-690)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSPW61312.2024.00083
Alam AChen K(2024)TEE-MR: Developer-friendly data oblivious programming for trusted execution environmentsComputers & Security10.1016/j.cose.2024.104119(104119)Online publication date: Sep-2024
https://doi.org/10.1016/j.cose.2024.104119
Dai HFurusawa K(2024)Improving the Storage Utilization of 0-Complete TreesSN Computer Science10.1007/s42979-024-03268-45:7Online publication date: 9-Oct-2024
https://doi.org/10.1007/s42979-024-03268-4
Chen ZHu DChe WSun JChen H(2024)A quantitative evaluation of persistent memory hash indexesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00812-133:2(375-397)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00778-023-00812-1
Liu JJin SWang DLi H(2024)An archive‐based method for efficiently handling small file problems in HDFSConcurrency and Computation: Practice and Experience10.1002/cpe.826036:24Online publication date: 20-Aug-2024
https://doi.org/10.1002/cpe.8260
Regassa DYeom HHwang J(2023)ESH: Design and Implementation of an Optimal Hashing Scheme for Persistent MemoryApplied Sciences10.3390/app13201152813:20(11528)Online publication date: 20-Oct-2023
https://doi.org/10.3390/app132011528
Cai TGao PNiu DMa YLei TDai J(2023)NEHASH: high-concurrency extendible hashing for non-volatile memoryNEHASH:面向非易失性内存的高并发可扩展哈希Frontiers of Information Technology & Electronic Engineering10.1631/FITEE.220046224:5(703-715)Online publication date: 2-Jun-2023
https://doi.org/10.1631/FITEE.2200462
Liu ZChen S(2023)Pea Hash: A Performant Extendible Adaptive Hashing IndexProceedings of the ACM on Management of Data10.1145/35889621:1(1-25)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588962
Wang KYang GLi YZhang HGao M(2023)When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent MemoriesProceedings of the ACM on Management of Data10.1145/35889591:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588959
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents