Affiliation:
1. Universitat Politecnica de Catalunya
2. University of Cyprus
Abstract
Bloom filters are not able to handle deletes and inserts on multisets over time. This is important in many situations when streamed data evolve rapidly and change patterns frequently. Counting Bloom Filters (CBF) have been proposed to overcome this limitation and allow for the dynamic evolution of Bloom filters. The only dynamic approach to a compact and efficient representation of CBF are the Spectral Bloom Filters (SBF).In this paper we propose the Dynamic Count Filters (DCF) as a new dynamic and space-time efficient representation of CBF. Although DCF does not make a compact use of memory, it shows to be faster and more space efficient than any previous proposal. Results show that the proposed data structure is more efficient independently of the incoming data characteristics.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Trapezoidal Sketch: A Sketch Structure for Frequency Estimation of Data Streams;The Computer Journal;2022-08-09
2. A Sketch Framework for Approximate Data Stream Processing in Sliding Windows;IEEE Transactions on Knowledge and Data Engineering;2022
3. HSS: Faster and More Accurate Sliding Sketch by Using Half Fields;2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys);2021-12
4. Pyramid Family: Generic Frameworks for Accurate and Fast Flow Size Measurement;IEEE/ACM Transactions on Networking;2021
5. SF-Sketch: A Two-Stage Sketch for Data Streams;IEEE Transactions on Parallel and Distributed Systems;2020-10-01