
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yufei Tao, Dimitris Papadias, "Maintaining Sliding Window Skylines on Data Streams," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 3, pp. 377391, March, 2006.  
BibTex  x  
@article{ 10.1109/TKDE.2006.48, author = {Yufei Tao and Dimitris Papadias}, title = {Maintaining Sliding Window Skylines on Data Streams}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {18}, number = {3}, issn = {10414347}, year = {2006}, pages = {377391}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.48}, 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  Maintaining Sliding Window Skylines on Data Streams IS  3 SN  10414347 SP377 EP391 EPD  377391 A1  Yufei Tao, A1  Dimitris Papadias, PY  2006 KW  Skyline KW  stream KW  database KW  algorithm. VL  18 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] P.K. Agarwal and J. Erickson, “Geometric Range Searching and Its Relatives,” Contemporary Math., vol. 223, pp. 156, 1999.
[2] R. Ananthakrishna, A. Das, J. Gehrke, F. Korn, S. Muthukrishnan, and D. Srivastava, “Efficient Approximation of Correlated Sums on Data Streams,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 3, pp. 569572, 2003.
[3] W.T. Balke, U. Guntzer, and J.X. Zheng, “Efficient Distributed Skylining for Web Information Systems,” Proc. Int'l Conf. Extending Database Technology, pp. 256273, 2004.
[4] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD, pp. 322331 1990.
[5] M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Springer, 2000.
[6] S. Borzsonyi, D. Kossmann, and K. Stocker, “The Skyline Operator,” Proc. Int'l Conf. Data Eng., pp. 421430, 2001.
[7] D. Carney, U. Cetintemel, A. Rasin, S.B. Zdonik, M. Cherniack, and M. Stonebraker, “Operator Scheduling in a Data Stream Manager,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 838849, 2003.
[8] B. Chazelle, “A Functional Approach to Data Structures and Its Use in Multidimensional Searching,” SIAM J. Computing, vol. 17, no. 3, pp. 427462, 1988.
[9] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, “Skyline with Presorting,” Proc. Int'l Conf. Data Eng., pp. 717719, 2003.
[10] A. Das, J. Gehrke, and M. Riedewald, “Approximate Join Processing over Data Streams,” Proc. SIGMOD, pp. 4051, 2003.
[11] R. Fagin, A. Lotem, and M. Naor, “Optimal Aggregation Algorithms for Middleware,” Proc. ACM Symp. Principles of Database Systems, 2001.
[12] S. Ganguly, M.N. Garofalakis, and R. Rastogi, “Processing Set Expressions over Continuous Update Streams,” Proc. ACM SIGMOD, pp. 265276, 2003.
[13] J. Gehrke, F. Korn, and D. Srivastava, “On Computing Correlated Aggregates over Continual Data Streams,” Proc. ACM SIGMOD, pp. 1324, 2001.
[14] P. Godfrey, “Skyline Cardinality for Relational Processing,” Proc. Third Int'l Symp. Foundations of Information and Knowledge Systems (FoIKS), pp. 7897, 2004.
[15] L. Golab and M.T. Ozsu, “Processing Sliding Window Multijoins in Continuous Queries over Data Streams,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 500511, 2003.
[16] G. Graefe and P.A. Larson, “BTree Indexes and CPU Caches,” Proc. Int'l Conf. Data Eng., pp. 349358, 2001.
[17] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD, pp. 4757, 1984.
[18] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” Proc. ACM Trans. Database Systems, vol. 24, no. 2, pp. 265318, 1999.
[19] K.V.R. Kanth and A.K. Singh, “Optimal Dynamic Range Searching in Nonreplicating Index Structures,” Proc. Int'l Conf. Database Theory, pp. 257276, 1999.
[20] K. Kim, S.K. Cha, and K. Kwon, “Optimizing Multidimensional Index Trees for Main Memory Access,” Proc. ACM SIGMOD, 2001.
[21] D. Kossmann, F. Ramsak, and S. Rost, “Shooting Stars in the Sky: An Online Algorithm for Skyline Queries,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 275286, 2002.
[22] H.T. Kung, F. Luccio, and F.P. Preparata, “On Finding the Maxima of a Set of Vectors,” J. ACM, vol. 22, no. 4, pp. 469476, 1975.
[23] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “An Optimal and Progressive Algorithm for Skyline Queries,” Proc. ACM SIGMOD, pp. 467478, 2003.
[24] U. Srivastava and J. Widom, “MemoryLimited Execution of Windowed Stream Joins,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 324335, 2004.
[25] R. Steuer, Multiple Criteria Optimization. Wiley, 1986.
[26] K.L. Tan, P.K. Eng, and B.C. Ooi, “Efficient Progressive Skyline Computation,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 301310, 2001.
[27] Y. Theodoridis and T.K. Sellis, “A Model for the Prediction of RTree Performance,” Proc. ACM Symp. Principles of Database Systems, pp. 161171, 1996.
[28] S. Viglas and J.F. Naughton, “RateBased Query Optimization for Streaming Information Sources,” Proc. SIGMOD, pp. 3748, 2002.
[29] D. Zhang and V.J. Tsotras, “Improving Min/Max Aggregation over Spatial Objects,” Proc. Ninth ACM Int'l Symp. Advances in Geographic Information Systems, pp. 8893, 2001.