Sliding Sketches: A Framework using Time Zones for Data Stream Processing in Sliding Windows

31Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data stream processing has become a hot issue in recent years due to the arrival of big data era. There are three fundamental stream processing tasks: membership query, frequency query and heavy hitter query. While most existing solutions address these queries in fixed windows, this paper focuses on a more challenging task: answering these queries in sliding windows. While most existing solutions address different kinds of queries by using different algorithms, this paper focuses on a generic framework. In this paper, we propose a generic framework, namely Sliding sketches, which can be applied to many existing solutions for the above three queries, and enable them to support queries in sliding windows. We apply our framework to five state-of-the-art sketches for the above three kinds of queries. Theoretical analysis and extensive experimental results show that after using our framework, the accuracy of existing sketches that do not support sliding windows becomes much higher than the corresponding best prior art. We released all the source code at Github.

Cite

CITATION STYLE

APA

Gou, X., He, L., Zhang, Y., Wang, K., Liu, X., Yang, T., … Cui, B. (2020). Sliding Sketches: A Framework using Time Zones for Data Stream Processing in Sliding Windows. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1015–1025). Association for Computing Machinery. https://doi.org/10.1145/3394486.3403144

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free