Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 2093–2096Cite as

Linear Hashing

  • Reference work entry
  • First Online:

  • 115 Accesses

Definition

Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e., find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected query cost O(1) I/O. Compared with Extendible Hashing, Linear Hashing does not use a bucket directory, and when an overflow occurs, it is not always the overflown bucket that is split. The name Linear Hashing is used because the number of buckets grows or shrinks in a linear fashion. Overflows are handled by creating a chain of pages under the overflown bucket. The hashing function changes dynamically and at any given instant there can be at most two hashing functions used by the scheme.

Historical Background

A hash table is an in-memory data structure that associates keys with values. The primary...

This is a preview of subscription content, 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   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Recommended Reading

  1. Griswold WG, Townsend GM. The design and implementation of dynamic hashing for sets and tables in icon. Softw Pract Ex. 1993;23(4):351–67.

    Article  Google Scholar 

  2. Litwin W. Linear hashing: a new tool for file and table addressing. In: Proceedings of the Sixth International Conference on Very Large Databases; 1980. p. 212–23.

    Google Scholar 

  3. Manolopoulos Y, Lorentzos N. Performance of linear hashing schemes for primary key retrieval. Inf Syst. 1994;19(5):433–46.

    Article  Google Scholar 

  4. Schneider DA., DeWitt DJ. Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In: Proceedings of the 16th International Conference on Very Large Databases; 1990. p. 469–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Paradigm4, Inc., Waltham, MA, USA

    Donghui Zhang

  2. Aristotle University of Thessaloniki, Thessaloniki, Greece

    Yannis Manolopoulos

  3. University of Piraeus, Piraeus, Greece

    Yannis Theodoridis

  4. University of California-Riverside, Riverside, CA, USA

    Vassilis J. Tsotras

Authors
  1. Donghui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yannis Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yannis Theodoridis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vassilis J. Tsotras
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Donghui Zhang .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. University of California-Riverside, Riverside, MA, USA

    Vassilis J. Tsotras

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Zhang, D., Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J. (2018). Linear Hashing. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_742

Download citation

Publish with us

Policies and ethics

Search

Navigation