39 search results - page 2 / 8 » Continuous monitoring of top-k queries over sliding windows |
ICDE
2012
IEEE
12 years 3 months ago
2012
IEEE
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 stu...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Abstract-- Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of efficient processing of continuous skyline que...
VLDB
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important...
ICDE
2005
IEEE
14 years 5 months ago
2005
IEEE
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
PODS
2006
ACM
14 years 4 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...