.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
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 drawback when the probability of an error is sufficiently low. We introduce compressed Bloomfilters, 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 caches. By using compressed Bloom filters, proxies can reduce the number of bits broadcast, the false positive probability, 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.
Keyword:
algorithms
computer networks
information theory
distributed computing
distributed information systems
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
A phase I study of bolus versus continuous infusion of the anti-CD19 immunotoxin, IgG-HD37-dgA, in patients with B-cell lymphoma.png)
Blood.png)
OAAI
BloodIF0
OAAI.png){kind=icon}
分享.png){kind=icon}
收藏
分享收藏
查看更多内容