Name
Abstract | ||
|---|---|---|
Set reconciliation is a common and fundamental task in distributed systems. In many cases, given set A on $Host_A$ and set B on $Host_B$, applications need to identify those elements that appear in set A but not in set B, and vice versa. However, existing methods incur unsatisfactory space utilization and non-trivial false positives and false negatives. In this paper, we present a novel reconciliation method based on Cuckoo filter (CF). After exchanging the CFs each of which represents a set of elements, we query the local elements against the received CF to determine the elements that only belong to the local host and should be transmitted to the other host. The evaluation results indicate that the CF-based reconciliation method outperforms existing methods significantly.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3357384.3358065 | Proceedings of the 28th ACM International Conference on Information and Knowledge Management |
Keywords | Field | DocType |
bloom filter, cuckoo filter, set reconciliation | Data mining,Information retrieval,Cuckoo,Computer science | Conference |
ISBN | Citations | PageRank |
978-1-4503-6976-3 | 1 | 0.36 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lailong Luo | 1 | 18 | 6.50 |
| Deke Guo | 2 | 75 | 25.36 |
| Ori Rottenstreich | 3 | 318 | 29.90 |
| Richard T. B. Ma | 4 | 620 | 51.15 |
| Xueshan Luo | 5 | 129 | 18.12 |