Skip to main content
SpringerLink
Log in

Single access hashing with overflow separators for dynamic files

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The dynamic external hashing proposed in this paper allocates records according to the spiral storage technique. Separators derived from the signature technique are used for distinguishing primary from overflow records and for subdividing overflow chains into segments allocated into the primary file. Single access retrieval is obtained by means of a main memory index with an entry per bucket and containing separators and pointers. While this method uses a larger index than other recent proposals, it is much more convenient regarding load factor and insertion cost. Furthermore, file expansion is directed by various control parameters, thus allowing the user to choose the most suitable policy for his application.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Cesarini and G. Soda:Dynamic hashing with signature functions. ACM Trans. on Database Systems, vol. 16, no. 2, 1991, 309–337.

    Google Scholar 

  2. R. J. Enbody and H. C. Du:Dynamic hashing schemes, ACM Computing Surveys, vol. 20, n. 2, 1988, 85–113.

    Google Scholar 

  3. R. Fagin, J. Nievergelt, N. Pippenger and H. R. Strong:Extendible hashing — a fast access method for dynamic files, ACM Trans. on Database Systems, vol. 4, n. 3, 1979, 315–344.

    Google Scholar 

  4. G. H. Gonnet and P. Å. Larson:External hashing with limited internal storage, Proc. of the ACM Symposium on Principles of Database Systems, ACM, New York, 1982, 256–261.

    Google Scholar 

  5. G. H. Gonnet and P. Å. Larson:External hashing with limited internal storage, Journal of the ACM, vol. 35, n. 1, 1988, 161–184.

    Google Scholar 

  6. P. Kjelberg and T. U. Zahle:Cascade hashing, Proc. of 10th Int. Conf. on Very Large Data Bases, Singapore, 1984, 481–492.

  7. P. Å. Larson and A. Kaila:File organization: implementation of a method guaranteeing retrieval in one access. Communications of the ACM, vol. 27, n. 7, 1984, 670–677.

    Google Scholar 

  8. P. Å. Larson:Dynamic hashing, BIT, vol. 18, n. 2, 1978, 184–201.

    Google Scholar 

  9. P. Å. Larson:Linear hashing with separators — a dynamic hashing scheme achieving one-access retrieval, ACM Trans. on Database Systems, vol. 13, n. 3, 1988, 366–388.

    Google Scholar 

  10. J. K. Mullin:Spiral storage: efficient dynamic hashing with constant performance, The Computer Journal, vol. 28, n. 3, 1985, 330–334.

    Google Scholar 

  11. M. V. Ramakrishna and P. Å. Larson:File organization using composite perfect functions, ACM Trans. on Database Systems, vol. 14, n. 2, 1989, 231–263.

    Google Scholar 

  12. M. V. Ramakrishna and W. R. Tout:Dynamic external hashing with guaranteed single access retrieval, Proc. of FODO89, Paris, 1989, 187–201.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università di Firenze, Via S. Marta 3, 50139, Firenze, Italy

    F. Cesarini & G. Soda

Authors
  1. F. Cesarini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Soda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cesarini, F., Soda, G. Single access hashing with overflow separators for dynamic files. BIT 33, 15–28 (1993). https://doi.org/10.1007/BF01990340

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01990340

Classification CR

Keywords

Search

Navigation