VMPSP: Efficient Skyline Computation Using VMP-Based Space Partitioning

  • Kaiqi ZhangEmail author
  • Donghua Yang
  • Hong Gao
  • Jianzhong Li
  • Hongzhi Wang
  • Zhipeng Cai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9645)


The skyline query returns a set of interesting points that are not dominated by any other points in the multi-dimensional data sets. This query has already been considerably studied over last several years in preference analysis and multi-criteria decision making applications fields. Space partitioning, the best non-index framework, has been proposed and existing methods based on it do not consider the balance of partitioned subspaces. To overcome this limitation, we first develop a cost evaluation model of space partitioning in skyline computation, propose an efficient approach to compute the skyline set using balanced partitioning. We illustrate the importance of the balance in partitioning. Based on this, we propose a method to construct a balanced partitioning point VMP whose ith attribute value is the median value of all points in ith dimension. We also design a structure RST to reduce dominance tests among those subspaces which are comparable. The experimental evaluation indicates that our algorithm is faster at least several times than existing state-of-the-art algorithms.


Skyline Query Space Partitioning Skyline Point Dominance Test Query Response Time 
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.


  1. 1.
    Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE (2001)Google Scholar
  2. 2.
    Chomicki, J., Godfrey, P., Gryz, J., et al.: Skyline with presorting. In: ICDE (2003)Google Scholar
  3. 3.
    Zhang, S., Mamoulis, N., Cheung, D.W.: Scalable skyline computation using object-based space partitioning. In: SIGMOD (2009)Google Scholar
  4. 4.
    Lee, J., Hwang, S.: BSkyTree: Scalable skyline computation using a balanced pivot selection. In: EDBT (2010)Google Scholar
  5. 5.
    Bøgh, K.S., Chester, S.: Assent I. Work-efficient parallel skyline computation for the GPU. In: VLDB (2015)Google Scholar
  6. 6.
    Bartolini, I., Ciaccia, P., Patella, M.: Efficient sort-based skyline evaluation. ACM TODS 33(4), 1–45 (2008)CrossRefGoogle Scholar
  7. 7.
    Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: VLDB (2005)Google Scholar
  8. 8.
    Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: VLDB (2002)Google Scholar
  9. 9.
    Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: VLDB (2001)Google Scholar
  10. 10.
    Lee, K.C.K., Zheng, B., Li, H., et al.: Approaching the skyline in Z order. In: VLDB (2007)Google Scholar
  11. 11.
    Papadias, D., Tao, Y., Fu, G., et al.: Progressive skyline computation in database systems. ACM TODS 30(1), 41–82 (2005)CrossRefGoogle Scholar
  12. 12.
    Lee, J., Hwang, S.: QSkycube: Efficient skycube computation using point-based space partitioning. In: VLDB (2010)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Kaiqi Zhang
    • 1
    Email author
  • Donghua Yang
    • 2
  • Hong Gao
    • 1
  • Jianzhong Li
    • 1
  • Hongzhi Wang
    • 1
  • Zhipeng Cai
    • 3
  1. 1.School of Computer Science and TechnologyHarbin Institute of TechnologyHarbinChina
  2. 2.Academy of Fundamental and Interdisciplinary SciencesHarbin Institute of TechnologyHarbinChina
  3. 3.Department of Computer ScienceGeorgia State UniversityAtlantaUSA

Personalised recommendations