Domain-driven data synopses for dynamic quantiles

IEEE Transactions on Knowledge and Data Engineering

Volumn 17, Issue 7, 2005, Pages 927-937

  Gilbert, Anna C ^a   Kotidis, Yannis ^b   Muthukrishnan, S ^c   Strauss, Martin J ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Data streams; Database statistics; Quantiles

Indexed keywords

DATA STREAMS; DATABASE STATISTICS; QUANTITIES; RANDOM SUBSET SUMS (RSS);

ALGORITHMIC LANGUAGES; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATABASE SYSTEMS; ESTIMATION; MATRIX ALGEBRA; STATISTICAL METHODS;

DATA PROCESSING;

EID: 22944450669     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2005.108     Document Type: Article

References (34)

1. R. Agrawal, T. Imielinski, and A. Swami, "Mining Associations between Sets of Items in Massive Databases," Proc. ACM SIGMOD, pp. 207-216, May 1993.
2. R. Agrawal and R. Srikant, "Mining Quantitative Association Rules in Large Relational Tables," Proc. ACM SIGMOD, pp. 1-12, June 1996.
3. R. Agrawal and A. Swami, "A One-Pass Space-Efficient Algorithm for Finding Quantiles," Proc. Conf. Management of Data, 1995.
4. N. Alon, Y. Matias, and M. Szegedy, "The Space Complexity of Approximating the Frequency Moments," Proc. ACM Symp. Theory of Computing, pp. 20-29, 1996.
5. N. Alon and J.H. Spencer, The Probabilistic Method. New York: Wiley and Sons, 1992.
6. K. Alsabti, S. Ranka, and V. Singh, "A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data," Proc. Very Large Data Bases Conf., pp. 346-355, 1997.
7. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, "Time Bounds for Selection," J. Computer and System Sciences, vol. 7, no. 4, pp. 448-461, 1973.
8. M. Charikar, K. Chen, and M. Farach-Colton, "Finding Frequent Items in Data Streams," Proc. 29th Int'l Colloquium Automata, Languages, and Programming, 2002.
9. F. Chen, D. Lambert, and J.C. Pinheiro, "Incremental Quantile Estimation for Massive Tracking," Proc. Int'l Conf. Knowledge Discovery and Data Mining, pp. 516-522, Aug. 2000.
10. Cisco NetFlow, http://www.cisco.com/warp/public/732/netflow/, 1998.
11. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan, "Comparing Data Streams Using Hamming Norms (How to Zero In)," Proc. Very Large Data Bases Conf., pp. 335-345, 2002.
12. G. Cormode and S. Muthukrishnan, "An Improved Data Stream Summary: The Count-Min Sketch and Its Applications," LATIN, pp. 29-38, 2004.
13. M. Datar, A. Gionis, P. Indyk, and R. Motwani, "Maintaining Stream Statistics over Sliding Windows," Proc, 13th ACM-SIAM Symp. Discrete Algorithms, 2002.
14. D.J. DeWitt, J.F. Naughton, and D.A. Schneider, "Parallel Sorting on a Shared-Nothing Architecture Using Probabilistic Splitting," Proc. Conf. Parallel and Distributed Information Systems, pp. 280-291, 1991.
15. A. Dobra, M. Garofalakis, J. Gehrke, and R. Rastogi, "Processing Complex Aggregate Queries over Data Streams," Proc. ACM SIMGOD, pp. 61-72, June 2002.
16. P. Gibbons, "Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports," Proc. Very Large Data Bases Conf., pp. 541-550, 2001.
17. P. Gibbons, Y. Matias, and V. Poosala, "Fast Incremental Maintenance of Approximate Histograms," Proc. Very Large Data Bases Conf., pp. 466-475, 1997.
18. A.C. Gilbert and Y. Kotidis, S. Muthukrishnan, and M.J. Strauss, "Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries," Proc. Very Large Data Bases Conf., pp. 79-88, 2001.
19. A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M.J. Strauss, "How to Sumamtize the Universe: Dynamic Maintenance of Quantiles," Proc. Very Large Data Bases Conf., pp. 454-465, 2002.
20. A.C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M.J. Strauss, "Fast, Small-Space Algorithms for Approximate Histogram Maintenance," Proc. 34th ACM Symp. Theory of Computing, pp. 389-398, 2002.
21. M. Greenwald and S. Khanna, "Space-Efficient Online Computation of Quantile Summaries," Proc. ACM SIGMOD, pp. 58-66, May 2001.
22. P. Indyk, "Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation," Proc. 41st Symp. Foundations of Computer Science, pp. 189-197, 2000.
23. P. Indyk, N. Koudas, and S. Muthukrishnan, "Identifying Representative Trends in Massive Time Series Data Sets Using Sketches," Proc. Very Large Data Bases, pp. 363-372, 2000.
24. 2 Algorithm for Dynamic Calculation of Quantiles and Histograms without Storing Observations," Comm. ACM, vol. 28, no. 10, 1985.
25. T. Johnson, S. Muthukrishnan, P. Dasu, and V. Shkapenyuk, "Mining Database Structure; or, How to Build a Data Quality Browser," Proc. ACM SIGMOD, 2002.
26. G.S. Manku, S. Rajagopalan, and B.G. Lindsay, "Approximate Medians and Other Quantiles in One Pass and with Limited Memory," Proc. ACM SIGMOD, 1998.
27. G.S. Manku, S. Rajagopalan, and B.G. Lindsay, "Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Data Sets," Proc. ACM SIGMOD, pp. 251-262, 1999.
28. J.I. Munro and M.S. Paterson, "Selection and Sorting with Limited Storage," Theoretical Computer Science, vol. 12, pp. 315-323, 1980.
29. M.S. Paterson, "Progress in Selection," technical report, Univ. of Warwick, Coventry, U.K., 1997.
30. V. Poosala, "Histogram-Based Estimation Techniques in Database Systems," PhD dissertation, Univ. of Wisconsin-Madison, 1997.
31. V. Poosala and Y.E. Ioannidis, "Estimation of Query-Result Distribution and Its Application in Parallel-Join Load Balancing," Proc. Very Large Data Bases Conf., pp. 448-459, 1996.
32. V. Poosala, Y.E. Ioannidis, P.J. Haas, and E.J. Shekita, "Improved Histograms for Selectivity Estimation of Range Predicates," Proc. ACM SIGMOD, pp. 294-305, 1996.
33. Y. Matias, J. Vitter, and M. Wang, "Dynamic Maintenance of Wavelet-Based Histograms," Proc. Very Large Data Bases Conf., pp. 101-110, Sept. 2000.
34. J.S. Vitter, "Random Sampling with a Reservoir," ACM Trans. Math. Software, vol. 11, no. 1, pp. 37-57, 1985.