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
Dissertation
Succinct Representation of Trees and Graphs
TL;DR: This thesis proposes a uniform approach for succinct representation of various families of trees, and presents a novel universal succinct representation that is able to simultaneously emulate previous ordinal tree representations of the balanced parenthesis, depth first unary degree sequence and partitioned representations using a single instance of the data structure.
Journal ArticleDOI
Bloom Filter With a False Positive Free Zone
TL;DR: A data structure called EGH filter is proposed that supports the Bloom filter operations, and besides, it can guarantee false positive free operations for a finite universe and a restricted number of elements stored in the filter.
Proceedings ArticleDOI
PTHash: Revisiting FCH Minimal Perfect Hashing
TL;DR: In this paper, Fox, Chen, and Heath (FCH) presented an improved algorithm that scales well to large sets and reduces space consumption altogether, without compromising the lookup time, and conduct an extensive experimental assessment and show that the algorithm finds functions that are competitive in space with state-of-the-art techniques and provide 2-4 times better lookup time.
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces.
TL;DR: In this article, a quasi-polynomial family of weights that isolate a vertex in any 0/1-poly(1) poly(1)-poly(n) is presented.
Proceedings Article
Static Dictionaries on RAMs: Query Time is Necessary and Sufficient
TL;DR: Any RAM instruction set which permits a linear space, constant query time solution to the static dictionary problem must have an instruction of depth , where is the word size of the machine (and the size ofthe universe).
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.