发明名称 |
Method and apparatus for multiset membership testing using combinatorial bloom filters |
摘要 |
A method and apparatus providing improved set membership determination and group membership identification of candidate data elements using a single Bloom filter programmed to provide a plurality of non-zero f-bit binary vectors, where each of the f-bit binary vectors is associated with a respective group. The Bloom filter is programmed using one or more (but not all) of a plurality of hash filter sets. |
申请公布号 |
US8266506(B2) |
申请公布日期 |
2012.09.11 |
申请号 |
US20090426227 |
申请日期 |
2009.04.18 |
申请人 |
HAO FANG;KODIALAM MURALIDHARAN SAMPATH;LAKSHMAN TIRUNELL V.;SONG HAOYU;ALCATEL LUCENT |
发明人 |
HAO FANG;KODIALAM MURALIDHARAN SAMPATH;LAKSHMAN TIRUNELL V.;SONG HAOYU |
分类号 |
G06F11/00 |
主分类号 |
G06F11/00 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|