
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xuemin Lin, Jian Xu, Qing Zhang, Hongjun Lu, Jeffrey Xu Yu, Xiaofang Zhou, Yidong Yuan, "Approximate Processing of Massive Continuous Quantile Queries over HighSpeed Data Streams," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 5, pp. 683698, May, 2006.  
BibTex  x  
@article{ 10.1109/TKDE.2006.73, author = {Xuemin Lin and Jian Xu and Qing Zhang and Hongjun Lu and Jeffrey Xu Yu and Xiaofang Zhou and Yidong Yuan}, title = {Approximate Processing of Massive Continuous Quantile Queries over HighSpeed Data Streams}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {18}, number = {5}, issn = {10414347}, year = {2006}, pages = {683698}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.73}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Approximate Processing of Massive Continuous Quantile Queries over HighSpeed Data Streams IS  5 SN  10414347 SP683 EP698 EPD  683698 A1  Xuemin Lin, A1  Jian Xu, A1  Qing Zhang, A1  Hongjun Lu, A1  Jeffrey Xu Yu, A1  Xiaofang Zhou, A1  Yidong Yuan, PY  2006 KW  Query processing KW  online computation KW  data mining. VL  18 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] A. Arasu and G.S. Manku, “Approximate Counts and Quantiles over Sliding Windows,” Proc. ACM Symp. Principles of Database Systems, pp. 286296, 2004.
[2] B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, “Models and Issues in Data Stream Systems,” Proc. ACM Symp. Principles of Database Systems, pp. 116, 2002.
[3] J. Chen, D.J. DeWitt, F. Tian, and Y. Wang, “NiagaraCQ: A Scalable Continuous Query System for internet Databases,” Proc. SIGMOD Conf., pp. 379390, 2000.
[4] Y. Chen, G. Dong, J. Han, B.W. Wah, and J. Wang, “MultiDimensional Regression Analysis of TimeSeries Data Streams,” Proc. Conf. Very Large Databases, pp. 323334, 2002.
[5] T. Cormen, C.S.C. Leiserson, and R. Rivest, Introduction to Algorithms. The MIT Press, 2001.
[6] G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava, “Effective Computation of Biased Quantiles over Data Streams,” Proc. Int'l Conf. Data Eng., pp. 2031, 2005.
[7] G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava, “Finding Hierarchical Heavy Hitters in Data Streams,” Proc. Conf. Very Large Databases, pp. 464475, 2003.
[8] G. Cormode and S. Muthukrishnan, “An Improved Data Stream Summary: The CountMin Sketch and Its Applications,” J. Algorithms, vol. 55, no. 1, 2004.
[9] T. Dasu, T. Johnson, S. Muthukrishnan, and V. Shkapenyuk, “Mining Database Structure; or, How to Build a Data Quality Browser,” Proc. SIGMOD Conf., pp. 240251, 2002.
[10] A. Dobra, M.N. Garofalakis, J. Gehrke, and R. Rastogi, “Processing Complex Aggregate Queries over Data Streams,” Proc. SIGMOD Conf., pp. 6172, 2002.
[11] M. Garofalakis and A. Kumar, “Correlating XML Data Streams Using TreeEdit Distance Embeddings,” Proc. ACM Symp. Principles of Database Systems, pp. 143154, 2003.
[12] A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss, “How to Summarize the Universe: Dynamic Maintenance of Quantiles,” Proc. Conf. Very Large Databases, pp. 454465, 2002.
[13] M. Greenwald and S. Khanna, “SpaceEfficient Online Computation of Quantile Summaries,” Proc. SIGMOD Conf., 2001.
[14] S. Guha, N. Koudas, and K. Shim, “DataStreams and Histograms,” Proc. Ann. ACM Symp. Theory of Computing, pp. 471475, 2001.
[15] A. Gupta and D. Suciu, “Stream Processing of Xpath Queries with Predicates,” Proc. SIGMOD Conf., pp. 419430, 2003.
[16] M. Hammad, M. Franklin, W. Aref, and A. Elmagarmid, “Scheduling for Shared Window Joins over Data Streams,” Proc. Conf. Very Large Databases, pp. 297308, 2003.
[17] S. Krishnamurthy, S. Chandrasekaran, O. Cooper, A. Deshpande, M.J. Franklin, J.M. Hellerstein, W. Hong, S.R. Madden, F. Reiss, and M.A. Shah, “Telegraphcq: An Architectural Status Report,” IEEE Data Eng. Bull., 2003.
[18] H. Kung, F. Luccio, and F. Preparata, “On Finding the Maximum of a Set of Vectors,” J. ACM, vol. 22, no. 4, pp. 469476, 1975.
[19] X. Lin, H. Lu, J. Xu, and J.X. Yu, “Continuously Maintaining Quantile Summaries of the Most Recent n Elements over a Data Stream,” Proc. Int'l Conf. Data Eng., pp. 362374, 2004.
[20] T. Linsmeier and N. Pearson, “Risk Measurement: An Introduction to Value at Risk,” Working Paper 9604, Office for Futures and Options Research (OFOR), 1996.
[21] L. Liu, C. Pu, and W. Tang, “Continual Queries for Internet Scale EventDriven information Delivery,” IEEE Trans, Knowledge and Data Eng., vol. 11, no. 4, pp. 610628, 1999.
[22] S. Madden and M.J. Franklin, “Fjording the Stream: An Architecture for Queries over Streaming Sensor Data,” Proc. Int'l Conf. Data Eng., pp. 555566, 2002.
[23] S. Manganelli and R. Engle, “Value at Risk Models in Finance,” European Central Bank Working Paper Series No. 75, 2001.
[24] G. Manku and R. Motwani, “Approximate Frequency Counts over Data Streams,” Proc. Conf. Very Large Databases, pp. 346357, 2002.
[25] G.S. Manku, S. Rajagopalan, and B.G. Lindsay, “Approximate Medians and Other Quantiles in One Pass and with Limited Memory,” Proc. SIGMOD Conf., pp. 426435, 1998.
[26] 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. 1999 ACM SIGMOD Int'l Conf. Management of Data, pp. 251262, 1999.
[27] J.I. Munro and M.S. Paterson, “Selection and Sorting with Limited Storage,” Theoretical Computer Science, 1980.
[28] F. Nielsen, “Fast Stabbing of Boxes in High Dimensions,” Theoretical Computer Science, 2000.
[29] C. Olston, J. Jiang, and J. Widom, “Adaptive Filters for Continuous Queries over Distributed Data Streams,” Proc. SIGMOD Conf., pp. 563574, 2003.
[30] V. Poosala, P. Haas, Y. Ioannidis, and E. Shekita, “Improved Histograms for Selectivity Estimation of Range Predicates,” Proc. SIGMOD Conf., pp. 294305, 1996.
[31] V. Poosala and Y. Ioannidis, “Estimation of QueryResult Distribution and Its Application in ParallelJoin Load Balancing,” Proc. Conf. Very Large Databases, pp. 448459, 1996.
[32] F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. SpringerVerlag, 1985.
[33] Version2.0 Financial Analysis Package MT for Gauss™— Version 2.0, Aptech System, Inc., 2003.
[34] S. Viglas, J.F. Naughton, and J. Burger, “Maximizing the Output Rate of MultiWay Join Queries over Streaming Information Sources,” Proc. Conf. Very Large Databases, pp. 285296, 2003.
[35] Y. Zhu and D. Shasha, “Statstream: Statistical Monitoring of Thousands of Data Streams in Real Time,” Proc. Conf. Very Large Databases, pp. 358369, 2002.
[36] G.K. Zipf, Human Behaviour and he Principle of Least Effort. AddisonWesley, 1949.