Abstract
For a given query object, Reverse k-Nearest Neighbor queries retrieve those objects that have the query object among their k-nearest neighbors. However, computing the k-nearest neighbor sets for all points in a database is expensive in terms of computational costs. Therefore, specific index structures have been invented to apply pruning heuristics which aim at reducing the search space. At time, the state-of-the-art index structure for enabling fast RkNN query processing in general metric spaces is the MRkNNCoP-Tree which uses linear functions to approximate lower and upper bounds on the k-distances to prune the search space. Storing those linear functions results in additional storage costs in \(\mathcal {O}(n)\) which might be infeasible in situation where storage space is limited, e.g., on mobile devices. In this work, we present a novel index based on the MRkNNCoP-Tree as well as recent developments in the field of neural indexing. By learning a single neural network model that approximates the k-nearest neighbor distance bounds for all points in a database, the storage complexity of the proposed index structure is reduced to \(\mathcal {O}(1)\) while the index is still able to guarantee exact query results. As shown in our experimental evaluations on synthetic and real-world data sets, our approach can significantly reduce the required storage space in trade-off to some growth in terms of refinement sets when relying on exact query processing. We provide our code at www.github.com/mberr/k-distance-prediction.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
As is given in our case since we replace the linear functions serving as bounds for the MRkNNCoP-Tree.
- 2.
Download from https://www.cs.utah.edu/~lifeifei/SpatialDataset.htm.
References
Achtert, E., Böhm, C., Kröger, P., Kunath, P., Pryakhin, A., Renz, M.: Approximate reverse k-nearest neighbor queries in general metric spaces. In: Proceedings of CIKM, pp. 788–789. Citeseer (2006)
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: Proceedings of SIGMOD, SIGMOD 2006, pp. 515–526. ACM, New York (2006). https://doi.org/10.1145/1142473.1142531
Achtert, E., Böhm, C., Kröger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor estimation. Informatik-Forschung und Entwicklung 21(3–4), 179–195 (2007)
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: Proceedings of EDBT, pp. 886–897. ACM (2009)
Borutta, F., Nascimento, M.A., Niedermayer, J., Kröger, P.: Monochromatic RkNN queries in time-dependent road networks. In: Proceedings of SIGSPATIAL MobiGIS, pp. 26–33. ACM (2014)
Borutta, F., Nascimento, M.A., Niedermayer, J., Kröger, P.: Reverse k-nearest neighbour schedules in time-dependent road networks. In: Proceedings of SIGSPATIAL, p. 27. ACM (2015)
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)
Cheema, M.A., Zhang, W., Lin, X., Zhang, Y., Li, X.: Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. VLDB J. 21(1), 69–95 (2012)
Gripon, V., Löwe, M., Vermet, F.: Associative memories to accelerate approximate nearest neighbor search. Appl. Sci. 8(9), 1676 (2018)
Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: Proceedings of ICML (2015)
Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: ACM Sigmod Record, vol. 29, pp. 201–212. ACM (2000)
Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of SIGMOD, pp. 489–504. ACM (2018)
Lian, X., Chen, L.: Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB J. 18(3), 787–808 (2009)
Oosterhuis, H., Culpepper, J.S., de Rijke, M.: The potential of learned index structures for index compression. arXiv preprint arXiv:1811.06678 (2018)
Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825–2830 (2011)
Singh, A., Ferhatosmanoglu, H., Tosun, A.Ş.: High dimensional reverse nearest neighbor queries. In: Proceedings of CIKM, pp. 91–98. ACM (2003)
Stanoi, I., Agrawal, D., El Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: SIGMOD Workshop DMKD, pp. 44–53 (2000)
Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality. In: Proceedings of VLDB, pp. 744–755. VLDB Endowment (2004)
Tao, Y., Yiu, M.L., Mamoulis, N.: Reverse nearest neighbor search in metric spaces. IEEE TKDE 9, 1239–1252 (2006)
Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: 22nd International Conference on Data Engineering (ICDE 2006), p. 77. IEEE (2006)
Xiang, W., Zhang, H., Cui, R., Chu, X., Li, K., Zhou, W.: Pavo: a RNN-based learned inverted index, supervised or unsupervised? IEEE Access 7, 293–303 (2019). https://doi.org/10.1109/ACCESS.2018.2885350
Yang, C., Lin, K.I.: An index structure for efficient reverse nearest neighbor queries. In: Proceedings of ICDE, pp. 485–492. IEEE (2001)
Yu, C., Gripon, V., Jiang, X., Jégou, H.: Neural associative memories as accelerators for binary vector search. In: Proceedings of Cognitive, pp. 85–89 (2015)
Acknowledgements
Parts of this work have been funded by the German Research Foundation (DFG) under grant number AC 242/4-2. This work has been developed in cooperation with the Munich Center for Machine Learning (MCML), funded by the German Federal Ministry of Education and Research (BMBF) under Grant No. 01IS18036A. The authors of this work take full responsibilities for its content.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Berrendorf, M., Borutta, F., Kröger, P. (2019). k-Distance Approximation for Memory-Efficient RkNN Retrieval. In: Amato, G., Gennaro, C., Oria, V., Radovanović , M. (eds) Similarity Search and Applications. SISAP 2019. Lecture Notes in Computer Science(), vol 11807. Springer, Cham. https://doi.org/10.1007/978-3-030-32047-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-32047-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32046-1
Online ISBN: 978-3-030-32047-8
eBook Packages: Computer ScienceComputer Science (R0)