New sampling-based summary statistics for improving approximate query answers

SIGMOD Record

Volumn 27, Issue 2, 1998, Pages 331-342

  Gibbons, Phillip B ^a   Matias, Yossi ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA RECORDING; STATISTICAL METHODS;

DATA DISTRIBUTION; DATA WAREHOUSE; SAMPLING-BASED SUMMARY STATISTICS;

QUERY LANGUAGES;

EID: 0032092365     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/276305.276334     Document Type: Article

References (34)

1. N. Alon, Y. Matias, and M. Szegedi. The space complexity of approximating the frequency moments. In Proc. 28th ACM Symp. on the Theory of Computing, pages 20-29, May 1996.
2. G. Antoshenkov. Random sampling from pseudo-ranked B+ trees. In Proc. 18th International Conf. on Very Large Data Bases, pages 375-382, August 1992.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. 20th International Conf. on Very Large Data Bases, pages 487-499, September 1994.
4. G. Antoshenkov and M. Ziauddin. Query processing and optimization in Oracle Rdb. VLDB Journal, 5(4):229-237, 1996.
5. D. Barbará, W. DuMouchel, C. Faloutsos, P. J. Haas, J. M. Hellerstein, Y. Ioannidis, H. V. Jagadish, T. Johnson, R. Ng, V. Poosala, K. A. Ross, and K. C. Sevcik. The New Jersey data reduction report. Bulletin of the Technical Committee on Data Engineering, 20(4):3-45, 1997.
6. R. J. Bayardo, Jr. and D. P. Miranker. Processing queries for first-few answers. In Proc. 5th International Conf. on Information and Knowledge Management, pages 45-52, 1996.
7. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 255-264, May 1997.
8. C. Faloutsos, H. V. Jagadish, and N. D. Sidiropoulos. Recovering information from summary data. In Proc. 23rd International Conf. on Very Large Data Bases, pages 36-45, August 1997.
9. P. Flajolet. Approximate counting: a detailed analysis. BIT, 25:113-134, 1985.
10. P. Flajolet and G. N. Martin. Probabilistic counting. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 76-82, October 1983.
11. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Computer and System Sciences, 31:182-209, 1985.
12. P. B. Gibbons and Y. Matias, August 1995. Presentation and feedback during a Bell Labs-Teradata presentation to Walmart scientists and executives on proposed improvements to the Teradata DBS.
13. P. B. Gibbons and Y. Matias. Synopsis data structures, concise samples, and mode statistics. Manuscript, July 1997.
14. P. B. Gibbons, Y. Matias, and V. Poosala. Aqua project white paper. Technical report, Bell Laboratories, Murray Hill, New Jersey, December 1997.
15. P. B. Gibbons, Y. Matias, and V. Poosala. Fast incremental maintenance of approximate histograms. In Proc. 23rd International Conf. on Very Large Data Bases, pages 466-475, August 1997.
16. P. B. Gibbons, V. Poosala, S. Acharya, Y. Bartal, Y. Matias, S. Muthukrishnan, S. Ramaswamy, and T. Suel. AQUA: System and techniques for approximate query answering. Technical report, Bell Laboratories, Murray Hill, New Jersey, February 1998.
17. J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 171-182, May 1997.
18. M. Hofri and N. Kechris. Probabilistic counting of a large number of events. Manuscript, 1995.
19. P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes. Sampling-based estimation of the number of distinct values of an attribute. In Proc. 21st International Conf. on Very Large Data Bases, pages 311-322, September 1995.
20. Y. E. Ioannidis and S. Christodoulakis. Optimal histograms for limiting worst-case error propagation in the size of join results. ACM Transactions on Database Systems, 18(4):709-748, 1993.
21. Y. E. Ioannidis. Universality of serial histograms. In Proc. 19th International Conf. on Very Large Data Bases, pages 256-267, August 1993.
22. Y. E. Ioannidis and V. Poosala. Balancing histogram optimality and practicality for query result size estimation. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 233-244, May 1995.
23. Y. Matias. Highly Parallel Randomized Algorithmics. PhD thesis, Tel Aviv University, Israel, 1992.
24. R. Morris. Counting large numbers of events in small registers. Communications of the ACM, 21:840-842, 1978.
25. Y. Matias, S. C. Sahinalp, and N. E. Young. Performance evaluation of approximate priority queues. Presented at DIMACS Fifth Implementation Challenge: Priority Queues, Dictionaries, and Point Sets, organized by D. S. Johnson and C. McGeoch, October 1996.
26. Y. Matias, J. S. Vitter, and W.-C. Ni. Dynamic generation of discrete random variates. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pages 361-370, January 1993.
27. Y. Matias, J. S. Vitter, and N. E. Young. Approximate data structures with applications. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 187-194, January 1994.
28. + trees. In Proc. 15th International Conf. on Very Large Data Bases, pages 269-277, 1989.
29. F. Olken and D. Rotem. Maintenance of materialized views of sampling queries. In Proc. 8th IEEE International Conf. on Data Engineering, pages 632-641, February 1992.
30. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita. Improved histograms for selectivity estimation of range predicates. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 294-305, June 1996.
31. D. Pregibon. Mega-monitoring: Developing and using telecommunications signatures, October 1997. Invited talk at the DIMACS Workshop on Massive Data Sets in Telecommunications.
32. J. S. Vitter. Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1):37-57, 1985.
33. S. V. Vrbsky and J. W. S. Liu. Approximate - a query processor that produces monotonically improving approximate answers. IEEE Trans. on Knowledge and Data Engineering, 5(6):1056-1068, 1993.
34. K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems, 15(2):208-229, 1990.