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
Proceedings ArticleDOI
Fast and Powerful Hashing using Tabulation
TL;DR: A survey of tabulation-based hash functions can be found in this article, where the authors consider simple tabulation and twisted tabulation, where one character is twisted with some simple operations, and the resulting hash function has powerful distributional properties.
Journal ArticleDOI
Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing
TL;DR: A new approach to lossy storage of the coefficients of wavelet transformed data is presented, which brings into play a recently proposed hashing technique that allows space efficient storage and very efficient retrieval of coefficients.
Book ChapterDOI
CHAPTER 6 – Data Structures
TL;DR: In this paper, the worst-case complexity analysis for each single operation is derived and the expected cost of the operations under this probability assumption is computed, and in an amortized analysis, the worstcase cost of a sequence of operations is studied.
Book ChapterDOI
Dictionary look-up with small errors
TL;DR: An initial effort towards a theoretical study of the small d case is made, which achieves O(m log log n) query time with O(nm log m) space for the d = 1 case.
Proceedings Article
Lossy Dictionaries
TL;DR: In this paper, lossy dictionaries that are also allowed to have "false negatives" are considered, and the aim is to maximize the weight of included keys within a given space constraint.
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.