Efficiently Monitoring Top-k Pairs over Sliding Windows

@article{Shen2012EfficientlyMT,
  title={Efficiently Monitoring Top-k Pairs over Sliding Windows},
  author={Zhitao Shen and Muhammad Aamir Cheema and Xuemin Lin and Wenjie Zhang and Haixun Wang},
  journal={2012 IEEE 28th International Conference on Data Engineering},
  year={2012},
  pages={798-809}
}
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… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
15 Citations
23 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Similar Papers

Loading similar papers…