Top-k Dominance Range-Based Uncertain Queries

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9877)

Abstract

Most of the existing efforts for probabilistic skyline queries have used data modeling where the appearance of the object is uncertain while the attribute values of objects are certain. In many real-life applications, the values of an uncertain object can be in a continuous range that a probability density function is employed to describe the distribution of the values. In addition, the “interest-ingness” of the objects as a single criterion for measuring skyline probability may result in missing some desirable data objects. In this paper, we introduce a new operator, namely, the Top-k Dominating Range (TkDR) query, to identify the subset of truly interesting objects by considering objects’ dominance scores. We devise the ranking criterion to formalize the TkDR query and propose three algorithms for processing the TkDR query. Performance evaluations are conducted on both real-life and synthetic datasets to demonstrate the efficiency, effectiveness and scalability of our proposed approach.

References

  1. 1.
    He, G., Chen, L., Zeng, C., Zheng, Q., Zhou, G.: Probabilistic skyline queries on uncertain time series. Neurocomputing 191, 224–237 (2016)CrossRefGoogle Scholar
  2. 2.
    Zhang, Y., Zhang, W., Lin, X., Jiang, B., Pei, J.: Ranking uncertain sky: the probabilistic top-k skyline operator. Inf. Syst. 36(5), 898–915 (2011)CrossRefGoogle Scholar
  3. 3.
    Cheng, R., Singh, S., Prabhakar, S., Shah, R., Vitter, J.S., Xia, Y.: Efficient join processing over uncertain data. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management 2006, pp. 738–747. ACM (2006)Google Scholar
  4. 4.
    Yiu, M.L., Mamoulis, N.: Multi-dimensional top-k dominating queries. VLDB J. 18(3), 695–718 (2009)CrossRefGoogle Scholar
  5. 5.
    Lian, X., Chen, L.: Top-k dominating queries in uncertain databases. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology 2009, pp. 660–671. ACM (2009)Google Scholar
  6. 6.
    Vlachou, A., Doulkeridis, C., Halkidi, M.: Discovering representative skyline points over distributed data. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 141–158. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  7. 7.
    Lee, J., You, G.-W.: Hwang, S.-w.: Personalized top-k skyline queries in high-dimensional space. Inf. Syst. 34(1), 45–61 (2009)CrossRefGoogle Scholar
  8. 8.
    Zhou, B., Yao, Y.: Evaluating information retrieval system performance based on user preference. J. Intell. Inf. Syst. 34(3), 227–248 (2010)CrossRefGoogle Scholar
  9. 9.
    Nanongkai, D., Sarma, A.D., Lall, A., Lipton, R.J., Xu, J.: Regret-minimizing representative databases. Proc. VLDB Endowment 3(1–2), 1114–1124 (2010)CrossRefGoogle Scholar
  10. 10.
    Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data 2003, pp. 467–478. ACM (2003)Google Scholar
  11. 11.
    Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: Proceedings of the 33rd international conference on Very large data bases 2007, pp. 15–26. VLDB EndowmentGoogle Scholar
  12. 12.
    Gao, Y., Miao, X., Cui, H., Chen, G., Li, Q.: Processing k-skyband, constrained skyline, and group-by skyline queries on incomplete data. Expert Syst. Appl. 41(10), 4959–4974 (2014)CrossRefGoogle Scholar
  13. 13.
    Gao, Y., Liu, Q., Chen, L., Chen, G., Li, Q.: Efficient algorithms for finding the most desirable skyline objects. Knowl. Based Syst. 89, 250–264 (2015)CrossRefGoogle Scholar
  14. 14.
    Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, 2001, pp. 421–430. IEEE (2001)Google Scholar
  15. 15.
    Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. In: VLDB 2001, pp. 301–310 (2001)Google Scholar
  16. 16.
    Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the 28th International Conference on Very Large Data Bases 2002, pp. 275–286. VLDB EndowmentGoogle Scholar
  17. 17.
    Morse, M., Patel, J.M., Jagadish, H.: Efficient skyline computation over low-cardinality domains. In: Proceedings of the 33rd International Conference on Very Large Data Bases 2007, pp. 267–278. VLDB Endowment (2007)Google Scholar
  18. 18.
    Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: ICDE 2003, pp. 717–719 (2003)Google Scholar
  19. 19.
    Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. Paper presented at the Proceedings of the 2009 IEEE International Conference on Data Engineering (2009)Google Scholar
  20. 20.
    Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. Paper presented at the Proceedings of the 23rd International Conference on Data EngineeringGoogle Scholar
  21. 21.
    Hua, M., Pei, J., Zhang, W., Lin, X.: Efficiently answering probabilistic threshold top-k queries on uncertain data. Paper presented at the Proceedings of the 2008 IEEE 24th International Conference on Data Engineering (2008)Google Scholar
  22. 22.
    Zhang, X., Chomicki, J.: Semantics and evaluation of top-k queries in probabilistic databases. Distrib. Parallel Databases 26(1), 67–126 (2009)CrossRefGoogle Scholar
  23. 23.
    Soliman, M.A., Ilyas, I.F.: Ranking with uncertain scores. Paper presented at the Proceedings of the 25th International Conference on Data EngineeringGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.La Trobe UniversityMelbourneAustralia

Personalised recommendations