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
Book ChapterDOI
Priority Queues: Small, Monotone and Trans-dichotomous
TL;DR: Two data-structuring problems which involve performing priority queue (pq) operations on a set of integers in the range 0..2w−1 on a unit-cost RAM with word size ω bits are considered.
Proceedings ArticleDOI
Fast moment estimation in data streams in optimal space
TL;DR: In this article, a space-optimal streaming algorithm with update time O(log2(1/e)loglog( 1/e)) for approximating the pth frequency moment, 0 was given.
Journal ArticleDOI
Dynamic ordered sets with exponential search trees
Arne Andersson,Mikkel Thorup +1 more
TL;DR: The best known deterministic linear space bound is O(√ log n/log log n) due to as discussed by the authors, where n is the number of integer keys in an ordered set.
Proceedings ArticleDOI
Are bitvectors optimal
TL;DR: Deterministic schemes for the static membership problem are considered and tradeoffs between space and the number of probes are shown.
Proceedings ArticleDOI
Lower bounds for union-split-find related problems on random access machines
TL;DR: This work proves Ω(√log log n) lower bounds on the random access machine complexity of several dynamic, partially dynamic and static data structure problems, including the union-split-find problem, dynamic prefix problems and one-dimensional range query problems.
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.