Set reconciliation based on counting Bloom filters
A new set reconciliation algorithm was presented,which called counting-Bloom-filter based set reconciliation(CBFSR).This method represented sets S<sub>A</sub> and S<sub>B</sub> as counting Bloom filters,subtracts S<sub>A</sub>'s counting Bloom filter from S&l...
Saved in:
Main Authors: | Xiao-mei TIAN, Da-fang ZHANG, Kun XIE, Can HU, Xiao-bo YANG, Chang-qiong SHI |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2012-08-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)08-0119-09/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Attribute-based multi-keyword searchable encryption scheme based on counting Bloom filters
by: Zhidan LI, et al.
Published: (2023-11-01) -
Combine multi-dimension Bloom filter for membership queries
by: XIE Kun1, et al.
Published: (2008-01-01) -
Duplicate elimination algorithm for data streams with SKIP Bloom filter
by: Hai-na TANG, et al.
Published: (2012-02-01) -
Traffic measurement algorithm based on least recent used and Bloom filter
by: Zhen ZHANG, et al.
Published: (2013-01-01) -
CBFM:cutted Bloom filter matrix for multi-dimensional membership query
by: Yong WANG, et al.
Published: (2016-03-01)