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
Optimal Las Vegas reduction from one-way set reconciliation to error correction
TL;DR: In this article, a time and message-size optimal Las Vegas reduction from this problem to the problem of systematic error correction of k errors for strings of length? ( n ) over an alphabet of size 2? ( log?? + log? ( u / n ) ).
Posted Content
Compressed Representations of Conjunctive Query Results
Shaleen Deep,Paraschos Koutris +1 more
TL;DR: In this article, a space-efficient compressed representation of the output of conjunctive queries is proposed, with the goal of supporting the efficient access of the intermediate compressed result for a given access pattern.
Exploiting Degrees of Freedom for Efficient Hashing in Network Applications
Thomas Zink,Marcel Waldvogel +1 more
TL;DR: The design makes fast hash table implementations cheaper, more predictable and above all, more practicaL the requirement of on-chip memory up to an order of magnitude at the cost of only minute amounts of additional hardware.
Book ChapterDOI
Minimal and Monotone Minimal Perfect Hash Functions
TL;DR: This paper surveys some of the most practical techniques and tools for the construction of MPHFs and MMPHFs, showing that very frequently the keys to be hashed are sorted in their intrinsic order.
Posted Content
A compressed dynamic self-index for highly repetitive text collections
TL;DR: This work presents the first compressed dynamic self-index named TST-index that supports not only fast pattern search but also dynamic update operation of index for highly repetitive texts.
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.