.png){kind=icon}
返回
Ternary Bloom Filter Replacing Counting Bloom Filter
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2016.2624286.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A counting Bloom filter (CBF) is commonly used in many applications for the membership queries of dynamic data since the CBF can provide delete operations. A CBF uses an array of c-bit counters. The c should be large enough to avoid overflows. In this letter, we propose an alternative to CBF, named ternary Bloom filter (TBF) for performance improvement. The proposed TBF allocates the minimum number of bits to each counter and includes more number of counters instead to reduce false positive probability. We present a mathematical analysis and experimental results for a set of performance measures. When the TBF consumes the same amount of memory as the CBF, the TBF provides much lower false positive rates than the CBF.
Keyword:
Bloom filter
counting Bloom filter
ternary Bloom filter
false positive rate
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容