Abstract
Reverse top-k queries have received much attention from research communities. The result of reverse top-k queries is a set of objects, which had the k-most interest based on their objects’ references. Moreover, answering the queries on probabilistic data has been studied in many applications. The most common problem with uncertain queries is how to calculate their probabilities. Currently, there are some proposed solutions for selecting answers to queries and calculating probabilistic values based on users’ preferences. In this paper, we study answering reverse top-k queries on probabilistic data. Firstly, we propose a novel method to calculate probabilistic tuples based on the expected theory. Secondly, we present the advantages of our approach against the traditional approach. Furthermore, we upgrade the new algorithm using two techniques of R-tree and upper-lower bound. The experimental results illustrate the efficiency of the proposed algorithm compared to the traditional algorithms in terms of scalability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Li, G., Chen, Q., Zheng, B., Zhao, X.: Reverse top-k query on uncertain preference. In: Cai, Y., Ishikawa, Y., Xu, J. (eds.) Web and Big Data (APWeb-WAIM 2018). LNCS, vol. 10988, pp. 350–358. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96893-3_26
Vlachou, A., Doulkeridis, C., Nørvåg, K., Kotidis, Y.: Branch-and-bound algorithm for reverse top-k queries. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, pp. 481–492 (2013)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Nørvåg, K.: Reverse top-k queries. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 365–376. IEEE (2010)
Xiao, G., Li, K., Zhou, X., Li, K.: Efficient monochromatic and bichromatic probabilistic reverse top-k query processing for uncertain big data. J. Comput. Syst. Sci. 89, 92–113 (2017)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Norvag, K.: Monochromatic and bichromatic reverse top-k queries. IEEE Trans. Knowl. Data Eng. 23(8), 1215–1229 (2011)
Jin, C., Zhang, R., Kang, Q., Zhang, Z., Zhou, A.: Probabilistic reverse top-k queries. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) Database Systems for Advanced Applications, pp. 406–419. Springer International Publishing, Cham (2014)
Le, T.M.N., Cao, J., He, Z.: Top-k best probability queries and semantics ranking properties on probabilistic databases. Data Knowl. Eng. 88, 248–266 (2013)
Suciu, D.: Probabilistic databases for all. In: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 19–31 (2020)
Zhang, W., Lin, X., Pei, J., Zhang, Y.: Managing uncertain data: probabilistic approaches. In: 2008 The Ninth International Conference on Web-Age Information Management, pp. 405–412. IEEE (2008)
Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Evaluating probabilistic queries over imprecise data. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 551–562 (2003)
Aggarwal, C.C., Philip, S.Y.: A survey of uncertain data algorithms and applications. IEEE Trans. Knowl. Data Eng. 21(5), 609–623 (2008)
Hua, M., Pei, J., Zhang, W., Lin, X.: Ranking queries on uncertain data: a probabilistic threshold approach. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 673–686 (2008)
Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: 2009 IEEE 25th International Conference on Data Engineering, pp. 305–316. IEEE (2009)
Atallah, M.J., Qi, Y.: Computing all skyline probabilities for uncertain data. In: Proceedings of the Twenty-Eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 279–287 (2009)
Carmeli, N., Grohe, M., Lindner, P., Standke, C.: Tuple-independent representations of infinite probabilistic databases. In: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 388–401 (2021)
Zhang, X., Chomicki, J.: Semantics and evaluation of top-k queries in probabilistic databases. Distrib. Parallel Databases 26(1), 67–126 (2009)
Liu, X., Yang, D., Ye, M., Lee, W.: U-skyline: a new skyline query for uncertain databases. IEEE Trans. Knowl. Data Eng. 25(4), 945–960 (2013)
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, pp. 15–26 (2007)
Bartolini, I., Ciaccia, P., Patella, M.: Domination in the probabilistic world: computing skylines for arbitrary correlations and ranking semantics. ACM Trans. Database Syst. 39(2), 1–45 (2014)
Le, T.M.N., Cao, J., He, Z.: Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples. Inf. Sci. 340–341, 58–85 (2016)
Lian, X., Chen, L.: Shooting top-k stars in uncertain databases. VLDB J. 20(6), 819–840 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Le, T.M.N., Cao, J. (2024). Probabilistic Reverse Top-k Query on Probabilistic Data. In: Bao, Z., Borovica-Gajic, R., Qiu, R., Choudhury, F., Yang, Z. (eds) Databases Theory and Applications. ADC 2023. Lecture Notes in Computer Science, vol 14386. Springer, Cham. https://doi.org/10.1007/978-3-031-47843-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-47843-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-47842-0
Online ISBN: 978-3-031-47843-7
eBook Packages: Computer ScienceComputer Science (R0)