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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Linear hashing provides constant time operations for data indexing and has been widely implemented for database systems. Embedded…

2009

To protect privacy in large systems, users should be able to authenticate against a central server without disclosing their…

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…

1997

Consider the set H of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good…

1994

In this paper, we introduce a new main memory storage system called FLASH that is designed for real-time applications. The FLASH…

1992

A class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as the…

1990

This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher…

1989

A novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as…

1984

Cascade Hashing is a new dynamic hashing scheme which is based on Spiral Storage. The purpose of this paper is first to give a…

1984

This paper attempts to unify a variety of dynamic hashing methods. Spiral storage, linear hashing and to a certain extent, linear…