Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,295 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Consistent hashing
Dynamic array
Extendible hashing
Hash function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Minimal perfect hashing: A competitive method for indexing internal memory
Fabiano C. Botelho
,
A. Lacerda
,
G. Menezes
,
N. Ziviani
Information Sciences
2011
Corpus ID: 45400121
2010
2010
Skein Tree Hashing on FPGA
Aric Schorr
,
M. Lukowiak
International Conference on Reconfigurable…
2010
Corpus ID: 16477496
This paper focuses on design and analysis of a Field Programmable Gate Array (FPGA) hardware for Skein’s tree hashing mode…
Expand
2002
2002
Signature-based structures for objects with set-valued attributes
Eleni Tousidou
,
Panayiotis Bozanis
,
Y. Manolopoulos
Information Systems
2002
Corpus ID: 14312517
1990
1990
A dynamic storage allocation algorithm suitable for file structures
Ricardo Baeza-Yates
Information Systems
1990
Corpus ID: 32551939
1990
1990
Performance comparison of extendible hashing and linear hashing techniques
Ashok Rathi
,
Huizhu Lu
,
G. Hedrick
Symposium on Small Systems
1990
Corpus ID: 18970057
Based on seven assumptions, the following comparison factors are used to compare the performance of linear hashing with…
Expand
1990
1990
Distributed Linear Hashing and Parallel Projection in Main Memory Databases
C. Severance
,
S. Pramanik
,
P. Wolberg
Very Large Data Bases Conference
1990
Corpus ID: 978296
This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher…
Expand
1989
1989
Key-sequential access methods for very large files derived from linear hashing
N. Hachem
,
P. Berra
[] Proceedings. Fifth International Conference on…
1989
Corpus ID: 42208563
A novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as…
Expand
1985
1985
Order preserving linear hashing using dynamic key statistics
J. T. Robinson
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
1985
Corpus ID: 16347369
A class or order preserving key associative access methods based cm linear hashing is presented. The overwhelming advantage of…
Expand
1985
1985
Concurrency and linear hashing
C. Ellis
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
1985
Corpus ID: 34340427
Hashing has long been recognized as a fast method for accessing records by key in large relatively static databases. However…
Expand
1984
1984
Cascade Hashing
Peter Kjellberg
,
T. Zahle
Very Large Data Bases Conference
1984
Corpus ID: 14311580
Cascade Hashing is a new dynamic hashing scheme which is based on Spiral Storage. The purpose of this paper is first to give a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required