An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Designing a Bloom filter for differential file access
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Computing Iceberg Queries Efficiently
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Graphs, Hypergraphs and Hashing
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Dependent Sets of Constant Weight Binary Vectors
Combinatorics, Probability and Computing
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Bloomier Filters: A Second Look
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Bloomier Filters: A Second Look
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
An Optimal Bloom Filter Replacement Based on Matrix Solving
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
The context of coordinating groups in dynamic mobile networks
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Theory and practice of monotone minimal perfect hashing
Journal of Experimental Algorithmics (JEA)
Various improvements to text fingerprinting
Journal of Discrete Algorithms
| Hi-index | 0.00 |
A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A Bloomier filtergeneralizes a Bloom filter to compactly store a function with a static support. In this article we give a simple construction of a Bloomier filter. The construction is linear in space and requires constant time to evaluate. The creation of our Bloomier filter takes linear time which is faster than the existing construction. We show how one can improve the space utilization further at the cost of increasing the time for creating the data structure.