Distributed Metadata Management Based on Hierarchical Bloom Filters in Data Grid
Abstract
- Distributed Metadata Management Based on Hierarchical Bloom Filters in Data Grid
Recommendations
Error management and detection in computer networks using Bloom filters
ICACCI '12: Proceedings of the International Conference on Advances in Computing, Communications and InformaticsBloom filter is a compact and randomized data structure for representation of a set, in order to answer membership queries; Queries such as "Is element x in set Y?" There is no need to have set Y, for answering these kinds of questions; these questions ...
Application and Research on Weighted Bloom Filter and Bloom Filter in Web Cache
WMWA '09: Proceedings of the 2009 Second Pacific-Asia Conference on Web Mining and Web-based ApplicationA Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters and their generalizations, weighted Bloom filters and compressed Bloom filters have been suggested as a ...
The Bloom paradox: when not to use a Bloom filter
In this paper, we uncover the Bloom paradox in Bloom Filters: Sometimes, the Bloom Filter is harmful and should not be queried. We first analyze conditions under which the Bloom paradox occurs in a Bloom Filter and demonstrate that it depends on the a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
IEEE Computer Society
United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0