m_tree

An implementation of M-trees
README

An implementation of M-trees. M-trees are an index structure for metric data (ie. data for which we can define a distance function). This implementation supports efficient incremental insertion and range queries.

References

Ciaccia, P., Patella, M., & Zezula, P. (1997, August). M-tree: An efficient access method for similarity search in metric spaces. In Vldb (Vol. 97, pp. 426-435).

Install
Authors
Maintainers
Sources
m_tree-0.1.tbz
sha256=21afe9d04e0fb539a1fff94efdce893e1763ae8f9807c757b40e315d38292d66
sha512=e778037047e3f8a3e53c8799fdf9d270149305d70b24d1dd6a5c76081a2b69698b43ecbc04073a5f78da9855b13c7376076fd1e468153579fe400b0860ec6c5e
Dependencies
odoc
with-doc
ppx_assert
with-test & >= "v0.14"
ppx_compare
with-test & >= "v0.14"
ppx_sexp_conv
with-test & >= "v0.14"
ppx_sexp_message
with-test & >= "v0.14"
ppx_expect
with-test & >= "v0.14"
core_bench
with-test & >= "v0.14"
core
with-test & >= "v0.14"
iter
>= "1.4"
dune
>= "3.0"
ocaml
>= "4.12"
Reverse Dependencies