whenever5225 / TOGG
Two-stage routing with Optimized Guided search and Greedy algorithm
☆10Updated last year
Alternatives and similar repositories for TOGG:
Users that are interested in TOGG are comparing it to the libraries listed below
- ☆13Updated last year
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆18Updated 4 years ago
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆17Updated 5 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆49Updated 4 years ago
- Learning-based Approximate k-NN Search in Graph Databases☆10Updated 3 years ago
- Algorithms for approximate nearest neighbor search with window filters☆36Updated last year
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- ☆21Updated 10 months ago
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search☆25Updated 2 months ago
- ☆15Updated 2 years ago
- ☆16Updated 2 months ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆67Updated 2 years ago
- This is a source code for LSH-APG (PVLDB 2023)☆28Updated 5 months ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆132Updated last week
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆28Updated 3 years ago
- ☆21Updated this week
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆50Updated 3 weeks ago
- Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)☆17Updated 3 years ago
- Version of PBBS Benchmarks for VLDB 2024 Reviewers☆9Updated last year
- LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)☆15Updated 3 years ago
- ☆51Updated 5 months ago
- A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of yo…☆13Updated last week
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆14Updated 3 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 3 months ago
- Reducing Dimensionality method for Nearest Neighbor Search☆14Updated 4 years ago
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search☆66Updated 3 years ago
- ☆141Updated this week
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆69Updated 3 weeks ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆20Updated last month