Abstract
Representative skyline computation is a fundamental issue in database area, which has attracted much attention in recent years. A notable definition of representative skyline is the distance-based representative skyline (DBRS). Given an integer k, a DBRS includes k representative skyline points that aims at minimizing the maximal distance between a non-representative skyline point and its nearest representative. In the 2D space, the state-of-the-art algorithm to compute the DBRS is based on dynamic programming (DP) which takes O(k m 2) time complexity, where m is the number of skyline points. Clearly, such a DP-based algorithm cannot be used for handling large scale datasets due to the quadratic time cost. To overcome this problem, in this paper, we propose a new approximate algorithm called ARS, and a new exact algorithm named PSRS, based on a carefully-designed parametric search technique. We show that the ARS algorithm can guarantee a solution that is at most 𝜖 larger than the optimal solution. The proposed ARS and PSRS algorithms run in O(klog2mlog(T/𝜖)) and O(k 2 log3m) time respectively, where T is no more than the maximal distance between any two skyline points. We also propose an improved exact algorithm, called PSRS+, based on an effective lower and upper bounding technique. We conduct extensive experimental studies over both synthetic and real-world datasets, and the results demonstrate the efficiency and effectiveness of the proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balke, W., Gu̇ntzer, U., Zheng, J. X.: Efficient distributed skylining for web information systems. In: EDBT, pp 256–273 (2004)
Bȯrzsȯnyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp 421–430 (2001)
Cai, T., Li, R., Yu, J. X., Mao, R., Cai, Y.: Efficient algorithms for distance-based representative skyline computation in 2d space. In: APWeb (2015)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: ICDE, pp 717–719 (2003)
Godfrey, P.: Skyline cardinality for relational processing. In: foundations of information and knowledge systems, Third International Symposium, pp 78–97 (2004)
Huang, Z., Jensen, C. S., Hua, L., Ooi, B. C.: Skyline queries against mobile lightweight devices in manets. In: ICDE, p 66 (2006)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky an online algorithm for skyline queries. In: VLDB, pp 275–286 (2002)
Kung, H. T., Luccio, F., Preparata, F. P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469–476 (1975)
Lin, X., Yuan, Y., Zhang, Q., stars, Y. Z.: Selecting the k most representative skyline operator. In: ICDE, pp 86–95 (2007)
Magnani, M., Assent, I., Mortensen, M. L.: Taking the big picture: representative skylines based on significance and diversity. VLDB J. 23(5), 795–815 (2014)
Mao, R., Xu, H., Wu, W., Li, J., Li, Y., Lu, M.: Overcoming the challenge of variety: big data abstraction, the next evolution of data management for AAL communication systems. IEEE Commun. Mag. 53(1), 42–47 (2015)
Mao, R., Zhang, P., Li, X., Xi, L., Lu, M.: Pivot selection for metric-space indexing. Int. J. Mach. Learn. Cybern. 7(2), 311–323 (2016)
Papadias, D., Tao, Y., Greg, F., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD, pp 467–478 (2003)
Papadias, D., Tao, Y., Greg, F., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD, pp 467–478 (2003)
Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: A semantic approach based on decisive subspaces. In: VLDB, pp 253–264 (2005)
Ping, W., Zhang, C., Feng, Y., Zhao, B., Agrawal, D., Abbadi, A. E.: Parallelizing skyline queries for scalable distribution. In: EDBT, pp 112–130 (2006)
Sarma, A. D., Lall, A., Nanongkai, D., Lipton, R. J., Xu, J. J.: Representative skylines using threshold-based preference distributions. In: ICDE, pp 387–398 (2011)
Tan, K.-L., Eng, P.-K., Ooi, B. C.: Efficient progressive skyline computation. In: VLDB, pp 301–310 (2001)
Tao, Y., Papadias, D.: Maintaining sliding window skylines on data streams. IEEE Trans. Knowl. Data Eng. 18(2), 377–391 (2006)
Tao, Y., Xiao, X., Pei, J.: SUBSKY: efficient computation of skylines in subspaces. In: ICDE, p 65 (2006)
Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: ICDE, pp 892–903 (2009)
Wang, S., Ooi, B. C., Tung, A. K. H., Lizhen, X.: Efficient skyline query processing on peer-to-peer networks. In: ICDE, pp 1126–1135 (2007)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J. X., Zhang, Q.: Efficient computation of the skyline cube. In: VLDB, pp 241–252 (2005)
Zhang, F., Wilkie, D., Zheng, Y., Xie, X.: Sensing the pulse of urban refueling behavior. In: UbiComp, pp 13–22 (2013)
Acknowledgments
This work was partially supported by (1) NSF-China grants (no. 61402292, U1301252, 61471243), China 863 project (no. 2015AA015305); (2) Guangdong Key Laboratory Project (2012A061400024), NSF-Shenzhen grants (no. JCYJ20150324140036826, JCYJ20140418095735561, JCYJ20150731160834611), Shenzhen-Hong Kong Innovation circle project (no. SGLH20131010163759789); (3) Research Grants Council of the Hong Kong SAR, China, 14209314; (4) the ARC Discovery Projects under Grant No. DP160102114. Dr. Rong-Hua Li is the corresponding author of this paper.
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Mao, R., Cai, T., Li, RH. et al. Efficient distance-based representative skyline computation in 2D space. World Wide Web 20, 621–638 (2017). https://doi.org/10.1007/s11280-016-0406-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11280-016-0406-0