37 search results - page 3 / 8 » A Fast Algorithm for Approximate Quantiles in High Speed Dat... |
ICDE
2002
IEEE
14 years 7 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
VLDB
2005
ACM
13 years 11 months ago
2005
ACM
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...
DAWAK
2004
Springer
13 years 11 months ago
2004
Springer
Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose SCLOPE, a novel algorith...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
DAWAK
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...