FAQ

Open addressing

Known as: Closed hashing, Open address hash table, Open adressing 
Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2017
02419632017

Related topics

Related topics

13 relations
C++11Coalesced hashingCuckoo hashingDouble hashing
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Open addressing
Locality of reference
Hash table
Pseudocode
Cuckoo hashing
Linear probing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
On Deletions in Open Addressing Hashing
Deletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark ’deleted’ so… (More)
  • figure 1
Is this relevant?
2005
2005
Non-blocking Hashtables with Open Addressing
We present the first non-blocking hashtable based on open addressing that provides the following benefits: it combines good cache… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2004
2004
Lock-free dynamic hash tables with open addressing
We present an efficient lock-free algorithm for parallel accessible hash tables with open addressing, which promises more robust… (More)
Is this relevant?
2003
2003
Characterizing Open Addressing Hash Functions
In [1], we showed that different open addressing hash functions perform differently when the data elements are not uniformly… (More)
  • figure 1
Is this relevant?
2003
2003
Comparison of Different Open Addressing Hashing Algorithms
Hash functions are among the oldest and most widely used data structures in computer science. Different hash functions exist. So… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
1989
1989
On Aspects of Universality and Performance for Closed Hashing (Extended Abstract)
We consider two hashing models for storing a set <italic>S</italic> ⊂ {0, 1, 2, …, <italic>m</italic> - 1} in a table <italic>T… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Expected Length of the Longest Probe Sequence in Hash Code Searching
An investigation ts made o f the expected value o f the m a x i m u m number of accesses needed to locate any element m a hashing… (More)
  • table I
  • table II
  • table I
  • table IV
  • table V
Is this relevant?
1980
1980
Open-Addressing Hashing with Unequal-Probability Keys
When analyzing hashing algorithms, it is usually assumed that all keys in the table are equally likely to be accessed. In… (More)
  • table I
  • table 1
  • table II
Is this relevant?
1973
1973
Optimum Storage Allocation for a File with Open Addressing
File organizations utilizing key-to-address transformation and open addressing are studied. A simulation method and a Markov… (More)
  • figure 1
  • table 1
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1963
1963
Addressing for Random-Access Storage with Multiple Bucket Capacities
Search-time probabilities are obtained for records stored in a random-access storage. Each bucket of the storage has an n-record… (More)
  • table II
  • figure 1
Is this relevant?