Alternatives and similar repositories for M-Tree

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

• 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
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• tburette / mtree
  M-tree datastructure to perform k-NN searches
  ☆26Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆23Updated 6 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 8 years ago
• RSIA-LIESMARS-WHU / LSHBOX
  A c++ toolbox of locality-sensitive hashing (LSH), provides several popular LSH algorithms, also support python and matlab.
  ☆288Updated 8 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…
  ☆77Updated 4 years ago
• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆38Updated last year
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆95Updated 5 years ago
• DataOceanLab / GLIN
  A lightweight learned index for spatial range queries on complex geometries
  ☆12Updated 2 years ago
• daravinds / Learned-Index-Structures
  An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures
  ☆14Updated 6 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆148Updated 6 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 9 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 5 months ago
• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆224Updated 3 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆209Updated 4 years ago
• stingergraph / stinger
  The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…
  ☆213Updated 7 months ago
• lijinf2 / gqr
  ☆16Updated 5 years ago
• umr-dbs / xxl
  The eXtensible and fleXible Library XXL for Java
  ☆26Updated 3 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆96Updated 5 years ago