Skip to main content
SpringerLink
Log in

Tried Linear Hashing

  • Conference paper
  • First Online:
Advances in Computing Science ASIAN 98 (ASIAN 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1538))

Included in the following conference series:

  • 164 Accesses

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

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ilsoo Ahn: Filtered Hashing. LNCS 730, 85–96.

    Google Scholar 

  2. C.H. Ang, S.T. Tan, and T.C. Tan, Filtered linear hashing, in preparation.

    Google Scholar 

  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. Walter A. Burkhard, Interpolation-Based Index Maintenance, BIT 23(1983), 274–294.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  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. 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. 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. 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.

    Article  MathSciNet  Google Scholar 

  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. 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. K. Ramamohanarao and J. W. Lloyd, Dynamic hashing schemes, Computer Journal 25, 4(November 1982), 478–485.

    Google Scholar 

  16. K. Ramamohanarao and R. Sacks-Davis, Recursive linear hashing, ACM Transactions on Database Systems 9, 3(September 1984), 369–391.

    Google Scholar 

  17. Aimo A. Torn, Hashing with overflow indexing, BIT 24(1984), 317–332.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, National University of Singapore, Republic of Singapore, 119260

    C. H. Ang, S. T. Tan & T. C. Tan

Authors
  1. C. H. Ang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. T. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. C. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science and Technology, National Chi-Nan University, Puli, Nantou, Taiwan

    Jieh Hsiang

  2. Research Institute for Mathematical Sciences, Kyoto University, Sakyo-ku, Kyoto, 606-8502, Japan

    Atsushi Ohori

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ang, C.H., Tan, S.T., Tan, T.C. (1998). Tried Linear Hashing. In: Hsiang, J., Ohori, A. (eds) Advances in Computing Science ASIAN 98. ASIAN 1998. Lecture Notes in Computer Science, vol 1538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49366-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-49366-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65388-2

  • Online ISBN: 978-3-540-49366-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation