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
Indexing weighted sequences: Neat and efficient
TL;DR: A weighted index with the same complexities as in the most efficient previously known index by Barton et al. (CPM 2016) is obtained, but the construction is significantly simpler.
Proceedings ArticleDOI
Storing a dynamic sparse table
Alfred V. Aho,David Lee +1 more
TL;DR: A family of data structures is presented that can process a sequence of insert, delete, and lookup instructions such that each lookup and deletion is done in constant worst-case time and each insertion isdone in constant expected time.
Posted Content
RecSplit: Minimal Perfect Hashing via Recursive Splitting
TL;DR: This work proposes a new technique for storing minimal perfect hash functions with expected linear construction time and expected constant lookup time that makes it possible to build for the first time, for example, structures which need $1.56$ bits per key, in less than $2$ ms per key.
Book ChapterDOI
Improved Practical Compact Dynamic Tries
Andreas Poyias,Rajeev Raman +1 more
TL;DR: An alternative to the Bonsai data structure, m-Bonsai, is proposed that uses 1 + \epsilon n \log \sigma + O1$$ bits in expectation, and supports operations in O1 expected time again based on assumptions about the behaviour of hash functions.
Book ChapterDOI
Balanced families of perfect hash functions and their applications
Noga Alon,Shai Gutner +1 more
TL;DR: The main result is that for any constant δ > 1, a δ-balanced (n, k)-family of perfect hash functions of size 2O(k log log k) log n can be constructed in time 2O (k log Log k)n log n.
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.