Abstract
Ranking-aware query is one of the most fundamental queries in the database management field. The ranking query that returns top-k elements with maximal ranking scores according to a ranking function has been widely studied for decades. Recently, some researchers also focus on finding all customers who treat the given query object one of their top-k favorite elements, namely reverse top-k query. In such applications, each customer is described as a vector. However, none of the existing work has considered the uncertain data case for reverse top-k query, which is our focus. In this paper, we propose two methods to handle probabilistic reverse top-k query, namely BLS and ALS. As a basic solution, BLS approach checks each pair of user and product to find the query result. While as an advanced solution, ALS approach uses two pruning rules and historical information to significantly improve the efficiency. Both detailed analysis and experiments upon real and synthetic data sets illustrate the efficiency of our proposed methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nepal, S., Ramakrishna, M.V.: Query processing issues in image (multimedia) databases. In: Proc. of ICDE (1999)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Nørvåg, K.: Reverse top-k queries. In: ICDE, pp. 365–376 (2010)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Nørvåg, K.: Monochromatic and bichromatic reverse top-k queries. IEEE Trans. Knowl. Data Eng. 23(8), 1215–1229 (2011)
Vlachou, A., Doulkeridis, C., Nørvåg, K.: Monitoring reverse top-k queries over mobile devices. In: Proc. of MobiDE (2011)
Vlachou, A., Doulkeridis, C., Nørvåg, K., Kotidis, Y.: Identifying the most influential data objects with reverse top-k queries. PVLDB 3(1), 364–372 (2010)
Aggarwal, C.C.: Managing and mining uncertain data. Springer (2009)
Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: Proc. of ICDE (2007)
Hua, M., Pei, J., Zhang, W., Lin, X.: Ranking queries on uncertain data: A probabilistic threshold approach. In: Proc. of ACM SIGMOD (2008)
Zhang, X., Chomicki, J.: On the semantics and evaluation of top-k queries in probabilistic databases. In: Proc. of DBRank (2008)
Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: Proc. of ICDE (2009)
Soliman, M.A., Ilyas, I.F.: Ranking with uncertain scores. In: Proc. of ICDE (2009)
Ge, T., Zdonik, S., Madden, S.: Top-k queries on uncertain data: on score distribution and typical answers. In: Proc. of SIGMOD (2009)
Li, J., Saha, B., Deshpande, A.: A unified approach to ranking in probabilistic databases. In: Proc. of VLDB (2009)
Yan, D., Ng, W.: Robust ranking of uncertain data. In: Proc. of DASFAA (2011)
Jin, C., Yi, K., Chen, L., Yu, J.X., Lin, X.: Sliding-window top-k queries on uncertain streams. Proc. of the VLDB Endowment 1(1), 301–312 (2008)
Li, C.: Enabling data retrieval: by ranking and beyond. PhD thesis, University of Illinois at Urbana-Champaign (2007)
Lee, K.C.K., Ye, M., Lee, W.-C.: Reverse ranking query over imprecise spatial data. In: COM.Geo (2010)
Lian, X., Chen, L.: Probabilistic inverse ranking queries in uncertain databases. VLDB J. 20(1), 107–127 (2011)
Börzsöddotonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. of ICDE (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jin, C., Zhang, R., Kang, Q., Zhang, Z., Zhou, A. (2014). 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. DASFAA 2014. Lecture Notes in Computer Science, vol 8421. Springer, Cham. https://doi.org/10.1007/978-3-319-05810-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-05810-8_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05809-2
Online ISBN: 978-3-319-05810-8
eBook Packages: Computer ScienceComputer Science (R0)