13 search results - page 2 / 3 » Finding frequent items over sliding windows with constant up... |
ICDE
2008
IEEE
14 years 6 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...
TKDE
2008
13 years 5 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...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
SSDBM
2006
IEEE
13 years 11 months ago
2006
IEEE
Many applicationsstore data items for a pre-determined, finite length of time. Examples include slidingwindows over on-line data streams, where old data are dropped as the window...
EDBT
2011
ACM
12 years 8 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...