Skip to main content
Log in

The subspace global skyline query processing over dynamic databases

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

The global skyline, as an important variant of the skyline, has been widely applied in multi-criteria decision making, business planning and data mining. In this paper, we extend our early work and propose the maintenance methods to process the subspace global skyline (SGS) queries in dynamic databases. In the previous work, we proposed the index structure RB-tree, which can effectively manage the data to accelerate the subspace global skyline calculation. Also, the basic single SGS algorithm based on RB-tree (SSRB) and the optimized single SGS algorithm (OSSRB) were proposed to process a single SGS query. In addition, the multiple SGS algorithm (MSRB) was proposed to calculate multiple SGS queries by sharing the scan spaces of different queries. In this paper, we design some data structures and propose the maintenance approaches of SSRB, OSSRB and MSRB to cope with updates that happen to data sets. Thus our extended algorithms can be adopted for dynamic data sets. Finally, the experimental results show that the proposed algorithms OSSRB and MSRB have good performance to process SGS queries and they can be easily maintained with dynamic datasets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17
Figure 18
Figure 19
Figure 20
Figure 21
Figure 22
Figure 23
Figure 24
Figure 25

Similar content being viewed by others

Notes

  1. λ is a small value, which is used to determine whether the values in one interval is evenly distributed or not. λ can be assigned by the user.

References

  1. Amagata, D., Sasaki, Y., Hara, T., et al.: Efficient processing of top-k dominating queries in distributed environments. World Wide Web Journal (2015)

  2. Bai, M., Xin, J., Wang, G.: Subspace global skyline query processing. In: Proceedings of the 16th International Conference on Extending Database Technology, pp. 418–429. ACM (2013)

  3. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of ICDE, pp. 421–430 (2001)

  4. Balke, W.T., Gntzer, U., Zheng, J.X.: Efficient distributed skylining for web information systems. In: Proceedings of EDBT, pp. 256–273 (2004)

  5. Balke, W.T., Gntzer, U.: Multi-objective query processing for database systems. In: Proceedings of VLDB, pp. 936–947 (2004)

  6. Chen, L., Lian, X.: Dynamic skyline queries in metric spaces. In: Proceedings of EDBT, pp. 333–343 (2008)

  7. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: Proceedings of ICDE, pp. 717–719 (2003)

  8. Chan, C.Y., Jagadish, H.V., Tan, K.L., Tung, A.K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: Proceedings of SIGMOD, pp. 503–514 (2006)

  9. Dellis, E., Seeger, B.: Efficient computation of reverse skyline queries. In: Proceedings of VLDB, pp. 291–302 (2007)

  10. Dellis, E., Vlachou, A., Vladimirskiy, I., Seeger, B., Theodoridis, Y.: Constrained subspace skyline computation. CIKM 2006: 415–424

  11. Jin, W., Tung, A.K.H., Ester, M., Han, J.: On efficient processing of subspace skyline queries on high dimensional data. SSDBM 2007: 12–21

  12. Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM, 469–476 (1975)

  13. Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of VLDB, pp. 275–286 (2002)

  14. Khalefa, M.E., Mokbel, M.F., Levandoski, J.J.: Skyline query processing for uncertain data. In: Proceedings of CIKM, pp. 1293–1296 (2010)

  15. Lee, C.K., Zheng, B., Li, H., Lee, W.-C.: Approaching the skyline in z order. In: Proceedings of VLDB, pp. 279–290 (2007)

  16. Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: The k most representative skyline operator. In: Proceedings of ICDE, pp. 86–95 (2007)

  17. Liu, B., Chan, C.-Y.: Zinc: Efficient indexing for skyline computation[J]. In: PVLDB, pp. 197–207 (2010)

  18. Lian, X., Chen, L.: Efficient processing of probabilistic group subspace skyline queries in uncertain databases. Inf. Syst. 38(3), 265–285 (2013)

    Article  Google Scholar 

  19. Lin, X., Zhang, Y., Zhang, W., Cheema, M.A.: Stochastic skyline operator. In: Proceedings of ICDE, pp. 721–732 (2011)

  20. Lian, X., Chen, L.: Efficient processing of probabilistic group subspace skyline queries in uncertain databases[J]. Inf. Syst. 38(3), 265–285 (2013)

    Article  Google Scholar 

  21. Lian, X., Chen, L.: Monochromatic and bichromatic reverse skyline search over uncertain databases. In: Proceedings of SIGMOD, pp. 213–226 (2008)

  22. Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. 30(1), 41–82 (2005)

    Article  Google Scholar 

  23. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of SIGMOD, pp. 467–478 (2003)

  24. Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: Proceedings of VLDB, pp. 15–26 (2007)

  25. Pei, J., Yuan, Y., Lin, X., Jin, W., Ester, M., Liu, Q., Wang, W., Tao, Y., Yu, J.X., Zhang, Q.: Towards multidimensional subspace skyline analysis. ACM Trans. Database Syst. 31(4), 1335–1381 (2006)

    Article  Google Scholar 

  26. Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: a semantic approach based on decisive subspaces. In: Proceedings of VLDB, pp. 253–264 (2005)

  27. Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings of VLDB, pp. 301–310 (2001)

  28. Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: Proceedings of ICDE, pp. 892–903 (2009)

  29. Tao, Y., Xiao, X., Pei, J.: Subsky: Efficient computation of skylines in subspaces. In: Proceedings of ICDE, pp. 65–74 (2006)

  30. Vlachou, A., Doulkeridis, C., Kotidis, Y., Vazirgiannis, M.: SKYPEER: Efficient Subspace skyline computation over distributed data. ICDE 2007: 416–425

  31. Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: Proceedings of VLDB, pp. 241–252 (2005)

  32. Zhao, L., Yang, Y., Zhou, X.: Continuous probabilistic subspace skyline query processing using grid projections. J. Comput. Sci. Technol. 29(2), 332–344 (2014)

    Article  MathSciNet  Google Scholar 

  33. Zhang, W., Li, A., Cheema, M.A., et al.: Probabilistic n-of-N Skyline Computation over Uncertain Data Streams. World Wide Web Journal (2015)

Download references

Acknowledgments

This research was partially supported by the National Natural Science Foundation of China under Grant No. 61100022, 61472069 and U1401256; the 863 Program under Grant No. 2012AA011004, and the Fundamental Research Funds for the Central Universities under Grant No. N130404014 and N150408001.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mei Bai.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bai, M., Xin, J., Wang, G. et al. The subspace global skyline query processing over dynamic databases. World Wide Web 20, 291–324 (2017). https://doi.org/10.1007/s11280-016-0387-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-016-0387-z

Keywords

Navigation