Skip to main content
SpringerLink
Log in

Multidimensional extendible hashing for partial-match queries

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

Hashing is a well-known technique for organizing direct access files. Extendible hashing removes the restriction on the expansion of the file and thus allows dynamic files. We generalize the technique to store multi-attribute keys. Exact-match queries (searching) can be done in constant time usingn-dimensional hashing. Ann-dimensional partial-match queries givenk attributes can be answered inO(N**((n −k)/n)) time whereN is the number of records stored. It is shown thatn-dimensional hashing is a special case of one-dimensional hashing, thus the storage utilization of the buckets is independent ofn. Simulation results are presented to show the advantages of multidimensional hashing.

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. D. E. Knuth The art of computer programming, Vol. 3, Addison-Wesley (1973).

  2. R. Fagin, J. Nievergelt, N. Pippenger, and H. Strong Extendible hashing-A fast Access method for dynamic files.ACM TODS 4(3):315–344 (1979).

    Google Scholar 

  3. P. A. Larson Dynamic hashing,BIT,18:184–201 (1978).

    Google Scholar 

  4. W. Litwin Virtual Hashing: A dynamically changing Hashing,Proc. Fourth Conf. on VLDB, p. 517–523 (1978).

  5. W. Litwin Linear Hashing: A new tool for file and table addressing,Proc. sixth Conf. on VLDB, p. 212–223 (1980).

  6. J. W. Lloyd and K. Ramamohanarao Partial-match Retrieval for dynamic files,BIT 22:150–168 (1982).

    Google Scholar 

  7. T. Nakamura and T. Mizoguchi An analysis of storage utilization factor in block split data structuring scheme,Proc. Fourth Conf. on VLDB, p. 489–495 (1978).

  8. M. Scholl New file organizations based on dynamic hashing,ACM TODS,6(1):194–211 (1981).

    Google Scholar 

  9. J. J. Yang Multi dimensional extendible hashing, MS Thesis, University of Houston, (December 1982).

  10. J. L. Bentley Multi dimensional binary search trees used for associative searching,CACM 18(9):509–517 (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Houston, 77004, Houston, Texas

    Shou-Hsuan Stephen Huang

Authors
  1. Shou-Hsuan Stephen Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by a Research Initiation Grant from the University of Houston.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, SH.S. Multidimensional extendible hashing for partial-match queries. International Journal of Computer & Information Sciences 14, 73–82 (1985). https://doi.org/10.1007/BF00996923

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation