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
Posted Content
Effective protocols for low-distance file synchronization
TL;DR: A survey of results known for this communication complexity problem in the case when files are "similar" in the sense of Hamming distance is presented and some improvements of previous constructions are proposed.
Posted Content
Optimal Top-k Document Retrieval ∗
Gonzalo Navarro,Yakov Nekrich +1 more
TL;DR: A data structure that uses linear space and and reports k most relevant documents that contain a query pattern P, which is a string of length p, in time O(p/logn+k), which is optimal in the RAM model in the general case where lgD = �(logn), and involves a novel RAM-optimal suffix tree search.
Journal ArticleDOI
m-Bonsai: a Practical Compact Dynamic Trie
TL;DR: In this article, the authors consider the problem of implementing a space-efficient dynamic trie with an emphasis on good practical performance, for a trie having n nodes with an alphabet of size σ.
Two-way hashing with separate chaining and linear probing
TL;DR: An Ω(log log n) universal lower bound is proved on the worst-case search time of any two-way linear probing algorithm, where n is the hash table size.
Journal ArticleDOI
Predecessor Search
TL;DR: The predecessor problem is a key component of the fundamental sorting-and-searching core of algorithmic problems as mentioned in this paper, and it has a rich universe of data structures, algorithms, and lower bounds.
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.