Abstract
A reverse k-nearest neighbors (RkNN) query returns all the objects that take the query object q as their k nearest neighbors. However, data are often uncertain in numerous applications. In this paper, we focus on the problem of processing RkNN on uncertain data. A probabilistic RkNN (PRkNN) query retrieves all the objects that have higher probabilities than a user-specified threshold to be the RkNN of q. The previous work for answering PRNN query are mainly based on the distance relationship between uncertain objects, and are inapplicable for PRkNN when k > 1. In this paper, we design a novel algorithm for PRkNN query to support arbitrary values of k on the basis of two pruning strategies, namely spatial pruning and probabilistic pruning. The spatial pruning rule is defined on both the distances and the angle ranges between uncertain objects. And an efficient upper bound of probability is estimated by the probabilistic pruning algorithm. Extensive experiments are conducted to study the performance of the proposed approach. The results show that our proposed algorithm has a better performance and scalability than the existing solution regarding the growth of k.
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
Preview
Unable to display preview. Download preview PDF.
References
Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201–212. ACM (2000)
Stanoi, I., Riedewald, M., Agrawal, D., El Abbadi, A.: Discovery of influence sets in frequently updated databases. In: VLDB, pp. 99–108 (2001)
Tao, Y., Papadias, D., Lian, X.: Reverse knn search in arbitrary dimensionality. In: VLDB, pp. 744–755. VLDB Endowment (2004)
Lian, X., Chen, L.: Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. The VLDB Journal 18(3), 787–808 (2009)
Cheema, M., Lin, X., Wang, W., Zhang, W., Pei, J.: Probabilistic reverse nearest neighbor queries on uncertain data. TKDE 22(4), 550–564 (2010)
Bernecker, T., Emrich, T., Kriegel, H., Renz, M., Zankl, S., Züfle, A.: Efficient probabilistic reverse nearest neighbor query processing on uncertain data. VLDB 4(10), 669–680 (2011)
Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: SIGMOD, pp. 634–645. ACM (2005)
Beskales, G., Soliman, M., IIyas, I.: Efficient search for the top-k probable nearest neighbors in uncertain databases. VLDB 1(1), 326–339 (2008)
Tong, Y., Chen, L., Ding, B.: Discovering threshold-based frequent closed itemsets over probabilistic data. In: ICDE, pp. 270–281. IEEE (2012)
Tong, Y., Chen, L., Cheng, Y., Yu, P.: Mining frequent itemsets over uncertain databases. In: VLDB, pp. 1650–1661 (2012)
Yang, C., Lin, K.: An index structure for efficient reverse nearest neighbor queries. In: ICDE, pp. 485–492. IEEE (2001)
Stanoi, I., Agrawal, D., Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: SIGMOD, pp. 44–53 (2000)
Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: ICDE, p. 77. IEEE (2006)
Wu, W., Yang, F., Chan, C., Tan, K.: Continuous reverse k-nearest-neighbor monitoring. In: MDM, pp. 132–139. IEEE (2008)
Cheng, R., Chen, J., Mokbel, M., Chow, C.: Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In: ICDE, pp. 973–982. IEEE (2008)
Hua, M., Pei, J., Zhang, W., Lin, X.: Ranking queries on uncertain data: A probabilistic threshold approach. In: SIGMOD, pp. 673–686. ACM (2008)
Widom, J.: Trio: A system for integrated management of data, accuracy, and lineage. Technical Report (2004)
Kriegel, H.-P., Kunath, P., Renz, M.: Probabilistic nearest-neighbor query on uncertain objects. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 337–348. Springer, Heidelberg (2007)
Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: VLDB, pp. 15–26. VLDB Endowment (2007)
Soliman, M., Ilyas, I., Chen-Chuan Chang, K.: Top-k query processing in uncertain databases. In: ICDE, pp. 896–905. IEEE (2007)
Emrich, T., Kriegel, H., Kröger, P., Renz, M., Züfle, A.: Boosting spatial pruning: on optimal pruning of mbrs. In: SIGMOD, pp. 39–50. ACM (2010)
Cheng, R., Chen, L., Chen, J., Xie, X.: Evaluating probability threshold k-nearest-neighbor queries over uncertain data. In: EDBT, pp. 672–683. ACM (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Wang, B., Wang, G. (2013). Efficient Probabilistic Reverse k-Nearest Neighbors Query Processing on Uncertain Data. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds) Database Systems for Advanced Applications. DASFAA 2013. Lecture Notes in Computer Science, vol 7825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37487-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-37487-6_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37486-9
Online ISBN: 978-3-642-37487-6
eBook Packages: Computer ScienceComputer Science (R0)