The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A note on when to chain overflow items within a direct-access table
Communications of the ACM
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering
Communications of the ACM
Communications of the ACM
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Reducing the retrieval time of hashing method by using predictors
Communications of the ACM
An introduction to computed chaining
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Fast and compact hash tables for integer keys
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Minimal perfect hashing: A competitive method for indexing internal memory
Information Sciences: an International Journal
Cache-Conscious collision resolution in string hash tables
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 48.23 |
This paper presents pseudochaining as a new collision-resolution method. Pseudochaining is half way between open addressing and chaining. It owes its name to the fact that link fields are present in each cell of the hash table which permits “chaining” of the first overflow items in the table. The efficiency of the method is derived and a tradeoff analysis is given.