Approximate quantiles and the order of the stream

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 273-279

  Guha, Sudipto ^a   Mcgregor, Andrew ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Adversarial order; Data streams; Quantiles; Random order

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; SENSOR NETWORKS; UNCERTAINTY ANALYSIS;

ADVERSARIAL ORDER; DATA STREAMS; RANDOM ORDER;

DATABASE SYSTEMS;

EID: 34250769879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142390     Document Type: Conference Paper

References (24)

1. D. J. Abadi, D. Carney, U. Çetintemel, M. Cherniack, G. Convey, S. Lee, M. Stonebraker, N. Tatbul, and S. B. Zdonik. Aurora: a new model and architecture for data stream management. VLDB J., 12(2):120-139, 2003.
2. A. Arasu, B. Babcock, S. Babu, M. Datar, K. Ito, R. Motwani, I. Nishizawa, U. Srivastava, D. Thomas, R. Varma, and J. Widom. Stream: The Stanford stream data manager. IEEE Data Engineering Bulletin, 26(1):19-26, 2003.
3. R. Avnur and J. M. Hellerstein. Eddies: Continuously adaptive query processing. Proc. of SIGMOD, pages 261-272, 2000.
4. Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. Proc. of RANDOM, pages 1-10, 2002.
5. S. Chaudhuri, R. Motwani, and V. R. Narasayya, Random sampling for histogram construction: How much is enough? In SIGMOD Conference, pages 436-447, 1998.
6. E. D. Demaine, A. López-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In R. H. Möhring and R. Raman, editors, ESA, volume 2461 of Lecture Notes in Computer Science, pages 348-360. Springer, 2002.
7. A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, and W. Hong. Model-driven data, acquisition in sensor networks. Proc. of VLDB Conference (Best Paper), pages 588-599, 2004.
8. P. Flajolet and G. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
9. P. Gibbons and Y. Matias. Synopsis data structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science: Special Issue on External emory Algorithms and Visualization, A:39-70, 1999.
10. P. B. Gibbons, Y. Matias, and V. Poosala. Fast incremental maintenance of approximate histograms. ACM Trans. Database Syst., 27(3):261-298, 2002.
11. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. How to summarize the universe: Dynamic maintenance of quantiles. In Proc. 28th International Conference on Very Large. Data Bases, pages 454-465, 2002.
12. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. SIGMOD Conference, 2001.
13. S. Guha, A. McGregor, and S. Venkatasubramanian. Streaming and sublinear approximation of entropy and information distances. In SODA, pages 733-742. ACM Press, 2006.
14. A. Gupta and F. Zane. Counting inversions in lists. Proc. of SODA, pages 253-254, 2003.
15. P. Haas and A. Swami. Sequantial Sampling Procedures for Query Size Estimation. Proc. of ACM SIGMOD, San Diego, CA, pages 341-350, June 1992.
16. P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes. Sampling-based estimation of the number of distinct values of an attribute. In VLDB, pages 311-322, 1995.
17. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Report 1998-001, DEC Systems Research Center, 1998.
18. Z. G. Ives, A. Y. Halevy, and D. S. Weld. Adapting to source properties in processing data integration queries. Proc. of SIGMOD, pages 395-406, 2004.
19. S. Kannan. Open problems in streaming. PPT Slides, (request source).
20. G. S. Manku, S. Rajagopalan, and B. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. Proc. of SIGMOD, pages 251-262, 1999.
21. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In SIGMOD, pages 426-435, 1998.
22. R. Morris. Counting large numbers of events in small registers. CACM, 21(10):840-842, 1978.
23. J. Munro and M. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
24. S. Muthukrishnan. Data streams: Algorithms and applications. Survey available on request at muthu@research.att.com, 2003.