Fast, small-space algorithms for approximate histogram maintenance

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 389-398

  Gilbert, Anna C ^a   Guha, Sudipto ^a   Indyk, Piotr ^a   Kotidis, Yannis ^a   Muthukrishnan, S ^a   Strauss, Martin J ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INFORMATION THEORY; MATHEMATICAL TRANSFORMATIONS; VECTORS;

HAAR WAVELET REPRESENTATIONS; HISTOGRAM APPROXIMATION;

COMPUTATION THEORY;

EID: 0036038681     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509966     Document Type: Conference Paper

References (17)

1. Self-tuning histograms: Building histograms without looking at data
2. The space complexity of approximating the frequency moments
3. An approximate L1-difference algorithm for massive data streams
4. Synopsis data structures for massive data sets
5. Fast incremental maintenance of approximate histograms
6. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries
7. QuickSAND: Quick summary and analysis of network data
8. Approximating a data stream for querying and estimation: Algorithms and performance evaluation
9. Data-streams and histograms
10. Stable distributions, pseudorandom generators, embeddings and data stream computation
11. Optimal histograms with quality guarantees
12. Multi-dimensional selectivity estimation using compressed histogram information
13. Dynamic maintenance of wavelet-based histograms
14. Pseudorandom generators for space-bounded computation
15. Histograms for selectivity estimation
16. Dynamic multidimensional histograms