A robust, optimization-based approach for approximate answering of aggregate queries

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 30, Issue 2, 2001, Pages 295-306

  Chaudhuri, Surajit ^a   Das, Gautam ^a   Narasayya, Vivek ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038968641     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375694     Document Type: Article

References (24)

1. Acharya S., Gibbons P.B., Poosala V. Congressional Samples for Approximate Answering of Group-By Queries. Proc. of ACM SIGMOD, 2000.
2. Acharya S., Gibbons P.B., Poosala V., Ramaswamy S.. Join Synopses for Approximate Query Answering. Proc. of ACM SIGMOD, 1999.
3. Barbará D., and Sullivan M. Quasi-Cubes. Exploiting Approximations in Multidimensional Databases. SIGMOD Record, Vol. 26 No. 3, Sep. 1997.
4. Barbará D. and Wu. X. Using Approximations to Scale Exploratory Data Analysis in Datacubes. Proceedings of the 1999 ACM SIGKDD Int'l Conference on Knowledge Discovery and Data Mining, San Diego, CA, Aug. 1999.
5. Chakrabarti K., Garofalakis M., Rastogi R., Shim K. Approximate Query Processing Using Wavelets. Proc. of VLDB 2000.
6. Chaudhuri S., Das G., Datar M., Motwani R., Narasayya V. Overcoming Limitations of Sampling for Aggregation Queries. Proc. of IEEE Conf. on Data Engineering, 2001.
7. Chaudhuri S., Das G., Narasayya V. A Robust, Optimization- Based Approach for Approximate Answering of Aggregation Queries. Microsoft Research Technical Report MSR-TR-2001-37.
8. Chaudhuri S., Motwani R., Narasayya V. Random Sampling Over Joins. Proc. of ACM SIGMOD, 1999.
9. Chaudhuri S., Narasayya V. Program for TPC-D Data Generation with Skew, http://researcn.microsoft.com/dmx/
10. Cochran W.G. Sampling Techniques. John Wiley & Sons, New York, Third edition, 1977.
11. Ganti V., Lee M.L., Ramakrishnan R.. ICICLES: Self-tuning Samples for Approximate Query Answering. Proc. of VLDB, 2000.
12. Golub G., Loan C. Matrix Computations. Johns Hopkins University Press, 1989.
13. Hellerstein J., Haas P., Wang H. Online Aggregation. Proc. of ACM SIGMOD,1997.
14. HochBaum B. Approximation Algorithms for NP-Hard Problems. PWS Publishing, 1997.
15. Ioannidis Y., Poosala V. Histogram Based Approximations of Set-Valued Query Answers. Proc. of VLDB 1999.
16. Marron J.S, Smoothing Methods for Learning from Data. Proc. of KDD 1998, Tutorial.
17. Poosala V., Ganti V. Fast Approximate Answers to Aggregate Queries on a Data Cube. Proc. of the 1999, Intl. Conf. on Scientific and Statistical Database Management.
18. Silverman, B. W. Density Estimation. Chapman and Hall. 1986.
19. Thisted R.A. Elements of Statistical Computing, Chapman and Hall. 1988.
20. TPC Benchmark R. Decision Support. Revision 1.1-0 http://www.tpc.org.
21. Vitter J. Random Sampling with a Reservoir. ACM Transactions on Mathematical Software, 11(1):37-57, March 1985.
22. Vitter J., Wang M. Approximate Computation of Multidimensional Aggregates of Sparse Data using Wavelet. Proc. of ACM SIGMOD, 1999.
23. Vitter J., Wang M., Iyer B.. Data Cube Approximation and Histogram via Wavelets. Conf. on Information and Knowledge Management, 1998.
24. Zipf G.E.. Human Behavior and the Principle of Least Effort. Addison-Wesley Press, Inc, 1949.