View : 187 Download: 0

Set Reconciliation Using Ternary and Invertible Bloom Filters

Title
Set Reconciliation Using Ternary and Invertible Bloom Filters
Authors
LeeSeungeunByunHayoungLimHyesook
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2023
Journal Title
IEEE Transactions on Knowledge and Data Engineering
ISSN
1041-4347JCR Link
Citation
IEEE Transactions on Knowledge and Data Engineering vol. 35, no. 11, pp. 11885 - 11898
Keywords
Invertible Bloom filterset reconciliationternary Bloom filter
Publisher
IEEE Computer Society
Indexed
SCIE; SCOPUS WOS scopus
Document Type
Article
Abstract
Set reconciliation between different hosts to hold the same dataset is an important prerequisite in numerous distributed applications. Sending the entire dataset to achieve set reconciliation is inefficient if the majority of the data owned by each host is the same. Each host is required to send exclusive elements uniquely included in its set to the other to minimize communication complexity. This paper proposes an efficient algorithm for a host to identify its exclusive elements using the recursive comparison of ternary Bloom filters, each representing the signature of a subset of elements and used for filtering out subsets with identical elements. Hence, subsets with exclusive elements are identified, and elements included in the identified subsets are programmed to an invertible Bloom filter (IBF) to be sent to the other host. Thus, the number of elements programmed in the IBF is significantly reduced. Simulation results show that the proposed algorithm provides excellent performance compared with existing set reconciliation algorithms under the constraint of the same amount of data communication. © 1989-2012 IEEE.
DOI
10.1109/TKDE.2023.3237009
Appears in Collections:
공과대학 > 전자전기공학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE