Practical performance of Bloom filters and parallel free-text searching
Communications of the ACM
Analysis of arithmetic coding for data compression
Information Processing and Management: an International Journal - Special issue on data compression for images and texts
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
ACM Transactions on Information Systems (TOIS)
Parallel randomized load balancing
Random Structures & Algorithms
An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Geographical Region Summary Service for geographical routing
ACM SIGMOBILE Mobile Computing and Communications Review
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Make it fresh, make it quick: searching a network of personal webservers
WWW '03 Proceedings of the 12th international conference on World Wide Web
Scalable techniques for memory-efficient CDN simulations
WWW '03 Proceedings of the 12th international conference on World Wide Web
Exploiting high-level coherence information to optimize distributed shared state
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
A Decentralized, Adaptive Replica Location Mechanism
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Sharing Presence Information and Message Notification in an Ad Hoc Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Succinct specifications of portable document access policies
Proceedings of the ninth ACM symposium on Access control models and technologies
Payload attribution via hierarchical bloom filters
Proceedings of the 11th ACM conference on Computer and communications security
CARD: a contact-based architecture for resource discovery in wireless ad hoc networks
Mobile Networks and Applications
Two algorithms for fast reclustering of dynamic meshed surfaces
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Provable bounds for portable and flexible privacy-preserving access
Proceedings of the tenth ACM symposium on Access control models and technologies
Efficient lookup on unstructured topologies
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Self-organization in peer-to-peer systems
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Integrated location management and location-aided routing system for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Century papers at the first quarter-century milestone
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Succinct representation of flexible and privacy-preserving access rights
The VLDB Journal — The International Journal on Very Large Data Bases
GhostDB: querying visible and hidden data without leaks
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Enhancing P2P file-sharing with an internet-scale query processor
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
International Journal of Information and Computer Security
Cooperation among peers in an ad hoc network to support an energy efficient IM service
Pervasive and Mobile Computing
Optimizing data popularity conscious bloom filters
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A sequential indexing scheme for flash-based embedded systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Bit-probe lower bounds for succinct data structures
Proceedings of the forty-first annual ACM symposium on Theory of computing
Cache-, hash-, and space-efficient bloom filters
Journal of Experimental Algorithmics (JEA)
Improved approximate detection of duplicates for data streams over sliding windows
Journal of Computer Science and Technology
Modeling chunk availability in P2P swarming systems
ACM SIGMETRICS Performance Evaluation Review
Flexible Bloom Filters for Searching Textual Objects
Agents and Peer-to-Peer Computing
Cache-, hash- and space-efficient bloom filters
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Fast and scalable classification of structured data in the network
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
An empirical analysis of serendipitous media sharing among campus-wide wireless users
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Enhancing counting bloom filters through Huffman-coded multilayer structures
IEEE/ACM Transactions on Networking (TON)
Best position algorithms for efficient top-k query processing
Information Systems
End-to-end reliability for best-effort content-based publish/subscribe networks
Proceedings of the 5th ACM international conference on Distributed event-based system
Improved algorithms for network topology discovery
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
L-priorities bloom filter: A new member of the bloom filter family
International Journal of Automation and Computing
Error management and detection in computer networks using Bloom filters
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
A distributed, leaderless algorithm for logical location discovery in specknets
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
DeNovoND: efficient hardware support for disciplined non-determinism
Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems
Bloofi: a hierarchical Bloom filter index with applications to distributed data provenance
Proceedings of the 2nd International Workshop on Cloud Intelligence
Time- and space-efficient flow-sensitive points-to analysis
ACM Transactions on Architecture and Code Optimization (TACO)
Is it really you?: user identification via adaptive behavior fingerprinting
Proceedings of the 4th ACM conference on Data and application security and privacy
Hi-index | 0.00 |
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this draw-back when the probability of an error is sufficiently low. We introduce compressed Bloom filters, which improve performance when the Bloom filter is passed as a message, and its transmission size is a limiting factor. For example, Bloom filters have been suggested as a means for sharing Web cache information. In this setting, proxies do not share the exact contents of their caches, but instead periodically broadcast Bloom filters representing their cache. By using compressed Bloom filters, proxies can reduce the number of bits broadcast, the false positive rate, and/or the amount of computation per lookup. The cost is the processing time for compression and decompression, which can use simple arithmetic coding, and more memory use at the proxies, which utilize the larger uncompressed form of the Bloom filter.