Author:
Ding Xin,Zhang Yuanliang,Chen Lu,Yang Keyu,Gao Yunjun
Publisher
Springer International Publishing
Reference27 articles.
1. Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Softw. Eng. 9(5), 631–634 (1983)
2. Uhlmann, J.K.: Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett. 40(4), 175–179 (1991)
3. Brin, S.: Near neighbor search in large metric spaces. In: VLDB, pp. 574–584 (1995)
4. Navarro, G.: Searching in metric spaces by spatial approximation. VLDB J. 11(1), 28–46 (2002)
5. Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: VLDB, pp. 426–435 (1997)