Effective computation of biased quantiles over data streams

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2005, Pages 20-31

  Cormode, Graham ^a   Muthukrishnan, S ^b   Korn, Flip ^c   Srivastava, Divesh ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SOURCES; DATA STREAM MANAGEMENT SYSTEMS; QUANTILES PROBLEM; SKEW;

DATA STRUCTURES; DATABASE SYSTEMS; ERROR ANALYSIS; INTERNET; PROBLEM SOLVING; SECURITY OF DATA;

COMPUTATION THEORY;

EID: 28444498812     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.55     Document Type: Conference Paper

References (17)

1. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In PODS, 2004.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In PODS, 2002.
3. C. Cranor, T. Johnson, O. Spatscheck, and V. Shkapenyuk. Gigascope: A stream database for network applications. In SIGMOD, 2003.
4. G. Cormode, F. Korn, S. Muthukrishnan, T. Johnson, O. Spatscheck, and D. Srivastava. Holistic udafs at streaming speeds. In SIGMOD, 2004.
5. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 2004. in press.
6. M. Garofalakis, J. Gehrke, and R. Rastogi. Querying and mining data streams: You only get one look. In SIGMOD, 2002.
7. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In SIGMOD, 2001.
8. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. How to summarize the universe: Dynamic maintenance of quantiles. In VLDB, 2002.
9. A. Gupta and F. Zane. Counting inversions in lists. In SODA, 2003.
10. Y. E. Ioannidis and S. Christodoulakis. Optimal histograms for limiting worst-case error propagation in the size of the join radius. ACM Transactions on Database Systems, 18(4):709-748, 1993.
11. Yannis E. Ioannidis. The history of histograms (abridged). In VLDB, 2003.
12. X. Lin, H. Lu, J. Xu, and J. Xu Yu. Continuously maintaining quantile summaries of the most recent n elements over a data stream. In ICDE, 2004.
13. J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
14. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In SIGMOD, 1998.
15. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Random sampling techniques for space efficient on-line computation of order statistics of large datasets. In SIGMOD, 1999.
16. S. Muthukrishnan. Data streams: Algorithms and applications. In SODA, http://athos.rutgers.edu/~muthu/stream-1-1.ps, 2003.
17. Agilent Technologies. Router tester. http://advanced.comms.agilent.com/ n2x/index.htm.