Distinct sampling for highly-accurate answers to distinct values queries and event reports

VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases

Volumn , Issue , 2001, Pages 541-550

  Gibbons, Phillip B ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; TELECOMMUNICATION NETWORKS; VIRTUAL REALITY;

CUSTOMER SERVICES; HIGHLY ACCURATE; MEMORY OVERHEADS; ORDERS OF MAGNITUDE; QUERY PREDICATES; RECORDING ENVIRONMENT; RELATIVE ERRORS; REPORT GENERATION;

NEXT GENERATION NETWORKS;

EID: 84944323337     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. S. Acharya, P. B. Gibbons, and V. Poosala. Congressional samples for approximate answering of group-by queries. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 487-498, May 2000.
2. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. The Aqua approximate query answering system. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 574-576, June 1999. Demo paper.
3. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. Join synopses for approximate query answering. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 275-286, June 1999.
4. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. 28th ACM Symp. on the Theory of Computing, pages 20-29, May 1996.
5. J. Bunge and M. Fitzpatrick. Estimating the number of species: A review. J. of the American Statistical Association, 88:364-373, 1993.
6. K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. In Proc. 26th International Conf. on Very Large Data Bases, pages 111-122, September 2000.
7. M. Charikar, S. Chaudhuri, R. Motwani, and V. Narasayya. Towards estimation error guarantees for distinct values. In Proc. 19th ACM Symp. on Principles of Database Systems, pages 268-279, May 2000.
8. S. Chaudhuri, G. Das, and V. Narasayya. A robust, optimization-based approach for approximate answering of aggregate queries. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 295-306, May 2001.
9. S. Chaudhuri, R. Motwani, and V. Narasayya. Random sampling for histogram construction: How much is enough? In Proc. ACM SIGMOD International Conf. on Management of Data, pages 436-447, June 1998.
10. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J. of Computer and System Sciences, 55(3):441-453, 1997.
11. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Computer and System Sciences, 31:182-209, 1985.
12. V. Ganti, M.-L. Lee, and R. Ramakrishnan. ICICLES: self-tuning samples for approximate query answering. In Proc. 26th International Conf. on Very Large Data Bases, pages 176-187, September 2000.
13. P. B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. Technical report, Bell Laboratories, Murray Hill, New Jersey, June 2001.
14. P. B. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 331-342, June 1998.
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 and S. Tirthapura. Estimating simple functions on the union of data streams. In Proc. 13th ACM Symp. on Parallel Algorithms and Architectures, July 2001.
17. P. Haas and J. Hellerstein. Ripple joins for online aggregation. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 287-298, June 1999.
18. 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.
19. P. J. Haas and L. Stokes. Estimating the number of classes in a finite population. J. of the American Statistical Association, 93:1475-1487, 1998.
20. 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.
21. W.-C. Hou, G. Özsoyoʇlu, and E. Dogdu. Error-constrained COUNT query evaluation in relational databases. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 278-287, May 1991.
22. W.-C. Hou, G. Özsoyoʇlu, and B. K. Taneja. Statistical estimators for relational algebra expressions. In Proc. 7th ACM Symp. on Principles of Database Systems, pages 276-287, March 1988.
23. W.-C. Hou, G. Özsoyoʇlu, and B. K. Taneja. Processing aggregate relational queries with hard time constraints. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 68-77, June 1989.
24. Information and Computer Science, University of California at Irvine. ftp://ftp.ics.uci.edu/pub/machine-learningdatabases, 2000.
25. Y. Ioannidis and V. Poosala. Histogram-based techniques for approximating set-valued query-answers. In Proc. 25th International Conf. on Very Large Databases, pages 174-185, September 1999.
26. I. Lazaridis and S. Mehrotra. Progressive approximate aggregate querie with a multi-resolution tree structure. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 401-412, May 2001.
27. J. F. Naughton and S. Seshadri. On estimating the size of projections. In Proc. 3rd International Conf. on Database Theory, pages 499-513, 1990.
28. F. Olken. Random Sampling from Databases. PhD thesis, Computer Science, U.C. Berkeley, April 1993.
29. G. Ozsoyoglu, K. Du, A. Tjahjana, W. Hou, and D. Y. Rowland. On estimating COUNT, SUM, and AVERAGE relational algebra queries. In Proc. Conf. on Database and Expert Systems Applications, pages 406-412, 1991.
30. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. Fast approximation of the "neighbourhood" function for massive graphs. Technical Report CMU CS-01-122, Carnegie-Mellon University, Pittsburgh, PA, 2001.
31. C. R. Palmer, G. Siganos, M. Faloutsos, C. Faloutsos, and P. B. Gibbons. The connectivity and fault-tolerance of the internet topology. In Proc. 2001 Workshop on Network-Related Data Management (NRDM), May 2001.
32. V. Poosala. Histogram-based Estimation Techniques in Databases. PhD thesis, Univ. of Wisconsin-Madison, 1997.
33. V. Poosala and V. Ganti. Fast approximate answers to aggregate queries on a data cube. In Proc. 11th International Conf. on Scientific and Statistical Database Management, July 1999.
34. 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.
35. J. S. Vitter. Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1):37-57, 1985.
36. J. S. Vitter and M.Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 193-204, June 1999.
37. J. S. Vitter, M. Wang, and B. Iyer. Data cube approximation and histograms via wavelets. In Proc. 7th International Conf. on Information and Knowledge Management, pages 96-104, November 1998.
38. 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.