Efficiently Monitoring Top-k Pairs over Sliding Windows

Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well studied special cases of the top-k pairs queries. In this paper, we present the first approach to answer a broad class of top-k pairs queries over sliding windows. Our framework handles multiple top-k pairs queries and each query is allowed to use a different scoring function, a different value of k and a different size of the sliding window. Although the number of possible pairs in the sliding window is quadratic to the number of objects N in the sliding window, we efficiently answer the top-k pairs query by maintaining a small subset of pairs called Kskyband which is expected to consist of O(K log(N/K)) pairs. For all the queries that use the same scoring function, we need to maintain only one K-skyband. We present efficient techniques for the K-skyband maintenance and query answering. We conduct a detaile...

• Type: Conference
• Year: 2012
• Where: ICDE
• Authors: Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Haixun Wang
• Keywords: Data Streams, Sliding Windows, Top-k Pairs