111 search results - page 7 / 23 » Maintaining Stream Statistics over Sliding Windows |
SSDBM
2003
IEEE
15 years 3 months ago
2003
IEEE
Although traditional databases and data warehouses have been exploited widely to manage persistent data, a large number of applications from sensor network need functional support...
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
107
Voted
PODS
2006
ACM
15 years 10 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 ...
167
Voted
ICDE
2005
IEEE
15 years 11 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
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...