A dip in the reservoir: Maintaining sample synopses of evolving datasets

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 595-606

  Gemulla, Rainer ^a   Lehner, Wolfgang ^a   Haas, Peter J ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; QUERY LANGUAGES; SAMPLING;

BOUNDED SIZE; DATA MINING TASKS; INFORMATION INTEGRATION; INSERTIONS AND DELETIONS; QUERIES OPTIMIZATION; RANDOM PAIRING; RANDOM SAMPLE; SAMPLE SIZES; SPEED UP; STUDY METHODS;

QUERY PROCESSING;

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

References (29)

1. B. Babcock, M. Datar, and R. Motwani. Sampling from a moving window over streaming data. In Proc. SODA, pages 633-634, 2002.
2. P. Brown, P. Haas, J. Myllymaki, H. Pirahesh, B. Reinwald, and Y. Sismanis. Toward automated large-scale information integration and discovery. In Data Management in a Connected World, pages 161-180. Springer, 2005.
3. P. Brown and P. J. Haas. BHUNT: Automatic discovery of fuzzy algebraic constraints in relational data. In Proc. VLDB, pages 668-679, 2003.
4. P. G. Brown and P. J. Haas. Techniques for warehousing of sample data. In Proc. ICDE, 2006.
5. S. Chaudhuri, R. Motwani, and V. R. Narasayya. On random sampling over joins. In Proc. ACM SIGMOD, pages 263-274, 1999.
6. G. Cormode, S. Muthukrishnan, and I. Rozenbaum. Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In Proc. VLDB, pages 25-36, 2005.
7. G. Prahling, P. Indyk, and C. Sohler. Sampling in dynamic data streams and applications. In Proc. 21st Symp. Computat. Geom., pages 142-149, 2005.
8. R. Gemulla and W. Lehner. Deferred maintenance of disk-based random samples. In Proc. ED BT, pages 423-441, 2006.
9. P. Gibbons, Y. Matias, and V. Poosala. AQUA project white paper. Technical report, Bell Laboratories, Murray Hill, New Jersey, 1997.
10. P. B. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In Proc. ACM SIGMOD, pages 331-342, 1998.
11. P. B. Gibbons, Y. Matias, and V. Poosala. Fast incremental maintenance of approximate histograms. ACM Trans. Database Syst., 27:182-184, 2002.
12. P. Haas and C. König. A bi-level Bernoulli scheme for database sampling. In Proc. ACM SIGMOD, pages 275-286, 2004.
13. P. J. Haas. Data stream sampling: Basic techniques and results. In Data Stream Management: Processing High Speed Data Streams. Springer, 2006. (to appear).
14. A. Y. Halevy, O. Etzioni, A. Doan, Z. G. Ives, J. Madhavan, L. McDowell, and I. Tatarinov. Join synopses for approximate query answering. In Proc. CIDR, 2003.
15. IBM Corporation. WebSphere Profile Stage User's Manual. 2005.
16. I. F. Ilyas, V. Markl, P. J. Haas, P. Brown, and A. Aboulnaga. CORDS: automatic discovery of correlations and soft functional dependencies. In Proc. ACM SIGMOD, pages 647-658, 2004.
17. C. Jermaine, A. Pol, and S. Arumugam. Online maintenance of very large random samples. In Proc. ACM SIGMOD, pages 299-310, 2004.
18. G. H. John and P. Langley. Static versus dynamic sampling for data mining. In Proc. KDD, pages 367-370, 2005.
19. N. L. Johnson, S. Kotz, and A. W. Kemp. Discrete Univariate Distributions. Wiley, 2nd edition, 1992.
20. J. Kivinen and H. Mannila. The power of sampling in knowledge discovery. In Proc. ACM PODS, pages 77-85, 1994.
21. D. E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley, 1st edition, 1969.
22. U. Leser and F. Naumann. (Almost) hands-off information integration for the life sciences. In Proc. CIDR, pages 131-143, 2005.
23. A. McLeod and D. Bellhouse. A convenient algorithm for drawing a simple random sample. Applied Statistics, 32:182-184, 1983.
24. F. Olken. Random Sampling from Databases. Thesis LBL-32883, Information and Computing Sciences Division, Lawrence Berkeley National Laboratory, 1993.
25. F. Olken and D. Rotem. Maintenance of Materialized Views of Sampling Queries. In Proc. ICDE, 1992.
26. V. Poosala, P. J. Haas, Y. E. Ioannidis, and E. J. Shekita. Improved histograms for selectivity estimation of range predicates. In Proc. ACM SIGMOD, pages 294-305, 1996.
27. N. Tatbul, U. Çetintemel, S. B. Zdonik, M. Chemiack, and M. Stonebraker. Load shedding in a data stream manager. In Proc. VLDB, pages 309-320, 2003.
28. J. Vitter. Random Sampling with a Reservoir. ACM Trans. Math. Software, 11(1):37-57, 1985.
29. J. S. Vitter. Faster Methods for Random Sampling. Commun. ACM, 27(7):703-718, 1984.