1. Lecture Notes in Computer Science;K. Beyer,1998
2. Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: ICML 2006: Proc. 23rd Intern. Conf. on Machine Learning, pp. 97–104 (2006)
3. Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)
4. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. 23rd Intern. Conf. on Very Large Data Bases, VLDB 1997, pp. 426–435 (1997)
5. Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999: Proc. 25th Intern. Conf. on Very Large Data Bases, pp. 518–529 (1999)