FeCBF: A Novel Sub-Optimal Cascaded Bloom Filter Structure Based on Feature Extraction

• Published in: IEEE access Vol. 12; pp. 67619 - 67631
• Main Authors: Duong, Quang-Manh, Nguyen, Khoa-Sang, Nguyen, Hai-Duong, Dao, Xuan-Uoc, do, Anh-Tuan, Trinh, Quang-Kien
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Big Data; big-data filter; Bloom filter; Communications traffic; Data structures; Feature extraction; Filters; Filtration; Finite element analysis; Hafnium; Hardware acceleration; Indexes; Matched filters; Mathematical models; Optimization; Optimization methods; Pattern matching; Performance measurement; probabilistic filter; Probabilistic logic
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2024.3399062

This work presents the Feature extraction Cascaded Bloom Filter (FeCBF), a novel probabilistic data structure formed by cascading multiple Bloom filters in an optimum sequence. The FeCBF's distinctive design of alternating positive and negative filter layers effectively suppresses False Positive/Negative Rates (FPR/FNR), enabling exact filtering with reasonable resource cost. Compared to other state-of-the-art designs on the same experimental dataset, FeCBF demonstrates significant memory space savings of 45% to 76% while maintaining the best FPR in its class. The proposed model also includes a closed-form expression for determining the sub-optimal FeCBF configuration based on desired filter performance metrics, offering the potential for automatic design flow. The FeCBF architecture, designed for hardware implementation, holds promise for many applications. It can be readily deployed as an accelerator in various computing problems, including massive content filtering, network traffic filtering, and online malware/virus detection.