Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
Combinatorial optimization
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Membership in Constant Time and Almost-Minimum Space
SIAM Journal on Computing
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and approximate membership testers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Wavelet Based 3D Compression with Fast Random Access for Very Large Volume Data
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
An Efficient Wavelet-Based Compression Method for Volume Rendering
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
| Hi-index | 0.00 |
Bloom filtering is an important technique for space efficient storage of a conservative approximation of a set S. The set stored may have up to some specified number of "false positive" members, but all elements of S are included. In this paper we consider lossy dictionaries that are also allowed to have "false negatives". The aim is to maximize the weight of included keys within a given space constraint. This relaxation allows a very fast and simple data structure making almost optimal use of memory. Being more time efficient than Bloom filters, we believe our data structure to be well suited for replacing Bloom filters in some applications. Also, the fact that our data structure supports information associated to keys paves the way for new uses, as illustrated by an application in lossy image compression.