Advertisement

Tried Linear Hashing

  • C. H. Ang
  • S. T. Tan
  • T. C. Tan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1538)

Abstract

Tried linear hashing is a combination of linear hashing and trie hashing. It expands the file gracefully as linear hashing, and organizes each chain of overflow buckets with the use of a trie to ensure that any bucket can be retrieved in one disk access

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ilsoo Ahn: Filtered Hashing. LNCS 730, 85–96.Google Scholar
  2. 2.
    C.H. Ang, S.T. Tan, and T.C. Tan, Filtered linear hashing, in preparation.Google Scholar
  3. 3.
    C.H. Ang and H. Samet, Approximate average storage utilization of bucket methods with arbitrary fanout, Nordic Journal of Computing 3(1996), 280–291.Google Scholar
  4. 4.
    Walter A. Burkhard, Interpolation-Based Index Maintenance, BIT 23(1983), 274–294.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, Extendible hashing-a fast access method for dynamic files, ACM Transactions on Database Systems 4, 3(September 1979), 315–344.Google Scholar
  6. 6.
    N. I. Hachem and P. B. Berra, Key-sequential access methods for very large files derived from linear hashing, Proceedings of the Fifth IEEE International Conference on Data Engineering, Los Angeles, February 1989, 305–312.Google Scholar
  7. 7.
    Andreas Hutflesz, Hans-Werner Six, and Peter Widmayer, Globally order preserving multidimensional linear hashing, Proceedings of the fourth IEEE International Conference on Data Engineering, Los Angeles, February 1988, 572–579.Google Scholar
  8. 8.
    D. E. Knuth, The art of computer programming, Vol. 3, Addison-Wesley, 1973.Google Scholar
  9. 9.
    P.A. Larson, Linear hashing with partial expansions, Proceedings of the Sixth International Conference on Very Large Data Bases, Montreal, October 1980, 224–232.Google Scholar
  10. 10.
    W. Litwin, Linear hashing: a new tool for file and table addressing, Proceedings of the sixth International Conference on Very Large Data Bases, Montreal, October 1980, 212–223.Google Scholar
  11. 11.
    W. Litwin, Trie hashing: further properties and performance, Proceedings of the international conference on Foundation of Data Organization, May 21–24, 1985, Kyoto, Japan, 51–60.Google Scholar
  12. 12.
    W. Litwin, N. Roussopoulos, G. Levy, and W. Hong, Trie Hashing With Controlled Load, IEEE Transactions on Software Engineering, Vol. 17, No. 7, July 1991, 678–691.CrossRefMathSciNetGoogle Scholar
  13. 13.
    G. N. N. Martin, spiral storage: incrementally augmentable hash addressed storage, Theory of computation Report No. 27, Department of Computer Science, University of Warwick, Coverntry, Great Britain, March 1979.Google Scholar
  14. 14.
    J. Nievergelt, H. Hinterberger, and K. C. Sevcik, The grid file: an adaptable, symmetric multikey file structure, ACM Transactions on Database Systems 9, 1(March 1984), 38–71.Google Scholar
  15. 15.
    K. Ramamohanarao and J. W. Lloyd, Dynamic hashing schemes, Computer Journal 25, 4(November 1982), 478–485.Google Scholar
  16. 16.
    K. Ramamohanarao and R. Sacks-Davis, Recursive linear hashing, ACM Transactions on Database Systems 9, 3(September 1984), 369–391.Google Scholar
  17. 17.
    Aimo A. Torn, Hashing with overflow indexing, BIT 24(1984), 317–332.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • C. H. Ang
    • 1
  • S. T. Tan
    • 1
  • T. C. Tan
    • 1
  1. 1.School of ComputingNational University of SingaporeRepublic of Singapore

Personalised recommendations