Abstract
Skyline query asks for a set of interesting points that are non-dominated by any other points from a potentially large set of data points and has become research hotspot in database field. Users usually respect fast and incremental output of the skyline objects in reality. Now many algorithms about skyline query have been developed, but they focus on static dataset, not on dynamic dataset. For instance, data stream is a kind of the dynamic datasets. Stream data are usually in large amounts and high speed; moreover, the data arrive unlimitedly and consecutively. Also, the data are variable thus they are difficult to predict. Therefore, it is a grim challenge for us to process skyline query on stream data. Real-time control and strong control management are required to capture the characteristic of data stream, because they must settle data updating rapidly. To this challenge, this paper proposes a new algorithm: DC-Tree. It can do skyline query on the sliding window over the data stream efficiently. The experiment results show that the algorithm is both efficient and effective.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bentley, J.L., Kung, H.T., Schkolnick, M., Thompson, C.D.: On the average number of maxima in a set of vectors and applications. J. ACM 25(4), 536–543 (1978)
Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469–476 (1975)
McLain, D.H.: Drawing contours from arbitrary data points. Computer J. 17, 318–324 (1974)
Steuer, R.: Multiple Criteria Optimization. Wiley, New York (1986)
Kapoor, S.: Dynamic maintenance of maxima of 2-d point sets. SIAM J. Comput (2000)
Borzsonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: Proc. 17th Intern. Conf. On Data Engineering, Heidelberg, Germany (April 2001)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: Proceedings of the IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos (2003)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: Proceedings of the International Conference on Very Large Data Bases (2002)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of ACM SIGMOD, pp. 467–478 (2003)
Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings of VLDB, pp. 301–310 (2001)
Babcock, B., Babu, S., Datar, M., Motawani, R., Widom, J.: Models and issues in data stream systems. In: Popa, L. (ed.) Proc. of the 21st ACM Symp. on Principles of Database Systems, pp. 1–16. ACM Press, Wisconsin (2002)
Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. In: Proc. 21st IEEE Int’l Conf. Data Eng (ICDE 2005), pp. 502–513 (2005)
Tao, Y., Xiao, X., Pei, J.: SUBSKY: Efficient Computation of Skylines in Subspaces. In: Proceedings of the 22nd International Conference on Data Engineering (ICDE 2006), Atlanta, GA, USA, April 3-7 (2006)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: Proceedings of the 31st international conference on very large databases, pp. 241–252. ACM, USA (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, J., Qu, B., Li, CP., Chen, H. (2008). DC-Tree: An Algorithm for Skyline Query on Data Streams. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds) Advanced Data Mining and Applications. ADMA 2008. Lecture Notes in Computer Science(), vol 5139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88192-6_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-88192-6_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88191-9
Online ISBN: 978-3-540-88192-6
eBook Packages: Computer ScienceComputer Science (R0)