Alternatives and similar repositories for M-Tree:

Users that are interested in M-Tree are comparing it to the libraries listed below

• tburette / mtree
  M-tree datastructure to perform k-NN searches
  ☆26Updated 3 years ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆93Updated 4 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆208Updated 3 years ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆76Updated 4 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆387Updated last year
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  Updated 4 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆93Updated 5 years ago
• karimaechihabi / lernaean-hydra
  This is the Lernaean Hydra Archive (LHA) for Similarity Search.
  ☆22Updated last year
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆113Updated 5 months ago
• Jacyhust / PM-LSH
  The source code for PM-LSH (PVLDB 2020)
  ☆11Updated 4 months ago
• CGCL-codes / DCF
  Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…
  ☆39Updated 7 years ago
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆140Updated this week
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated last month
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 11 months ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆29Updated 10 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• TsinghuaDatabaseGroup / DITA
  Distributed In-Memory Trajectory Analytics
  ☆37Updated 7 years ago
• DNCrane / Cover-Tree
  A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…
  ☆62Updated 7 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• DataOceanLab / GLIN
  A lightweight learned index for spatial range queries on complex geometries
  ☆12Updated 2 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 3 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆9Updated 5 years ago
• ot / succinct
  A collection of succinct data structures
  ☆201Updated last year
• Rhoana / pyrtree
  An R-Tree implementation
  ☆36Updated 2 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago