Abstract
Uncertain data are inherent in various applications, and group nearest neighbor (GNN) query is widely used in many fields. Existing work for answering probabilistic GNN (PGNN) query on uncertain data are inefficient for the irregular shapes of uncertain regions. In this paper, we propose two pruning algorithms for efficiently processing PGNN query which are not sensitive to the shapes of uncertain regions. The spatial pruning algorithm utilizes the centroid point to efficiently filter out objects in consideration of their spatial locations; the probabilistic pruning algorithm derives more tighter bounds by partitioning uncertain objects. Furthermore, we propose a space partitioning structure in order to facilitate the partitioning process. Extensive experiments using both real and synthetic data show that our algorithms are not sensitive to the shapes of uncertain regions, and outperform the existing work by about 2-3 times under various settings.
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
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys (CSUR) 31(3), 264–323 (1999)
Aggarwal, C.C., Yu, P.S.: Outlier detection for high dimensional data. ACM Sigmod Record 30, 37–46 (2001)
Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, p. 301. IEEE Computer Society (2004)
Li, H., Lu, H., Huang, B., Huang, Z.: Two ellipse-based pruning methods for group nearest neighbor queries. In: Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems, pp. 192–199. ACM (2005)
Hashem, T., Kulik, L., Zhang, R.: Privacy preserving group nearest neighbor queries. In: EDBT, pp. 489–500. ACM (2010)
Lian, X., Chen, L.: Probabilistic group nearest neighbor queries in uncertain databases. TKDE 20(6), 809–824 (2008)
Zhu, L., Jing, Y., Sun, W., Mao, D., Liu, P.: Voronoi-based aggregate nearest neighbor query processing in road networks. In: GIS, pp. 518–521. ACM (2010)
Beskales, G., Soliman, M., IIyas, I.: Efficient search for the top-k probable nearest neighbors in uncertain databases. VLDB 1(1), 326–339 (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)
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)
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)
Li, J., Wang, B., Wang, G.: Efficient probabilistic reverse k-nearest neighbors query processing on uncertain data. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013, Part I. LNCS, vol. 7825, pp. 456–471. Springer, Heidelberg (2013)
Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. IEEE Transactions on Knowledge and Data Engineering 25(12), 2767–2779 (2013)
Cheema, M., Lin, X., Wang, W., Zhang, W., Pei, J.: Probabilistic reverse nearest neighbor queries on uncertain data. TKDE 22(4), 550–564 (2010)
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles, vol. 19. ACM (1990)
Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974)
Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. TODS 24(2), 265–318 (1999)
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
Li, J., Wang, B., Wang, G., Bi, X. (2014). Efficient Processing of Probabilistic Group Nearest Neighbor Query on Uncertain Data. 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_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-05810-8_29
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05809-2
Online ISBN: 978-3-319-05810-8
eBook Packages: Computer ScienceComputer Science (R0)