The similarity search has become a fundamental computational task in many applications. One of the mathematical models of the similarity - the metric space - has drawn attention of many researchers resulting in several sophisticated metric-indexing techniques. An important part of a research in this area is typically a prototype implementation and subsequent experimental evaluation of the proposed data structure. This paper describes an implementation framework called MESSIF that eases the task of building such prototypes. It provides a number of modules from basic storage management, over a wide support for distributed processing, to automatic collecting of performance statistics. Due to its open and modular design it is also easy to implement additional modules, if necessary. The MESSIF also offers several readyto-use generic clients that allow to control and test the index structures. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Batko, M., Novak, D., & Zezula, P. (2007). MESSIF: Metric similarity search implementation framework. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4877 LNCS, pp. 1–10). Springer Verlag. https://doi.org/10.1007/978-3-540-77088-6_1
Mendeley helps you to discover research relevant for your work.