Abstract
Skyline query processing has recently received a lot of attention in database community. Given a set of multi-dimensional objects, the skyline query finds the objects that are not dominated by others. To the best of our knowledge, the existing researches mainly focus on how to efficiently return the whole skyline set. However, as the cardinality and dimensionality of input dataset increase, the number of skylines grows exponentially, and hence this “huge” skyline set is completely useless to users. Motivated by the above fact, in this paper, we present a novel type of l-SkyDiv query, which only returns l skylines having maximum diversity, to improve the usefulness of skyline result. Also, we prove that the l-SkyDiv query belongs to the NP-Hard problem theoretically, and propose three efficient heuristic algorithms whose time complexities are polynomial to fast implement the proposed query. Furthermore, we present detailed theoretical analyses and extensive experiments, demonstrating that our algorithms are both efficient and effective.
Similar content being viewed by others
References
Borzsonyi S, Kossmann D, Stocker K. The skyline operator. In: Proceedings of ICDE, Heidelburg, Germany, 2001. 564–573
Chomicki J, Godfrey P, Gryz J, et al. Skyline with presorting: Theory and optimization. In: Proceedings of International Conference on Intelligent Information Systems, Gdansk, Poland, 2005. 216–225
Chomicki J, Godfrey P, Gryz J, et al. Skyline with presorting. In: Proceedings of ICDE, Bangalore, India, 2003. 816–825
Tan K L, Eng P K, Ooi B C. Efficient progressive skyline computation. In: Proceedings of VLDB, Roma, Italy, 2001. 631–642
Kossmann D, Ramsak F, Preparata F P. Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of VLDB, Roma, Italy, 2001. 673–682
Papadias D, Tao Y, Fu G, et al. Progressive skyline computation in data systems. ACM Trans Database Syst, 2005, 30: 41–82
Pei J, Jin W, Ester M, et al. Catching the best views of skyline: A semantic approach based on decisive subspaces. In: Proceedings of VLDB, Trondheim, Norway, 2005. 315–326
Pei J, Yuan Y, Lin X, et al. Towards multidimensional subspace skyline analysis. ACM Trans Database Syst, 2006, 31: 643–697
Yuan Y, Lin X, Liu Q, et al. Efficient computation of the skyline cube. In: Proceedings of VLDB, Trondheim, Norway, 2005. 241–252
Xia T, Zhang D. Refreshing the sky: the compressed skycube with efficient support for frequent updates. In: Proceedings of SIGMOD, Chicago, Illinois, USA, 2006. 39–50
Huang Z, Wang W. A novel incremental maintenance algorithm of skycube. In: Proceedings of International Conference on Database and Expert Systems Applications, Krakow, Poland, 2006. 781–790
Tao Y, Xiao X, Pei J. SUBSKY: Efficient computation of skylines in subspaces. In: Proceedings of ICDE, Atlanta, Georgia USA, 2006. 711–720
Tao Y, Xiao X, Pei J. Efficient skyline and top-k retrieval in subspace. IEEE Trans Knowl Data Eng, 2007, 19: 1072–1088
Jin W, Anthony K H T, Ester M, et al. On efficient processing of subspace skyline queries on high dimensional data. In: Proceedings of the 19th International Conference on Scientific and Statistical Database Management, Banff, Canada, 2007. 12–22
Huang Z, Guo J, Sun S, et al. Efficient optimization of multiple subspace skyline queries. J Comput Sci Tech, 2008, 23: 103–111
Hristidis V, Koudas N, Papakonstantinou Y. PREFER: A system for the efficient execution of multi-parametric ranked queries. In: Proceedings of SIGMOD, Santa Barbara, CA, USA, 2001. 249–260
Zeng W, Guo P. Normalized distance, similarity measure, inclusion measure and entropy of interval-valued fuzzy sets and their relationship. Inf Sci, 2008, 178: 1334–1342
Murase Y, Aikebaier A, Enokido T, et al. Distributed databases in dynamic R-tree for vechicle information systems. In: Proceedings of International Conference on Advanced Information Networking and Applications, GinoWan, Okinawa, Japan, 2008. 133–138
Bicego M, Lagorio A, Grosso E, et al. On the use of SIFT features for face authentication. In: Proceedings of International Conference on Computer Vision and Pattern Recognition Workshop, New York, USA, 2006. 35–35
Johnson C R. Automating the DNA computer: solving n-Variable 3-SAT problems. Nat Comput, 2008, 7: 239–253
Boudraa A O, Cexus J C, Groussat M M, et al. An energy-based similarity measure for time series. EURASIP J Adv Signal Process, 2008, 20: 81–88
Um J H, Chowdhury N K, Chang J W. New range and k-nn query processing algorithms using materialization technique on spatial network. In: Proceedings of International Symposium on Information Technology Convergence, Jeonju, Korea, 2007. 76–80
Leite S C, Neto R F. Incremental margin algorithm for large margin classifiers. Neurocomputing, 2008, 71: 1550–1560
He H, Xie J, Yang J, et al. Asymmetric batch incremental view maintenance. In: Proceedings of ICDE, Tokyo, Japan, 2005. 106–117
Chen Z, Narasayya V. Efficient computation of multiple groups by queries. In: Proceedings of SIGMOD, Baltimore, Maryland, USA, 2005. 263–274
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Huang, Z., Xiang, Y. & Lin, Z. l-SkyDiv query: Effectively improve the usefulness of skylines. Sci. China Inf. Sci. 53, 1785–1799 (2010). https://doi.org/10.1007/s11432-010-4041-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-4041-6