Apr 25, 2022 · We propose SeeSaw Counting Filter (SSCF), which is innovated with encapsulating the vulnerable negative keys into a unified counter array named seesaw counter ...
Apr 25, 2022 · As far as we know, there have been few works regarding handling vulnerable negative keys during filtering, especially in dynamic scenarios.
Li et al. [59] proposed the seesaw counting filter for the dynamic yes/no list problem, specifically in the context of detecting malicious URLs. Mitzenmacher et ...
Seesaw Counting Filter: An Efficient Guardian for Vulnerable Negative ...
dl.acm.org › doi › fullHtml
Apr 25, 2022 · Bloom filter is an efficient data structure for filtering negative keys (keys not in a given set) with substantially small space.
Duration: 21:29
Posted: Sep 12, 2022
Posted: Sep 12, 2022
A Dynamic Filtering Framework for Vulnerable Negative Keys
www.researchgate.net › publication › 37...
This work proposes an efficient probabilistic data structure by cascading multiple Bloom filters in an optimum sequence to form a Feature extraction Cascaded ...
Missing: Guardian | Show results with:Guardian
Aug 5, 2024 · Seesaw Counting Filter: An Efficient Guardian for Vulnerable Negative Keys During Dynamic Filtering. WWW 2022: 2759-2767; 2020. [j3]. view.
Seesaw counting filter: An efficient guardian for vulnerable negative keys during dynamic filtering. M Li, D Chen, H Dai, R Xie, S Luo, R Gu, T Yang, G Chen.
Seesaw Counting Filter: An Efficient Guardian for Vulnerable Negative Keys During Dynamic Filtering. Li Meng, Deyi Chen, Haipeng Dai, Rongbiao Xie, Siqiang Luo, ...
Aug 5, 2024 · Seesaw Counting Filter: An Efficient Guardian for Vulnerable Negative Keys During Dynamic Filtering. WWW 2022: 2759-2767; 2021. [c2]. view.