X. L. Chen and Y. Gao, Efficient metric indexing for similarity search and similarity joins, IEEE Transactions on Knowledge and Data Engineering, vol.29, issue.1, pp.556-571, 2017.

R. L. Andr and . Gonzaga, A new division operator to handle complex objects in very large relational datasets, EDBT, 2017.

W. Y. Wan-yuchai and L. Xiabi, Cd-tree: A clustering-based dynamic indexing and retrieval approach, Intelligent Data Analysis, vol.21, p.3, 2017.

K. Zineddine and J. Martinez, A new intersection tree for contentbased image retrieval, 10th International Workshop on Content-Based Multimedia Indexing, CBMI 2012, vol.3, p.6, 2012.

P. Ciaccia, M. Patella, and P. Zezula, M-tree: An efficient access method for similarity search in metric spaces, Proceedings of the 23rd VLDB International Conference, vol.2, p.6, 1997.

R. D. Almeida and E. Valle, Dahc-tree: An effective index for approximate search in high-dimensional metric spaces, Journal of Information and Data Management, vol.1, issue.3, p.375390, 2002.

A. J. Venturini-pola, C. T. Traina, D. Dos-santos, and . Kaster, Improving metric access methods with bucket files, Similarity Search and Applications-8th International Conference, p.7, 2006.

B. C. Ooi, Spatial kd-Tree: A Data Structure for Geographic Database, pp.247-258, 1987.

W. A. Burkhard and R. M. Keller, Some approaches to best-match file searching, Communications of the ACM, vol.16, issue.4, pp.230-236, 1973.

P. N. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, proceedings of the 4th Annual In ACM-SIAM Symposium on Discrete Algorithms, pp.311-321, 1993.

F. Nielsen, Bregman vantage point trees for efficient nearest neighbor queries, Proceedings of Multimedia and Exp (ICME, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00481723

A. W. -c.-p.-m.-s and Y. C. Fu, Dynamic vp-tree indexing for nnearest neighbor search given pair-wise distances, The VLDB Journal Very Large Data Bases, 2012.

R. R. Curtin, Faster dual-tree traversal for nearest neighbor search, Similarity Search and Applications-8th International Conference, 2015.

D. Arroyuelo, A dynamic pivoting algorithm based on spatial approximation indexes, Similarity Search and Applications-7th International Conference, 2014.

R. Pagh, F. Silvestri, J. Sivertsen, and M. Skala, Approximate furthest neighbor in high dimensions, Similarity Search and Applications-8th International Conference, 2015.

J. K. Ulhmann, Satisfying general proximity/similarity queries with metric trees, Information Processing Letters, vol.40, issue.3, pp.175-179, 1991.

C. C. Carélo, I. R. Pola, R. R. Ciferri, A. J. Traina, C. T. et al., Slicing the metric space to provide quick indexing of complex data in the main memory, Inf. Syst, vol.36, issue.6, pp.79-98, 2011.