Skip to search formSkip to main contentSkip to account menu

Linear hashing

Known as: Linear hash 
Linear hashing is a dynamic hash table algorithm invented by Witold Litwin (1980), and later popularized by Paul Larson. Linear hashing allows for… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
  • H. Samet
  • 2007
  • Corpus ID: 263067440
An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures… 
2006
2006
We study the problem of bulk loading a linear hash file; the problem is that a good hash function is able to distribute records… 
1990
1990
Based on seven assumptions, the following comparison factors are used to compare the performance of linear hashing with… 
1990
1990
This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher… 
1989
1989
  • N. HachemP. Berra
  • 1989
  • Corpus ID: 42208563
A novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as… 
1985
1985
A class or order preserving key associative access methods based cm linear hashing is presented. The overwhelming advantage of… 
Highly Cited
1984
Highly Cited
1984
A modification of linear hashing is proposed for which the conventional use of overflow records is avoided. Furthermore, an…