61 search results - page 6 / 13 » Sketching asynchronous data streams over sliding windows |
167
Voted
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
180
Voted
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
130
click to vote
ICDE
2012
IEEE
13 years 8 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...
TKDE
2008
14 years 9 months ago
2008
We propose a novel approach based on predictive quantization (PQ) for online summarization of multiple time-varying data streams. A synopsis over a sliding window of most recent en...
CIKM
2004
Springer
15 years 2 months ago
2004
Springer
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...