References
- N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles," In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.322-331, 1990.
- P. Ciaccia, M. Patella, and P. Zezula, "M-tree: An Efficient Access Method for Similarity Search in Metric Spaces," In Proc Int'l. Conf. on Very Large Data Bases, VLDB, pp.426-435, 1997.
- R. Weber, H. J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for Similarity- Search Methods in High-Dimensional Spaces," In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.194-205, 1998.
- T. Seidl and H.-P. Kriegel, "Efficient Useradaptable Similarity Search in Large Multimedia Databases," In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.506-515, Aug. 1997.
- S. Jeong, S.-W. Kim, K. Kim, and B.-U. Choi, "An Effective Method for Approximating the Euclidean Distance in High-Dimensional Space," In Proc. Int'l. Conf. on Database and Expert Systems Applications, pp.863-872, 2006.
- S. Jeong, S.-W. Kim, and B.-U. Choi, "Dimensionality Reduction for Similarity Search with the Euclidean Distance in High-Dimensional Application," In Multimedia Tools and Applications, vol.42, no. 2, pp.251-271, 2009. https://doi.org/10.1007/s11042-008-0243-y