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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Previous efforts in hashing intend to preserve data variance or pairwise affinity, but neither is adequate in capturing the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Supervised hashing aims to map the original features to compact binary codes that are able to preserve label based similarity in… (More)
  • table 2
  • table 1
  • figure 1
  • figure 2
  • table 3
Is this relevant?
2010
2010
For efficient retrieval of data, the design of the data structuring is important. Tree structures and hash tables are popular… (More)
  • figure 3
  • figure 2
  • figure 6
  • figure 5
  • table I
Is this relevant?
2009
2009
Multi-core computers have become increasingly popular, in order to improve the performance of index in database systems on multi… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1997
1997
Consider the set H of all linear (or aane) transformations between two vector spaces over a nite eld F. We study how good H is as… (More)
Is this relevant?
1997
1997
Dietzfelbingert Peter Bro Miltersen$ Erez Petrank$ 
Is this relevant?
1994
1994
Linear hashing is one of the most attractive dynamic hashing schemes. Linear hashing with partial expansions and linear hashing… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1987
1987
Concurrent access to complex shared data structures, particularly structures useful as database indices, has long been of… (More)
  • figure 1
  • table I
  • figure 2
  • figure 6
  • figure 7
Is this relevant?
1985
1985
Linear hashing is a file structure for dynamic files. In this paper, a new, simple method for handling overflow records in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1984
1984
A modification of linear hashing is proposed for which the conventional use of overflow records is avoided. Furthermore, an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?