Alternatives and similar repositories for M-Tree

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

• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆23Updated 6 years ago
• tburette / mtree
  M-tree datastructure to perform k-NN searches
  ☆26Updated 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…
  ☆214Updated last year
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆78Updated 5 years ago
• mloskot / spatial_index_benchmark
  Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…
  ☆49Updated 6 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆51Updated 3 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• amorten / openlis
  Python package that implements Learned Index Structures and provides database-like interface
  ☆18Updated 7 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆160Updated 8 years ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆95Updated 5 years ago
• karan1149 / DeepBloom
  An implementation of learned index structures for bloom filters.
  ☆23Updated 7 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆88Updated 8 years ago
• flashxio / FlashX
  FlashX is a collection of big data analytics tools that perform data analytics in the form of graphs and matrices.
  ☆238Updated 5 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 11 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 8 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 6 years ago
• DataOceanLab / GLIN
  A lightweight learned index for spatial range queries on complex geometries
  ☆14Updated 3 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆115Updated 9 months ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆144Updated 8 years ago
• umr-dbs / xxl
  The eXtensible and fleXible Library XXL for Java
  ☆26Updated 3 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• alabid / countminsketch
  Implementation of Count Min Sketch in C++
  ☆57Updated 6 years ago
• kwonoh / glam
  GLAM: Graph Layout Aesthetic Metrics
  ☆39Updated last year
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 7 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆300Updated 3 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆104Updated 5 months ago
• qcri / Arabesque
  Scalable Graph Mining
  ☆63Updated 3 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 10 years ago