Computer Engineering Commons^™

Sap: Improving Continuous Top-K Queries Over Streaming Data, Rui Zhu, Bin Wang, Xiaochun Yang, Baihua Zheng, Guoren Wang

Research Collection School Of Computing and Information Systems

Continuous top-k query over streaming data is a fundamental problem in database. In this paper, we focus on the sliding window scenario, where a continuous top-k query returns the top-k objects within each query window on the data stream. Existing algorithms support this type of queries via incrementally maintaining a subset of objects in the window and try to retrieve the answer from this subset as much as possible whenever the window slides. However, since all the existing algorithms are sensitive to query parameters and data distribution, they all suffer from expensive incremental maintenance cost. In this paper, we propose …