Sciweavers

8 search results - page 1 / 2
» Fast Incremental Maintenance of Approximate Histograms
Sort
View
VLDB
1997
ACM
86views Database» more  VLDB 1997»
13 years 9 months ago
Fast Incremental Maintenance of Approximate Histograms
Phillip B. Gibbons, Yossi Matias, Viswanath Poosal...
STOC
2002
ACM
81views Algorithms» more  STOC 2002»
14 years 5 months ago
Fast, small-space algorithms for approximate histogram maintenance
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis...
ICDE
2000
IEEE
95views Database» more  ICDE 2000»
14 years 6 months ago
Dynamic Histograms: Capturing Evolving Data Sets
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they...
Donko Donjerkovic, Yannis E. Ioannidis, Raghu Rama...
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 6 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
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,...
Sudipto Guha, Nick Koudas
EDBT
2006
ACM
113views Database» more  EDBT 2006»
13 years 7 months ago
Deferred Maintenance of Disk-Based Random Samples
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
Rainer Gemulla, Wolfgang Lehner