Abstract
Skyline queries, which return the objects that are better than or equal in all dimensions and better in at least one dimension, are useful in many decision making and real-time monitor applications. With the number of dimensions increasing and continuous large volume data arriving, mining the thin skylines over data stream under control of losing quality is a more meaningful problem. In this paper, firstly, we propose a novel concept, called thin skyline, which uses a skyline object that represents its nearby skyline neighbors within ε-distance (acceptable difference). Then, two algorithms are developed which prunes the skyline objects within the acceptable difference and adopts correlation coefficient to adjust adaptively thin skyline query quality. Furthermore, our experimental performance study shows that the proposed methods are both efficient and effective.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE (2001)
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 (1978)
Cranor, C.D., Johnson, T., Spatscheck, O., Shkapenyuk, V.: Gigascope: A stream database for network applications. In: SIGMOD (2003)
Paxson, V.: Bro: a system for detecting network intruders in real-time. Computer Networks 31, 23–24 (1999)
Lerner, A., Shasha, D.: The virtues and challenges of ad hoc + streams querying in finance. IEEE Data Eng. Bull. 26(1), 49–56 (2003)
Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: VLDB (2001)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) VLDB 2002. LNCS, vol. 2590, Springer, Heidelberg (2003)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD (2003)
Luo, Y., Lu, H.X., Lin, X.: A scalable and i/o optimal skyline processing algorithm. In: Li, Q., Wang, G., Feng, L. (eds.) WAIM 2004. LNCS, vol. 3129, Springer, Heidelberg (2004)
Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the sky: Efficient skyline computation over sliding windows. In: ICDE (2005)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. 30(1) (2005)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: ICDE (2003)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: VLDB (2005)
Tao, Y., Xiao, X., Pei, J.: Subsky: Efficient computation of skylines in subspaces. In: ICDE (2006)
Xia, T., Zhang, D.: Refreshing the sky: the compressed skycube with efficient support for frequent updates. In: SIGMOD (2006)
Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: SIGMOD (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liang, G., Su, L. (2007). Continuous Adaptive Mining the Thin Skylines over Evolving Data Stream. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2007. Lecture Notes in Computer Science, vol 4882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77115-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-77115-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77112-8
Online ISBN: 978-3-540-77115-9
eBook Packages: Computer ScienceComputer Science (R0)