An efficient algorithm for approximate biased quantile computation in data streams

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2007, Pages 1023-1026

  Zhang, Qi ^a   Wang, Wei ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Biased quantiles; Streaming algorithms

Indexed keywords

BIASED QUANTILES; COMPUTATIONAL COSTS; COMPUTATIONALLY EFFICIENT; DATA STREAMS; DATA VALUES; EFFICIENT ALGORITHMS; LARGE DATUM; PERFORMANCE IMPROVEMENTS; PRIOR KNOWLEDGE; SPACE REQUIREMENTS; STREAMING ALGORITHMS;

KNOWLEDGE MANAGEMENT;

ALGORITHMS;

EID: 62249220211     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321601     Document Type: Conference Paper

References (14)

1. Rakesh Agrawal and Arun Swami. A one-pass space-efficient algorithm for finding quantiles. International Conference of Management of Data(COMAD), 1995.
2. Arvind Arasu and Gurmeet Singh Manku. Approximate counts and quantiles over sliding windows. ACM Symposium on Principles of Database Systems (PODS), pages 286-296, 2004.
3. Graham Cormode, Flip Korn, S. Muthukrishnan, and Divesh Srivastava. Effective computation of biased quantiles over data streams. International Conference on Data Engineering, pages 20-32, 2005.
4. Graham Cormode, Flip Korn, S. Muthukrishnan, and Divesh Srivastava. Space- and time-efficient deterministic algorithms for biased quantiles over data streams. The ACM Symposium on Principles of Database Systems PODS, pages 263-272, 2006.
5. Michael B. Greenwald and Sanjeev Khanna. Space-efficient online computation of quantile summaries. ACM SIGMOD, pages 58-66, 2001.
6. Michael B. Greenwald and Sanjeev Khanna. Power-conserving computation of order-statistics over sensor networks. Symposium on Principles of database systems, 2004.
7. 2algorithm for dynamic calculation for quantiles and histograms without storing observations. Communications of the ACM, 28(10):1076-1085, 1985.
8. Xuemin Lin, Hongjun Lu, Jian Xu, and Jeffrey Xu Yu. Continuously maintaining quantile summaries of the most recent n elements over a data stream. In ICDE '04 Proceedings of the 20th International Conference on Data Engineering, page 362, Washington, DC, USA, 2004. IEEE Computer Society.
9. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. ACM SIGMOD, 12:426-435, June 1998.
10. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. ACM SIGMOD, pages 251-262, 1999.
11. J. Ian Munro and Mike Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
12. Qi Zhang and Wei Wang. An efficient algorithm for approximate biased quantile computation in data streams. Technical report, Department of Computer Science, University of North Carolina, 2007.
13. Qi Zhang and Wei Wang. A fast algorithm for approximate quantiles in high speed data streams. SSDBM, 2007.
14. Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, and Wei Wang. Space-efficient relative error order sketch over data streams. International Conference on Data Engineering, 2006.