Author:
Kapopoulos Dimitris G.,Hatzopoulos Michael
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Boehm C., Berchtold S. and Keim D.A.: “Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Data-bases”, ACM Computing Surveys, Vol.33, No.3, pp. 322–373, 2001.
2. Ciaccia P., Patella M. and Zezula P.: “M-tree: an Efficient Access Method for Similarity Search in Metric Spaces”, Proceedings 23rd VLDB Conference, pp. 426–435, 1997.
3. Dandamundi S. and Sorenson P.: “An empirical performance comparison of some variations of the k-d-tree and BD-tree”, International Journal of Computer and Information Sciences, Vol.14, pp. 135–159, 1985.
4. Dandamundi S. and Sorenson P.: “Algorithms for BD-trees”, Software Practice and Experience, Vol. 16, No.12, pp. 1077–1096, 1986.
5. Faloutsos C.: “Searching Multimedia Databases by Content”, Kluwer, Boston, 1996.