Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Optimal Semijoins for Distributed Database Systems
IEEE Transactions on Software Engineering
An algorithm for approximate membership checking with application to password security
Information Processing Letters
PERF join: an alternative to two-way semijoin and bloomjoin
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Membership in Constant Time and Almost-Minimum Space
SIAM Journal on Computing
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
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Geographical Region Summary Service for geographical routing
ACM SIGMOBILE Mobile Computing and Communications Review
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
New directions in traffic measurement and accounting
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Computing Iceberg Queries Efficiently
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
R* Optimizer Validation and Performance Evaluation for Distributed Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Self-organization in peer-to-peer systems
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
IEEE Transactions on Information Theory - Part 1
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An optimal Bloom filter replacement
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Chisel: A Storage-efficient, Collision-free Hash-based Network Processing Architecture
Proceedings of the 33rd annual international symposium on Computer Architecture
Beyond bloom filters: from approximate membership checks to approximate state machines
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Information Processing Letters
Building high accuracy bloom filters using partitioned hashing
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Simple summaries for hashing with choices
IEEE/ACM Transactions on Networking (TON)
Optimizing data popularity conscious bloom filters
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Bloomier Filters: A Second Look
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
PERG-Rx: a hardware pattern-matching engine supporting limited regular expressions
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Efficient access enforcement in distributed role-based access control (RBAC) deployments
Proceedings of the 14th ACM symposium on Access control models and technologies
Hash, don't cache: fast packet forwarding for enterprise edge routers
Proceedings of the 1st ACM workshop on Research on enterprise networking
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
Tightly packed tries: how to fit large models into memory, and make them load fast, too
SETQA-NLP '09 Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing
BUFFALO: bloom filter forwarding architecture for large organizations
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stream-based randomised language models for SMT
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
IEEE/ACM Transactions on Networking (TON)
Efficient continuous scanning in RFID systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
An empirical analysis of serendipitous media sharing among campus-wide wireless users
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Storing the web in memory: space efficient language models with constant time retrieval
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Cardinality estimation and dynamic length adaptation for Bloom filters
Distributed and Parallel Databases
Divide and discriminate: algorithm for deterministic and fast hash lookups
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Improving retouched Bloom filter for trading off selected false positives against false negatives
Computer Networks: The International Journal of Computer and Telecommunications Networking
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
Robust Record Linkage Blocking Using Suffix Arrays and Bloom Filters
ACM Transactions on Knowledge Discovery from Data (TKDD)
Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arrays
A Generalized Bloom Filter to Secure Distributed Network Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Faster and smaller N-gram language models
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
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)
COCA filters: co-occurrence aware bloom filters
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
CLAP: Collaborative pattern mining for distributed information systems
Decision Support Systems
COPSS: An Efficient Content Oriented Publish/Subscribe System
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
String matching on the internet
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
De dictionariis dynamicis pauco spatio utentibus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Fast dynamic multiple-set membership testing using combinatorial bloom filters
IEEE/ACM Transactions on Networking (TON)
International Journal of Bio-Inspired Computation
Exact pattern matching with feed-forward bloom filters
Journal of Experimental Algorithmics (JEA)
Practical perfect hashing in nearly optimal space
Information Systems
Design strategies for minimal perfect hash functions
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
MAPLE: a scalable architecture for maintaining packet latency measurements
Proceedings of the 2012 ACM conference on Internet measurement conference
Duplicate detection in pay-per-click streams using temporal stateful Bloom filters
International Journal of Data Analysis Techniques and Strategies
Space-efficient and exact de bruijn graph representation based on a bloom filter
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
A novel approach for leveraging co-occurrence to improve the false positive error in signature files
Journal of Discrete Algorithms
Area-efficient near-associative memories on FPGAs
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Fast and deterministic hash table lookup using discriminative bloom filters
Journal of Network and Computer Applications
An efficient hybrid approach to per-flow state tracking for high-speed networks
Computer Communications
Survey Bloom filter applications in network security: A state-of-the-art survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Memory efficient sanitization of a deduplicated storage system
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction generalizes the classical Bloom filter, an ingenious hashing scheme heavily used in networks and databases, whose main attribute---space efficiency---is achieved at the expense of a tiny false-positive rate. Whereas Bloom filters can handle only set membership queries, our Bloomier filters can deal with arbitrary functions. We give several designs varying in simplicity and optimality, and we provide lower bounds to prove the (near) optimality of our constructions.