计算机科学
任务(项目管理)
流式处理
数据流
国家(计算机科学)
编码(集合论)
源代码
数据挖掘
数据库
情报检索
分布式计算
程序设计语言
电信
经济
集合(抽象数据类型)
管理
作者
Xiangyang Gou,Long He,Yinda Zhang,Ke Wang,Xilai Liu,Tong Yang,Yi Wang,Bin Cui
标识
DOI:10.1145/3394486.3403144
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI