erdavila / M-Tree
A data structure for efficient nearest-neighbor queries.
☆71Updated 6 months ago
Related projects ⓘ
Alternatives and complementary repositories for M-Tree
- M-tree datastructure to perform k-NN searches☆26Updated 3 years ago
- Benchmark of Nearest Neighbor Search on High Dimensional Data☆204Updated 3 years ago
- A Recursive Spatial Model Index☆38Updated 8 months ago
- A lightweight learned index for spatial range queries on complex geometries☆12Updated 2 years ago
- This is the Lernaean Hydra Archive (LHA) for Similarity Search.☆23Updated last year
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 9 years ago
- A C++ library for summarizing data streams☆24Updated 5 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 9 years ago
- Naive Hilbert R-Tree implementation☆30Updated 9 years ago
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆90Updated 4 years ago
- A locality-sensitive hashing library☆45Updated 10 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆20Updated 3 years ago
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆46Updated 5 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆14Updated 7 months ago
- A relatively simple implementation of the R* Tree data structure for C++☆48Updated last year
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- An R-Tree implementation☆38Updated 2 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆15Updated 5 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- A scalable bottom-up approach for building data series indexes☆14Updated 3 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆38Updated 9 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆92Updated 4 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆210Updated last week
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆16Updated last year
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search☆62Updated 3 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 6 years ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆26Updated 3 years ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆45Updated 5 months ago