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
Morton filters: fast, compressed sparse cuckoo filters
TL;DR: This work introduces the Morton filter (MF), a novel CF variant that introduces several key improvements to its progenitor, and achieves improvements by introducing a compressed block format that permits storing a logically sparse filter compactly in memory.
Posted Content
De Dictionariis Dynamicis Pauco Spatio Utentibus
TL;DR: This work develops dynamic dictionaries on the word RAM that use asymptotically optimal space, up to constant factors, subject to insertions and deletions, and subject to supporting perfect-hashing queries and/or membership queries, each operation in constant time with high probability.
Proceedings ArticleDOI
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
TL;DR: This article will define a large subset of the relational calculus, called RCS, and show that all RCS queries are executable by quasi-linear algorithms, intended for data bases stored in main memory.
Proceedings Article
Fast local searches and updates in bounded universes.
TL;DR: In this paper, it was shown how to perform predecessor searches in O( log log Δ ) expected time, where Δ is the difference between the element being searched for and its predecessor in the structure.
Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint
TL;DR: The sum of weights of distinct values constraint, which can be seen as a generalization of the number of distinctvalues as well as of the alldifferent, and the relaxed alldifferent constraints, is introduced.
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.