The Entry-Extensible Cuckoo Filter - Network and Parallel Computing Access content directly
Conference Papers Year : 2021

The Entry-Extensible Cuckoo Filter

Abstract

The emergence of large-scale dynamic sets in real applications brings severe challenges in approximate set representation structures. A dynamic set with changing cardinality requires an elastic capacity of the approximate set representation structure, while traditional static structures, e.g., bloom filter, cuckoo filter, and their variants cannot satisfy the requirements. Existing dynamic approximate set representation structures only provide filter-level extensions, which require a single membership query to probe all discrete filters one by one. The large number of small discrete memory accesses takes up the vast majority of query time and results in unsatisfied query performance. To address the problem, in this work we propose the entry-extensible cuckoo filter (E2CF) to reduce memory access overhead for dynamic set representation and accelerate the membership query. E2CF utilizes adjacent buckets with continuous physical addresses in a cuckoo filter to extend bucket entries, which avoids many discrete memory accesses in a query. To further make E2CF space and time efficient, we adopt asynchronous extension and fine-grained splitting methods. Experiment results show that compared to state-of-the-art designs, E2CF reduces the query and insertion time by 82% and 28%, respectively.
Fichier principal
Vignette du fichier
511910_1_En_32_Chapter.pdf (742.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03768761 , version 1 (04-09-2022)

Licence

Attribution

Identifiers

Cite

Shuiying Yu, Sijie Wu, Hanhua Chen, Hai Jin. The Entry-Extensible Cuckoo Filter. 17th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2020, Zhengzhou, China. pp.373-385, ⟨10.1007/978-3-030-79478-1_32⟩. ⟨hal-03768761⟩
18 View
5 Download

Altmetric

Share

Gmail Facebook X LinkedIn More