Approximation and streaming algorithms for histogram construction problems

ACM Transactions on Database Systems

Volumn 31, Issue 1, 2006, Pages 396-438

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c Seoul National University   (South Korea)

^d THOMAS JEFFERSON UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Data Streams; Histograms

Indexed keywords

APPROXIMATION ALGORITHM; DATA STREAMS; HISTOGRAMS;

APPROXIMATION THEORY; DATA MINING; ERROR ANALYSIS; ONLINE SEARCHING; OPTIMIZATION; PROBLEM SOLVING; QUERY LANGUAGES;

ALGORITHMS;

EID: 33745187544     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1132863.1132873     Document Type: Article

References (37)

1. ACHARYA, S., GIBBONS, P., POOSALA, V., AND RAMASWAMY, S. 1999. The aqua approximate query answering system. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 574-576.
2. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 1, 137-147.
3. BEHTOLOTTO, M. AND EGENHOFER, M. J. 1999. Progressive vector transmission. In Proceedings of the 7th ACM Symposium on Advances in Geographical Information Systems, ACM, New York, 152-157.
4. BORODIN, A. AND EL-YANIV, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, MA.
5. DATAR, M., GIONIS, A., INDYK, P., AND MOTWANI, R. 2002. Maintaining stream statistics over sliding windows. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), ACM, New York, 635-644.
6. DONJERKOVIC, D., IOANNIDIS, Y. E., AND RAMAKRISHNAN, R. 1999. Dynamic histograms: Capturing evolving data sets. CS-TR 99-1396, University of Wisconsin, Madison, WI. Mar.
7. FEIGENBAUM, J., KANNAN, S., STRAUSS, M., AND VISWANATHAN, M. 2002. An approximate 11-difference algorithm for massive data streams. SIAM J. Comput. 32, 1, 131-151.
8. GAROFALAKIS, M. N. AND GIBBONS, P. B. 2002. Wavelet synopses with error guarantees. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 476-487.
9. GAROFALAKIS, M. N. AND GIBBONS, P. B. 2004. Probabilistic wavelet synopses. ACM Trans. Datab. Syst. 29, 43-90.
10. GIBBONS, P. AND MATIAS, Y. 1999. Synopsis data structures for massive data sets. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 1999). ACM, New York, 909-910.
11. GILBERT, A. C., GUHA, S., INDYK, P., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2002. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 389-398.
12. GILBERT, A. C., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2001. Optimal and approximate computation of summary statistics for range aggregates. In Proceedings of the ACM Symposium on Principles of Database Systems. ACM, New York.
13. GREENWALD, M. AND KHANNA, S. 2001. Space-efficient online computation of quantile summaries. In Proceedings of the ACM SIGMOD Conference. ACM, New York.
14. GUHA, S. 2005. Space efficiency in synopsis construction problems. In Proceedings of the VLDB Conference. 409-420.
15. GUHA, S. AND HARB, B. 2006. Approximation algorithms for wavelet transform coding of data streams. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2006). ACM, New York.
16. GUHA, S., INDYK, P., MUTHUKRISHNAN, S., AND STRAUSS, M. 2002a. Histogramming data streams with fast per-item processing. In Proceedings of the ICALP. 681-692.
17. GUHA, S., KOUDAS, N., AND SRIVASTAVA, D. 2002b. Fast algorithms for hierarchical range histogram construction. In Proceedings of the ACM Symposium on Principles of Database Systems. ACM, New York, 180-187.
18. GUHA, S. AND KOUDAS, N. 2002. Approximating a data stream for querying and estimation: Algorithms and performance evaluation. In Proceedings of the IEEE 18th International Conference on Data Engineering (ICDE'02). IEEE Computer. Society Press, Los Alamitos, CA, 567-576.
19. GUHA, S., KOUDAS, N., AND SHIM, K. 2001. Data streams and histograms. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 471-475.
20. GUHA, S., SHIM, K., AND Woo, J. 2004. REHIST: Relative error histogram construction algorithms. In Proceedings of the VLDB Conference, 300-311.
21. HOCHBAUM, D. 1996. Approximation Algorithms for NP Hard Problems. Brooks/Cole Pubishing Company.
22. INDYK, P. 2000. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 189-197.
23. IOANNIDIS, Y. AND POOSALA, V. 1995. Balancing histogram optimality and practicality for query result size estimation. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 233-244.
24. IOANNIDIS, Y. E. 1993. Universality of serial histograms. In Proceedings of the VLDB Conference, 256-267.
25. IOANNIDIS, Y. E. 2003. The history of histograms (abridged). In Proceedings of the VLDB Conference, 19-30.
26. JAGADISH, H. V., KOUDAS, N., MUTHUKRISHNAN, S., POOSALA, V., SEVCIK, K. C., AND SUEL, T. 1998. Optimal histograms with quality guarantees. In Proceedings of the VLDB Conference, 275-286.
27. KEOGH, E., CHAKRABATI, K., MEHROTRA, S., AND PAZZANI, M. 2002. Locally adaptive dimensionality reduction for indexing large time series databases. ACM Trans. Datab. Syst. 27, 2, 188-228.
28. KOOI, R. 1980. The optimization of queries in relational databases. Case Western Reserve University.
29. KOUDAS, N., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2000. Optimal histograms for hierarchical range queries. In Proceedings of the ACM Principles of Database Systems. ACM, New York, 196-204.
30. MANKU, G. S., RAJAGOPALAN, S., AND LINDSAY, B. 1998. Approximate medians and other quantiles in one pass and with limited memory. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 426-435.
31. MATIAS, Y., VITTER, J. S., AND WANG, M. 1998. Wavelet-based histograms for selectivity estimation. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 448-459.
32. MURALIKRISHNA, M. AND DEWITT, D. J. 1988. Equi-depth histograms for estimating selectivity factors for multidimensional queries. In Proceedings of the ACM SIGMOD, Conference. ACM, New York, 28-36.
33. MUTHUKRISHNAN, S. AND STRAUSS, M. 2004. Approximate histogram and wavelet summaries of streaming data. DIMACS TR 52.
34. POOSALA, V., IOANNIDIS, Y., HAAS, P., AND SHEKITA, E. 1996. Improved histograms for selectivity estimation of range predicates. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 294-305.
35. SELINGER, P. G., ASTRAHAN, M. M., CHAMBERLIN, D. D., LORIE, R. A., AND PRICE, T. G. 1979. Access path selection in a relational database management system. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 23-34.
36. THAPER, N., GUHA, S., INDYK, P., AND KOUDAS, N. 2002. Dynamic multidimensional histograms. In Proceedings of the SIGMOD Conference. ACM, New York, 428-439.
37. VAZIRANI, V. 2001. Approximation Algorithms. Springer-Verlag, New York.