Skip to main content
Log in

Z-SKY: an efficient skyline query processing framework based on Z-order

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Given a set of data points in a multidimensional space, a skyline query retrieves those data points that are not dominated by any other point in the same dataset. Observing that the properties of Z-order space filling curves (or Z-order curves) perfectly match with the dominance relationships among data points in a geometrical data space, we, in this paper, develop and present a novel and efficient processing framework to evaluate skyline queries and their variants, and to support skyline result updates based on Z-order curves. This framework consists of ZBtree, i.e., an index structure to organize a source dataset and skyline candidates, and a suite of algorithms, namely, (1) ZSearch, which processes skyline queries, (2) ZInsert, ZDelete and ZUpdate, which incrementally maintain skyline results in presence of source dataset updates, (3) ZBand, which answers skyband queries, (4) ZRank, which returns top-ranked skyline points, (5) k-ZSearch, which evaluates k-dominant skyline queries, and (6) ZSubspace, which supports skyline queries on a subset of dimensions. While derived upon coherent ideas and concepts, our approaches are shown to outperform the state-of-the-art algorithms that are specialized to address particular skyline problems, especially when a large number of skyline points are resulted, via comprehensive experiments.

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

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

  2. Bartolini, I., Ciaccia, P., Patella, M.: SaLSa: Computing the skyline without scanning the whole sky. In: Proceedings of CIKM, pp. 405–414 (2006)

  3. Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is ”nearest neighbor” meaningful? In: Proceedings of ICDT, pp. 217–235 (1999)

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

  5. 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)

  6. Chaudhuri, S., Dalvi, N.N., Kaushik, R.: Robust cardinality and cost estimation for skyline operator. In: Proceedings of ICDE, p. 64 (2006)

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

  8. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with Presorting. In: Proceedings of ICDE, pp. 717–816 (2003)

  9. Dellis, E., Vlachou, A., Vladimirskiy, I., Seeger, B., Theodoridis, Y.: Constrained subspace skyline computation. In: Proceedings of CIKM, pp. 415–424 (2006)

  10. Fuhry, D., Jin, R., Zhang, D.: Efficient skyline computation in metric space. In: Proceedings of EDBT, pp. 1042–1051 (2009)

  11. Gaede V., Günther O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170–231 (1998)

    Article  Google Scholar 

  12. García, Y.J., Lopez, M.A., Leutenegger, S.T.: A greedy algorithm for bulk loading R-trees. In: Proceedings of ACM GIS, pp. 163–164 (1998)

  13. Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: Proceedings of VLDB Conference, pp. 229–240 (2005)

  14. Hjaltason G.R., Samet H.: Distance browsing in spatial databases. ACM TODS 24(2), 265–318 (1999)

    Article  Google Scholar 

  15. Huang, Z., Jensen, C.S., Lu, H., Ooi, B.C.: Skyline queries against mobile lightweight devices in MANETs. In: Proceedings of ICDE, p. 66 (2006)

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

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

  18. Li, H., Tan, Q., Lee, W.-C.: Efficient progressive processing of skyline queries in peer-to-peer systems. In: Proceedings of Infoscale, p. 26 (2006)

  19. Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the sky: efficient skyline computation over sliding windows. In: Proceedings of ICDE, pp. 502–513 (2005)

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

  21. Orenstein, J.A., Merrett, T.H.: A class of data structures for associative searching. In: Proceedings of PODS, pp. 181–190 (1984)

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

    Article  Google Scholar 

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

  24. Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the UB-tree into a database system kernel. In: Proceedings of VLDB Conference, pp. 263–272 (2000)

  25. Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: Proceedings of VLDB Conference, pp. 751–762 (2006)

  26. Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient Progressive Skyline Computation. In: Proceedings of VLDB Conference, pp. 301–310 (2001)

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

  28. Tao Y., Papadias D.: Maintaining sliding window skylines on data streams. IEEE TKDE 18(2), 377–391 (2006)

    Google Scholar 

  29. Tao Y., Xiao X., Pei J.: Efficient skyline and top-k retrieval in subspaces. IEEE TKDE 19(8), 1072–1088 (2007)

    Google Scholar 

  30. Wang, S., Ooi, B.C., Tung, A.K.H., Xu, L.: Efficient skyline query processing on peer-to-peer networks. In: Proceedings of ICDE, pp. 1126–1135 (2007)

  31. Wu, P., Agrawal, D., Egeciglu, O., Abbadi, A.E.: DeltaSky: optimal maintenance of skyline deletions without exclusive dominance region generation. In: Proceedings of ICDE, pp. 486–495 (2007)

  32. Wu, P., Zhang, C., Feng, Y., Zhao, B.Y., Agrawal, D., Abbadi, A.E.: Parallelizing skyline queries for scalable distribution. In: Proceedings of EDBT, pp. 112–130 (2006)

  33. Yiu, M.L., Mamoulis, N.: Efficient processing of top-k dominating queries on multi-dimensional data. In: Proceedings of VLDB Conference, pp. 483–494 (2007)

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

  35. Zheng, B., Lee, K.C.K., Lee, W.-C.: Location-dependent skyline query. In: Proceedings of MDM, pp. 148–155 (2008)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ken C. K. Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, K.C.K., Lee, WC., Zheng, B. et al. Z-SKY: an efficient skyline query processing framework based on Z-order. The VLDB Journal 19, 333–362 (2010). https://doi.org/10.1007/s00778-009-0166-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-009-0166-x

Keywords