.png){kind=icon}
返回
Fast Dynamic Multiple-Set Membership Testing Using Combinatorial Bloom Filters
.png){kind=icon}
PRE
AI
DOI：10.1109/TNET.2011.2173351.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the problem of designing a data structure that can perform fast multiple-set membership testing in deterministic time. Our primary goal is to develop a hardware implementation of the data structure that uses only embedded memory blocks. Prior efforts to solve this problem involve hashing into multiple Bloom filters. Such approach needs a priori knowledge of the number of elements in each set in order to size the Bloom filter. We use a single-Bloom-filter-based approach and use multiple sets of hash functions to code for the set (group) id. Since a single Bloom filter is used, it does not need a priori knowledge of the distribution of the elements across the different sets. We show how to improve the performance of the data structure by using constant-weight error-correcting codes for coding the group id. Using error-correcting codes improves the performance of these data structures especially when there are a large number of sets. We also outline an efficient hardware-based approach to generate the large number of hash functions that we need for this data structure. The resulting data structure, COMB, is amenable to a variety of time-critical network applications.
Keyword:
Bloom filter
computer networks
data structure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
Combining Biochemical and Imaging Markers to Improve Diagnosis and Characterization of Mild Traumatic Brain Injury in the Acute Setting: Results from a Pilot Study.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容