CBFM:cutted Bloom filter matrix for multi-dimensional membership query
In order to improve the flexibility and accuracy of mu i-dimensional membership query,a new indexing structure called CBFM(cutted Bloom filter matrix)was proposed.CBFM built the bit matrix by the Cartesian product of different bloom filters,each representing one attribute of primary data.In this way...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2016-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016061/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|