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
Journal ArticleDOI
Space-Efficient Frameworks for Top-k String Retrieval
TL;DR: This work presents the first linear-space framework that is capable of handling arbitrary score functions with near-optimal O(p + klog k) query time and derives compact space and succinct space indexes (for some specific score functions).
Proceedings ArticleDOI
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
TL;DR: The first deterministic solution to the dynamic dictionary problem with linear space, constant query time, and non-trivial update time was given in this article, with worst case time O(n ) for insertions and deletions, and worst case O(1) for lookups.
Journal ArticleDOI
The challenges of unbounded treewidth in parameterised subgraph counting problems
TL;DR: In this paper, a number of hardness results for the situation in which this bounded treewidth condition does not hold, resulting in dichotomies for some special cases of the general subgraph counting problem.
Book ChapterDOI
Explicit Deterministic Constructions for Membership in the Bitprobe Model
TL;DR: Several deterministic upper bounds are shown for the case when the number of bit probes, is small, by explicit constructions, culminating in one that uses o(m) bits of space where membership can be determined with «lg lg n» + 2 adaptive bit probes.
Efficient hash tables on the gpu
Nina Amenta,Dan A. Alcantara +1 more
TL;DR: This work examines hashing schemes from a practical perspective using NVIDIA's CUDA architecture and analyzes a set of parallel implementations for open addressing, chaining, and cuckoo hashing, identifying when applications should use one over another.
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.