The M-Index is an indexing structure for both precise and approximate similarity search in general metric spaces. This Java implementation of the index is used in most of our demos and in all papers about the M-Index:
- David Novak, Michal Batko, Pavel Zezula. (2011). Metric Index: An Efficient and Scalable Solution for Precise and Approximate Similarity Search. Information Systems, 36(4), 721–733. DOI:10.1016/j.is.2010.10.002
- David Novak, Michal Batko, Pavel Zezula. (2012). Large-scale similarity data management with distributed Metric Index. Information Processing & Management, 48(5), 855–872. DOI:10.1016/j.ipm.2010.12.004
- David Novak, Michal Batko. Metric Index: An Efficient and Scalable Solution for Similarity Search. In ”Proceedings of the 2009 Second International Workshop on Similarity Search and Applications”. Washington, DC, USA : IEEE Computer Society. 9 s, 2009. DOI:10.1109/SISAP.2009.26
If you use this library for academic purposes, please, refer M-Index publications.
The package is a Java Maven project containing both centralized M-Index and its distributed version (restricted functionality).
The owner of the result is Masaryk University, a public high school, ID: 00216224. Masaryk University allows other companies and individuals to use this software free of charge and without territorial restrictions under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. M-Index library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with M-Index library. If not, see http://www.gnu.org/licenses/.