Skip to main content
Log in

Efficient column-oriented processing for mutual subspace skyline queries

Soft Computing Aims and scope Submit manuscript

Cite this article


A mutual skyline query will enable some new applications, such as marketing analysis, task allocation, and personalized matching. Algorithms for efficient processing of this query have been recently proposed in the literature. Those approaches use the R-tree indexes and apply a series of pruning criteria toward efficient processing. However, they are characterized by several limitations: (1) they cannot process different interests on attributes for skyline and reverse skyline, (2) they require a multidimensional index, which suffers from performance degradation, especially in high-dimensional space, and (3) they do not support vertically decomposed data that is a natural and intuitive choice for the parallel queries. To this end, we address aforementioned these problems and propose three efficient algorithms, i.e., index-based mutual subspace skyline, optimized index-based MSS, and parallel mutual subspace skyline, using the column-oriented processing that is more suitable for subspace and parallel skyline. Extensive experimental results show that our proposed algorithms are effective and efficient.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12


  • Bai M, Xin J, Wang G (2013) Subspace global skyline query processing. In: Proceedings of the 16th ACM EDBT conference. pp 418–429

  • Bartolini I, Ciaccia P, Patella M (2006) SaLSa: computing the skyline without scanning the whole sky. In: Proceedings of the 15th ACM CIKM conference. pp 405–414

  • Borzsonyi S, Kossmann D, Stocker K (2001) The skyline operator. In: Proceedings of the 17th IEEE ICDE conference. pp 421–430

  • Dagum L, Menon R (1998) OpenMP: an industry-standard API for shared memory programming. IEEE Comput Sci Eng 5(1):46–55

    Article  Google Scholar 

  • Dellis E, Seeger B (2007) Efficient computation of reverse skyline queries. In: Proceedings of the 33th VLDB conference. pp. 291–302

  • Islam MS, Liu C, Rahayu JW, Anwar T (2016) Q+Tree: an efficient quad tree based data indexing for parallelizing dynamic and reverse skylines. In: Proceedings of the 25th ACM CIKM conference. pp 1291–1300

  • Jiang T, Gao Y, Zhang B, Lin D, Li Q (2014) Monochromatic and bichromatic mutual skyline queries. Expert Syst Appl 41(4):1885–1900

    Article  Google Scholar 

  • Jiang T, Zhang B, Lin D, Gao Y, Li Q (2015) Incremental evaluation of top-k combinatorial metric skyline query. Knowl Based Syst 74:89–105

    Article  Google Scholar 

  • Lee J, Hwang SW (2014) Toward efficient multidimensional subspace skyline computation. VLDB J 23(1):129–145

    Article  Google Scholar 

  • Lee KCK, Lee WC, Zheng B, Li H, Tian Y (2010) Z-SKY: an efficient skyline query processing framework based on Z order. VLDB J 19(3):333–362

    Article  Google Scholar 

  • Li C, Ooi BC, Tung AKH, Wang S (2006) DADA: a data cube for dominant relationship analysis. In: Proceedings of the 25th ACM SIGMOD conference. pp 659–670

  • Li R, Qin L, Ye F, Yu X J, Xiao X et al (2018) Skyline community search in multi-valued networks. In: Proceedings of the 2018 ACM SIGMOD conference. pp 457–472

  • Lian X, Chen L (2010) Reverse skyline search in uncertain databases. ACM Trans Database Syst 35(1):3

    Article  Google Scholar 

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

    Article  Google Scholar 

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

  • Liu J, Xiong L, Pei P, Luo J, Zhang H (2015) Finding pareto optimal groups: group-based skyline. PVLDB 8(13):2086–2097

    Google Scholar 

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

    Article  Google Scholar 

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

  • Pei J, Yuan Y, Lin X et al (2006) Towards multidimensional subspace skyline analysis. ACM Trans Database Syst 31(4):1335–1381

    Article  Google Scholar 

  • Rahman MF, Asudeh A, Koudas N, Das G (2017) Efficient computation of subspace skyline over categorical domains. In: Proceedings of the 26th ACM CIKM conference. pp 407–416

  • Tao Y, Papadias D, Lian X, Xiao X (2007a) Multidimensional reverse kNN search. VLDB J 16(3):293–316

    Article  Google Scholar 

  • Tao Y, Xiao X, Pei J (2007b) Efficient skyline and top-k retrieval in subspaces. IEEE Trans Knowl Data Eng 19(8):1072–1088

    Article  Google Scholar 

  • Tiakas E, Papadopoulos AN, Manolopoulos Y (2011) Progressive processing of subspace dominating queries. VLDB J 20:921–948

    Article  Google Scholar 

  • Vlachou A, Doulkeridis C, Kotidis Y, Vazirgiannis M (2010) Efficient routing of subspace skyline queries over highly distributed data. IEEE Trans Knowl Data Eng 22(12):1694–1708

    Article  Google Scholar 

  • Xia T, Zhang D, Fang Z et al (2012) Online subspace skyline query processing using the compressed skycube. ACM Trans Database Syst 37(2):15

    Article  Google Scholar 

  • Yang Z, Li K, Zhou X, Mei J, Gao Y (2018) Top k probabilistic skyline queries on uncertain data. Neurocomputing 317:1–14

    Article  Google Scholar 

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

Download references


This work was supported in part by the ZJNSF Grant LY16F020026, NSFC Grants 61522208 and 61379033.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Tao Jiang.

Ethics declarations

Conflict of interest

All authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, T., Zhang, B., Lin, D. et al. Efficient column-oriented processing for mutual subspace skyline queries. Soft Comput 24, 15427–15445 (2020).

Download citation

  • Published:

  • Issue Date:

  • DOI: