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
Pairwise Independence and Derandomization
Michael Luby,Avi Wigderson +1 more
TL;DR: This set of notes gives several applications of the following paradigm, to design a probabilistic algorithm described by a sequence of random variables so that the analysis is valid assuming limited independence between the random variables.
Book ChapterDOI
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
TL;DR: A new universal class of hash functions which have many desirable features of random functions, but can be (probabilistically) constructed using sublinear time and space, and can be evaluated in constant time is presented.
Proceedings ArticleDOI
Optimal Data-Dependent Hashing for Approximate Near Neighbors
Alexandr Andoni,Ilya Razenshteyn +1 more
TL;DR: The new bound is not only optimal, but in fact improves over the best LSH data structures (Indyk, Motwani 1998) (Andoni, Indyk 2006) for all approximation factors c>1.
Journal ArticleDOI
Low Redundancy in Static Dictionaries with Constant Query Time
TL;DR: It is shown that on a unit cost RAM with word size $\Theta(\log |U|)$, a static dictionary for n-element sets with constant worst case query time can be obtained using B+O(n) bits of storage, where $B=\ceiling{\log_2\binom{|U|}{n}}$ is the minimum number of bits needed to represent all n- element subsets of U.
Journal ArticleDOI
Scalable high-speed prefix matching
TL;DR: A taxonomy for prefix matching technologies is introduced, which is used as a basis for describing, categorizing, and comparing existing approaches, and a fast scheme using binary search over hash tables, especially suited for matching long addresses, such as the 128 bit addresses proposed for use in the next generation Internet Protocol, IPv6.
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.