Abstract
Skyline query has its own advantages and are useful in many multi-criteria decision support applications. But for the rigidity of skyline dominance relationship, the cardinality of skyline result cannot be controlled, either too big or too small to satisfy users’ requirements. By relaxing the dominance relationship to k-skyline or general skyline, we propose a unified approach to find a given number of skyline. We call our output of skyline as δ-skyline, in which δ indicates the number of skyline result. Without any user interference such as assigned weights or scoring functions, we are the first to propose a method to tune the cardinality of skyline operator in both directions, to either increase or decrease according to the requirement of user. To tune the cardinality of skyline, we adopt the concept of k-dominate and also we propose a new concept of general skyline. A point p is in general skyline if p is skyline in some subspace. General skyline have their meaning for they are the best at some aspects and are good alternatives to fullspace skyline. Finally, we present two algorithms to compute δ-skyline. Extensive experiments are conducted to examine the effectiveness and efficiency of the proposed algorithms on both synthetic and real data sets.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Borzonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. of ICDE, pp. 421–430 (2001)
Tian, X., Zhang, D., Tao, Y.: On Skyling with Flexible Dominance Relation. In: Proc. of ICDE (2008)
Xia, T., Zhang, D.: Refreshing the Sky: The Compressed Skycube with Efficient Support for Frequent Updates. In: Proc. of SIGMOD (2006)
Lin, X., Yuan, Y., et al.: Selecting Stars: The k Most Representative Skyline Operator. In: Proc. of ICDE (2007)
Yiu, M., Mamoulis, N.: Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data. In: Proc. of VLDB (2007)
Tao, Y., Xiao, X., Pei, J.: Efficient Skyline and Top-k Retrieval in Subspaces. In: Proc. of TKDE, pp. 1072–1088 (2007)
Chan, Y., Jadadish, H., et al.: Finding k-Dominant Skylines in High Dimensional Space. In: Proc. of SIGMOD, pp. 503–514 (2006)
Pei, J., Fu, A.W., et al.: Computing Compressed Multidimensional Skyline Cubes Efficiently. In: Proc. of ICDE (2007)
Yuan, Y., Lin, X., et al.: Efficient Computation of the Skyline Cube. In: Proc. of VLDB (2005)
Papadias, D., Tao, Y., et al.: Progressive Skyline Computation in Database Systems. In: ACM Transactions on Database Systems, pp. 41–82 (2005)
Pei, J., Jin, W., et al.: Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces. In: Proc. of VLDB (2005)
Chan, C.Y., Jagadish, H., et al.: On High dimensional Skylines. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896. Springer, Heidelberg (2006)
Balke, W.-T., Guntzer, U., Zheng, J.X.: Efficient distributed skylining for web information systems. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 256–273. Springer, Heidelberg (2004)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: Proc. of ICDE, pp. 717–719 (2003)
Kossmann, D., Ramsak, F., Rost, S.: Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. In: Proc. of VLDB, pp. 275–286 (2002)
Lo, E., Ip, K., Lin, K.-I., Cheung, D.: Progressive Skylining over Web-Accessible Database. DKE 57(2), 122–147 (2006)
Jin, W., Han, J., Ester, M.: Mining Thick Skyline Over Large Databases. In: Proc. of PKDD (2004)
Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. In: Proc. of ICDE, pp. 502–513 (2005)
Papadias, D., Tao, Y., Fu, G., et.,, al,: An Optimal and Progressive Algorithm for Skyline Querie. In: Proc. of SIGMOD, pp. 467–478 (2003)
Xin, J., Wang, G., et al.: Energy Efficient computing of k-dominant skline on Sensor Network. In: Proc. of NDBC (2008)
Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. In: Proc. Of VLDB, pp. 301–310 (2001)
Tao, Y., Papadias, D.: Maintaining Sliding Window Skylines on Data Streams. TKDE 18(3), 377–391 (2006)
Wu, M., Xu, J., Tang, X., Lee, W.-C.: Monitoring Top-k query in wireless sensor network. In: Proc. of ICDE, p. 143 (2006)
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
Huang, J., Ding, D., Wang, G., Xin, J. (2008). Tuning the Cardinality of Skyline. In: Ishikawa, Y., et al. Advanced Web and Network Technologies, and Applications. APWeb 2008. Lecture Notes in Computer Science, vol 4977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89376-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-89376-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89375-2
Online ISBN: 978-3-540-89376-9
eBook Packages: Computer ScienceComputer Science (R0)