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
• karimaechihabi / lernaean-hydra
  This is the Lernaean Hydra Archive (LHA) for Similarity Search.
  ☆24Updated last year
• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆37Updated 10 months ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆158Updated 7 years ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆90Updated 4 years ago
• DataOceanLab / GLIN
  A lightweight learned index for spatial range queries on complex geometries
  ☆12Updated 2 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆205Updated 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
• pfl-cs / LISA
  ☆39Updated 3 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• gvinciguerra / Learned-indexes-effectiveness
  Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"
  ☆19Updated 3 years ago
• Chriszblong / MCF-FM
  An Effective Fleet Management Strategy for Collaborative Spatio-Temporal Searching (GIS Cup)
  ☆14Updated 4 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆29Updated 9 years ago
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 7 years ago
• karan1149 / DeepBloom
  An implementation of learned index structures for bloom filters.
  ☆23Updated 6 years ago
• Rhoana / pyrtree
  An R-Tree implementation
  ☆37Updated 2 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 7 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆82Updated 11 years ago
• DominikHorn / hashing-benchmark
  benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission
  ☆16Updated last year
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆92Updated 5 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆152Updated 10 months ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆178Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆173Updated 8 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• Jacyhust / PM-LSH
  The source code for PM-LSH (PVLDB 2020)
  ☆11Updated 2 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 / pbbslib
  ☆25Updated 4 years ago