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
On a compaction theorem of Ragde
TL;DR: It is demonstrated that in constant time a PRAM with n processors can move at most k items, stored in distinct cells of an array of size n, to distinct cells in an arrays of size at least k4.
Proceedings Article
Not All Keys Can Be Hashed in Constant Time (Preliminary Version)
TL;DR: A simple new model is presented that captures many natural (sequential and parallel) hashing algorithms and causes the evolution of a random tree, whose size corresponds to space (hash table size), and two notions of depth correspond respectively to the largest probe sequences for insertion (parallel insertion time) and search of a key.
Book ChapterDOI
Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search
TL;DR: A simpler analysis is provided showing that the number of lookups and distance computations closely match the Indyk-Motwani framework, making it a viable replacement in practice.
Journal ArticleDOI
Error-correcting data structures ∗
TL;DR: This new model is the common generalization of (static) data structures and locally decodable error-correcting codes (LDCs) and proves a number of upper and lower bounds on various natural error- correcting data structure problems.
Compact data structures with fast queries
TL;DR: This thesis describes compact representations of several types of data structures including variable-bit-length arrays and dictionaries, separable graphs, ordered sets, text indices, and meshes.
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.