erdavila / M-TreeLinks
A data structure for efficient nearest-neighbor queries.
☆72Updated last year
Alternatives and similar repositories for M-Tree
Users that are interested in M-Tree are comparing it to the libraries listed below
Sorting:
- M-tree datastructure to perform k-NN searches☆26Updated 3 years ago
- A lightweight learned index for spatial range queries on complex geometries☆12Updated 2 years ago
- A Recursive Spatial Model Index☆38Updated last year
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆93Updated 4 years ago
- 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
- The recursive model index, a learned index structure☆221Updated 3 years ago
- Naive Hilbert R-Tree implementation☆29Updated 10 years ago
- A C++ library for summarizing data streams☆24Updated 5 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated 2 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆94Updated 5 years ago
- WebGraph framework with extensions☆23Updated 10 years ago
- An R-Tree implementation☆37Updated 3 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Templated Portable I/O Environment☆113Updated last month
- An implementation of learned index structures for bloom filters.☆23Updated 6 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆19Updated 4 years ago
- ☆51Updated 6 months ago
- This is the Lernaean Hydra Archive (LHA) for Similarity Search.☆22Updated last year
- Comparison of graph processing systems.☆23Updated 7 years ago
- Python package that implements Learned Index Structures and provides database-like interface☆18Updated 7 years ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆147Updated 6 years ago
- Implementation of Count Min Sketch in C++☆56Updated 5 years ago
- A relatively simple implementation of the R* Tree data structure for C++☆50Updated 2 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- HOT - Height Optimized Trie☆151Updated 7 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html☆141Updated 4 years ago