Abstract
This paper explores different heuristics to estimate the selectivity of a reverse k-nearest neighbor query. The proposed methods approximate the number of results for a given RkNN query, providing a key ingredient of common (relational) query optimizers. A range of experiments evaluate the quality of these estimates compared to the true number of results on both real and synthetic data, analyzing the potentials of the proposed approximations to make accurate predictions that can be used to generate efficient query execution plans.
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
Emrich, T., Kriegel, H.P., Kröger, P., Niedermayer, J., Renz, M., Züfle, A.: Reverse-k-nearest-neighbor join processing. In: Proc. SSTD, pp. 277–294 (2013)
Korn, F., Muthukrishnan, S.: Influenced sets based on reverse nearest neighbor queries. In: Proc. SIGMOD, pp. 201–212 (2000)
Yang, C., Lin, K.I.: An index structure for efficient reverse nearest neighbor queries. In: Proc. ICDE, pp. 485–492 (2001)
Achtert, E., Böhm, C., Kröger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: Proc. SIGMOD, pp. 515–526 (2006)
Tao, Y., Yiu, M.L., Mamoulis, N.: Reverse nearest neighbor search in metric spaces. IEEE TKDE 18(9), 1239–1252 (2006)
Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality. In: Proc. VLDB, pp. 744–755 (2004)
Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: Proc. DMKD, pp. 44–53 (2000)
Singh, A., Ferhatosmanoglu, H., Tosun, A.S.: High dimensional reverse nearest neighbor queries. In: Proc. CIKM, pp. 91–98 (2003)
Cheema, M.A., Lin, X., Zhang, W., Zhang, Y.: Influence zone: Efficiently processing reverse k nearest neighbors queries. In: Proc. ICDE (2011)
Xia, C., Hsu, W., Lee, M.L.: ERkNN: Efficient reverse k-nearest neighbors retrieval with local kNN-distance estimation. In: Proc. CIKM, pp. 533–540 (2005)
Cheema, M.A., Lin, X., Wang, W., Zhang, W., Pei, J.: Probabilistic reverse nearest neighbor queries on uncertain data. IEEE TKDE 22(4), 550–564 (2010)
Bernecker, T., Emrich, T., Kriegel, H.P., Renz, M., Zankl, S., Züfle, A.: Efficient probabilistic reverse nearest neighbor query processing on uncertain data. In: Proc. VLDB, pp. 669–680 (2011)
Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: Proc. VLDB, pp. 814–825 (2002)
Xia, C., Hsu, W., Lee, M.L., Ooi, B.C.: Border: Efficient computation of boundary points. IEEE TKDE 18(2), 289–303 (2006)
Lipton, R., Naughton, J., Schneider, D.: Practical selectivity estimation through adaptive sampling. In: Proc. SIGMOD (1990)
Hou, W.C., Ozsoyoglu, G., Dodgu, E.: Error-constrained count query: Evaluation in relational databases. In: Proc. SIGMOD (1991)
Poosala, V., Ioannidis, Y.E.: Selectivity estimation without the attribute value independence assumption. In: Proc. VLDB (1997)
Bruno, N., Chaudhuri, S., Gravan, L.: Stholes: A multidimensional workload-aware histogram. In: Proc. SIGMOD (2001)
Chen, C.M., Roussopoulos, N.: Adaptive selectivity estimation using query feedback. In: Proc. SIGMOD (1994)
Singh, A., Ferhatosmanoglu, H., Tosun, A.S.: High dimensional reverse nearest neighbor queries. In: Proc. CIKM, pp. 91–98 (2003)
Achtert, E., Kriegel, H.P., Kröger, P., Renz, M., Züfle, A.: Reverse k-nearest neighbor search in dynamic and general metric databases. In: Proc. EDBT, pp. 886–897 (2009)
Emrich, T., Kriegel, H.P., Kröger, P., Renz, M., Züfle, A.: Boosting spatial pruning: On optimal pruning of MBRs. In: Proc. SIGMOD, pp. 39–50 (2010)
Chávez, E., Navarro, G., Baeza-Yates, R.A., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. VLDB, pp. 426–435 (1997)
Conway, J., Sloane, N., Bannai, E.: Sphere Packings, Lattices and Groups. Grundlehren der mathematischen Wissenschaften. Springer (1999)
Houle, M.E., Kriegel, H.-P., Kröger, P., Schubert, E., Zimek, A.: Can shared-neighbor distances defeat the curse of dimensionality? In: Gertz, M., Ludäscher, B. (eds.) SSDBM 2010. LNCS, vol. 6187, pp. 482–500. Springer, Heidelberg (2010)
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
Steinke, M., Niedermayer, J., Kröger, P. (2014). Selectivity Estimation of Reverse k-Nearest Neighbor 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 8422. Springer, Cham. https://doi.org/10.1007/978-3-319-05813-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-05813-9_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05812-2
Online ISBN: 978-3-319-05813-9
eBook Packages: Computer ScienceComputer Science (R0)