A fast algorithm for approximate quantiles in high speed data streams

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2007, Pages

  Zhang, Qi ^a   Wang, Wei ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ALGORITHMS; BOOLEAN FUNCTIONS; DATA MINING; DATABASE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; STATISTICAL METHODS; STATISTICS;

COMPUTATIONAL COSTS; DATABASE MANAGEMENT; DATASTREAM (CO); ERROR BOUNDS; FAST ALGORITHMS; HIGH-SPEED DATA; HIGH-SPEED PERFORMANCE; IN ORDER; INTERNATIONAL CONFERENCES; MULTI LEVEL (ML); NOVEL ALGORITHMS; SUB-STREAMS;

RIVERS;

EID: 46649088763     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDBM.2007.27     Document Type: Conference Paper

References (15)

1. R. Agrawal and A. Swami. A one-pass space-efficient algorithm for finding quantiles. International Conference of Management of Data(COMAD), 1995.
2. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. ACM Symposium on Principles of Database Systems (PODS), pages 286-296, 2004.
3. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Effective computation of biased quantiles over data streams. International Conference on Data Engineering, pages 20-32, 2005.
4. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Space- and time-efficient deterministic algorithms for biased quantiles over data streams. The A CM Symposium on Principles of Database Systems PODS, pages 263-272, 2006.
5. M. B. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. ACM SIGMOD, pages 58-66, 2001.
6. M. B. Greenwald and S. 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. X. Lin, H. Lu, J. Xu, and J. X. 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. X. Lin, J. Xu, Q. Zhang, H. Lu, J. X. Yu, X. Zhou, and Y. Yuan. Approximate processing of massive continuous quantile queries over high-speed data streams. IEEE Transactions on Knowledge and Data Engineering, 18(5):683-698, 2006.
10. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. ACM SIGMOD, 12:426-435, June 1998.
11. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. ACM SIGMOD, pages 251-262, 1999.
12. J. I. Munro and M. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
13. M. Paterson. Progress in selection. Scandinavian Workshop on Algorithm Theory, 1997.
14. N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri. Medians and beyond: new aggregation techniques for sensor networks. In SenSys '04: Proceedings of the 2nd international conference on Embedded networked sensor systems, pages 239-249, New York, NY, USA, 2004. ACM Press.
15. Y. Zhang, X. Lin, J. Xu, F. Korn, and W. Wang. Space-efficient relative error order sketch over data streams. International Conference on Data Engineering, 2006.