Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
Reads0
Chats0
TLDR
A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.Abstract:
A data structure for representing a set of n items from a umverse of m items, which uses space n + o(n) and accommodates membership queries m constant time is described. Both the data structure and the query algorithm are easy to ~mplement.read more
Citations
More filters
Patent
Searching for a path to identify where to move entries among hash tables with storage for multiple entries per bucket during insert operations
TL;DR: In this article, a path is determined through a search of the hash tables to identify where to move entries during insert operations among the hash table to make room for a data item being added.
Book ChapterDOI
History-Independent Cuckoo Hashing
Moni Naor,Gil Segev,Udi Wieder +2 more
TL;DR: In this paper, a history-independent dictionary based on cuckoo hashing is presented, which is an efficient and practical dynamic dictionary that provides expected amortized constant update time, worst case constant lookup time, and good memory utilization.
Posted Content
Efficient Hashing with Lookups in two Memory Accesses
TL;DR: This work presents a simple, practical hashing scheme that maintains a maximum load of 2, with high probability, while achieving high memory utilization, and analyzes the trade-off between the number of moves performed during inserts and the maximum load on a bucket.
Proceedings ArticleDOI
Fast name lookup for Named Data Networking
TL;DR: A new near-perfect hash table data structure is proposed that combines many small sparse perfect hash tables into a larger dense one while keeping the worst-case access time of O(1) and supporting fast update.
Journal ArticleDOI
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
TL;DR: This work studies the properties of other measures that arise naturally in this framework and introduces yet more notions of resource-bounded Kolmogorov complexity, to demonstrate that other complexity measures such as branching-program size and formula size can also be discussed in terms of Kolmogsorv complexity.
References
More filters
Journal ArticleDOI
Should Tables Be Sorted
TL;DR: It is shown that, in a rather general model including al1 the commonly-used schemes, $\lceil $ lg(n+l) $\rceil$ probes to the table are needed in the worst case, provided the key space is sufficiently large.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Perfect hashing functions: a single probe retrieving method for static sets
TL;DR: A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered, and a rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.
Journal ArticleDOI
Reciprocal hashing: a method for generating minimal perfect hashing functions
TL;DR: A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets, and a proof of existence for minimalperfect hash functions of a special type (reciprocal type) is given.