Data-streams and histograms

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 471-475

  Guha, Sudipto ^a   Koudas, Nick ^a   Shim, Kyuseok ^b  

^a AT AND T LABS RESEARCH   (United States)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA COMPRESSION; DATA MINING; DATABASE SYSTEMS; MATHEMATICAL OPERATORS;

DATASETS; HISTOGRAMS;

DATA ACQUISITION;

EID: 0034819401     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380841     Document Type: Conference Paper

References (29)

1. Join synopses for approximate query answering
2. The aqua approximate query answering system
3. Progressive vector transmission
4. Random sampling for histogram construction: How much is enough?
5. 1-difference algorithm for massive data sets
6. Probabilistic counting
7. Fast incremental maintenance of approximate histograms
8. Data cube: A relational aggregation operator generalizing group-by, cross tab and sub total
9. Stable distributions, pseudorandom generators, embeddings and data stream computation
10. Universality of serial histograms
11. Optimal histograms for limiting worst-case error propagation in the size of join results
12. Histogram based approximation of set valued query answers
13. Balancing histogram optimality and practicality for query result size estimation
14. Optimal histograms with quality guarantees
15. Mining deviants in a time series database
16. Optimal histograms for hierarchical range queries
17. Approximate medians and other quantiles in one pass with limited memory
18. Random sampling techniques for space efficient online computation of order statistics of large databases
19. Wavelet-based histograms for selectivity estimation
20. Selection and sorting with limited storage
21. Equi-depth histograms for estimating selectivity factors for multidimension al queries
22. On rectangular partitioning in two dimensions: Algorithms, complexity and applications
23. Fast approximate answers to aggregate queries on a datacube
24. Estimation of query-result distribution and its application in parallel join load balancing
25. Selectivity estimation without the attribute value independence assumption
26. Improved histograms for selectivity estimation of range predicates
27. Approximate computation of multidimensional aggregates on sparse data using wavelets
28. Data cube approximation and histograms via wavelets