Alternatives and similar repositories for M-Tree

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

• 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
• stingergraph / stinger
  The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…
  ☆212Updated 6 months ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆95Updated 5 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆23Updated 5 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆113Updated 2 months ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆31Updated 11 months ago
• kwonoh / glam
  GLAM: Graph Layout Aesthetic Metrics
  ☆39Updated last year
• DataOceanLab / GLIN
  A lightweight learned index for spatial range queries on complex geometries
  ☆12Updated 2 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• schroederdewitt / leapfrog-triejoin
  High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)
  ☆21Updated 9 years 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
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• qcri / Arabesque
  Scalable Graph Mining
  ☆62Updated 2 years ago
• GraphChi / graphchi-cpp
  GraphChi's C++ version. Big Data - small machine.
  ☆808Updated 6 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• flashxio / FlashX
  FlashX is a collection of big data analytics tools that perform data analytics in the form of graphs and matrices.
  ☆233Updated 5 years ago
• joluet / okde-java
  A Java implementation of online kernel density estimation (oKDE)
  ☆32Updated 7 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
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆208Updated 4 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 4 months ago
• sslab-gatech / mosaic
  ☆82Updated 7 years ago
• karimaechihabi / lernaean-hydra
  This is the Lernaean Hydra Archive (LHA) for Similarity Search.
  ☆22Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆17Updated 4 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆139Updated 8 years ago