Skip to main content
SpringerLink
Log in

Progressive processing of subspace dominating queries

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

Abstract

A top-k dominating query reports the k items with the highest domination score. Algorithms for efficient processing of this query have been recently proposed in the literature. Those methods, either index based or index free, apply a series of pruning criteria toward efficient processing. However, they are characterized by several limitations, such as (1) they lack progressiveness (they report the k best items at the end of the processing), (2) they require a multi-dimensional index or they build a grid-based index on-the-fly, which suffers from performance degradation, especially in high dimensionalities, and (3) they do not support vertically decomposed data. In this paper, we design efficient algorithms that can handle any subset of the dimensions in a progressive manner. Among the studied algorithms, the Differential Algorithm shows the best overall performance.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abadi, D.J., Madden, S.R., Hachem, N.: Column-Stores vs. Row-Stores: How Different Are They Really? In: Proceedings of the ACM SIGMOD Conference, pp. 967–980 (2008)

  2. Balke, W.T., Guentzer, U., Zheng, J.X.: Efficient distributed skylining for web information systems. Proceedings of Advances in Database Technology (EDBT), pp. 256–273 (2004)

  3. Boncz P.A., Kersten M.L., Manegold S.: Breaking the Memory Wall in MonetDB. Communications of the ACM 51(12), 77–85 (2008)

    Article  Google Scholar 

  4. Borzsonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 421–430 (2001)

  5. Chan, C.Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: On high dimensional skylines. In: Proceedings of the 10th International Conference on Extending Database Technology (EDBT), pp. 478–495 (2006)

  6. 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 the ACM SIGMOD Conference, pp. 503–514 (2006)

  7. de Vries, A.P., Mamoulis, N., Nes, N., Kersten, M.: Efficient k-NN Search on Vertically Decomposed Data. In: Proceedings of the ACM SIGMOD Conference, pp. 322–333 (2002)

  8. Dvoretzky A., Kiefer J., Wolfowitz J.: Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator. Ann. Math. Stat. 27(3), 642–669 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fagin, R.: Combining fuzzy information from multiple systems. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 216–226 (1996)

  10. Fagin, R.: Optimal aggregation algorithms for middleware. In: Proceedings of ACM PODS Conference (PODS), pp. 102–113 (2001)

  11. Gilchrist W.: Statistical Modelling with Quantile Functions. Chapman and Hall/CRC, London (2000)

    Book  Google Scholar 

  12. Kriegel, H.-P., Kroeger, P., Schubert, M., Zhu, Z.: Efficient query processing in arbitrary subspaces using vector approximations. In: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (SSDBM), pp. 184–190 (2006)

  13. Lian, X., Chen, L.: Top-k dominating queries in uncertain databases. In: Proceedings of the 12th International Conference on Extending Database Technology (EDBT), pp. 660–671 (2009)

  14. Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting Stars: The k most representative skyline operator. In: Proceedings of the 23rd IEEE international conference on data engineering (ICDE), pp. 86–95 (2007)

  15. Lo E., Yip K.Y., Lin K., Cheung D.W.: Progressive skylining over web-accessible databases. Data and Knowledge Engineering 57(2), 122–147 (2006)

    Article  Google Scholar 

  16. Marian A., Bruno N., Gravano L.: Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems 29(2), 319–362 (2004)

    Article  Google Scholar 

  17. Papadias D., Tao Y., Fu G., Seeger B.: Progressive skyline computation in database systems. ACM Transactions on Database Systems 30(1), 41–82 (2005)

    Article  Google Scholar 

  18. Skoutas, D., Sacharidis, D., Simitsis, A., Kantere, V., Sellis, T.: Top-k dominant web services under multi-criteria matching. In: Proceedings of the 12th International Conference on Extending Database Technology (EDBT), pp. 898-909 (2009)

  19. Stonebraker, M., Abadi, D.J., Batkin, A., Chen, X., et al.: C-Store: a column oriented DBMS. In: Proceedings of Very Large Data Bases Conference (VLDB), pp. 553–564 (2005)

  20. Tao, Y., Xiao, X., Pei, J.: SUBSKY: efficient computation of skylines in subspaces. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 65–76 (2006)

  21. Tao Y., Xiao X.: Efficient skyline and top-k retrieval in subspaces. IEEE Transactions on Knowledge and Data Engineering 19(8), 1072–1088 (2007)

    Article  Google Scholar 

  22. Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings of Very Large Data Bases Conference (VLDB), pp. 301–310 (2001)

  23. Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE), pp. 892–903 (2009)

  24. Tao, Y., Sheng, C., Li, J.: Finding maximum degrees in hidden bipartite graphs. In: Proceedings of ACM SIGMOD Conference, pp. 891–902 (2010)

  25. Tong Y.L.: Probability Inequalities in Multivariate Distributions. Academic Press, London (1980)

    MATH  Google Scholar 

  26. Vlachou, A., Doulkeridis, C., Kotidis, Y.: Angle-based space partitioning for efficient parallel skyline computation. In: Proceedings of the ACM SIGMOD Conference, pp. 227–238 (2008)

  27. Xia, T., Zhang, D.: Refreshing the sky: the compressed skycube with efficient support for frequent updates. In: Proceedings of the ACM SIGMOD Conference, pp. 491–502 (2006)

  28. Xia, T., Zhang, D., Tao, Y.: On skylining with flexible dominance relation. In: Proceedings of the 24th IEEE International Conference on Data Engineering (ICDE), pp. 1397–1399 (2008)

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

  30. Yiu M.L., Mamoulis N.: Multi-dimensional top-k dominating queries. The VLDB J. 18(3), 695–718 (2009)

    Article  Google Scholar 

  31. Yuan, Y., Lin, X., Liu, Q., Wang, W. et al.: Efficient computation of the skyline cube. In: Proceedings of Very Large Data Bases Conference (VLDB), pp. 241–252 (2005)

  32. Zhang, Z., Guo, X., Lu, H., Tung, A.K., Wang, N.: Discovering strong skyline points in high-dimensional spaces. In: Proceedings of the 14th ACM Conference on Information and Knowledge Management (CIKM), pp. 247–248 (2005)

  33. Zhang W., Lin X., Zhang Y., Pei J., Wang W.: Threshold-based probabilistic top-k dominating queries. The VLDB Journal 19(2), 283–305 (2009)

    Article  Google Scholar 

  34. Zhang Z., Lu H., Ooi B.C., Tung A.: Understanding the meaning of a shifted sky: a general framework on extending skyline query. The VLDB Journal 19(2), 181–201 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Aristotle University, 54124, Thessaloniki, Greece

    Eleftherios Tiakas, Apostolos N. Papadopoulos & Yannis Manolopoulos

Authors
  1. Eleftherios Tiakas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Apostolos N. Papadopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yannis Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eleftherios Tiakas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tiakas, E., Papadopoulos, A.N. & Manolopoulos, Y. Progressive processing of subspace dominating queries. The VLDB Journal 20, 921–948 (2011). https://doi.org/10.1007/s00778-011-0231-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-011-0231-0

Keywords

Search

Navigation