☆17May 6, 2025Updated last year
Alternatives and similar repositories for LIRA-ANN-search
Users that are interested in LIRA-ANN-search are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- [SIGMOD 2026] DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search.☆32Aug 19, 2025Updated last year
- ☆26Aug 30, 2025Updated last year
- A list of papers in the field of approximate nearest neighbor search on high-dimensional vectors.☆141Aug 11, 2026Updated 2 months ago
- ☆11Mar 27, 2025Updated last year
- Ada-ef (SIGMOD '26) — Adaptive efSearch for HNSW-based vector search☆20Jun 19, 2026Updated 4 months ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆66Sep 16, 2024Updated 2 years ago
- ☆10Sep 9, 2025Updated last year
- Official implementation for paper "Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search"☆38Dec 21, 2024Updated last year
- Large Scale Search Index☆32May 3, 2023Updated 3 years ago
- ☆13Jul 31, 2025Updated last year
- A low-latency, billion-scale, and updatable graph-based vector store on SSD.☆15Jul 1, 2025Updated last year
- [SIGIR 25] Stitching Inner Product and Euclidean Metrics for Topology-aware Maximum Inner Product Search☆16Aug 23, 2025Updated last year
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆62Jul 17, 2020Updated 6 years ago
- ☆15Oct 19, 2026Updated 2 weeks ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- ☆18Oct 1, 2026Updated last month
- ☆13Nov 16, 2024Updated last year
- This is the source code of the method proposed in paper: Subspace Collision: An Efficient and Accurate Framework for High-dimensional App…☆30Mar 27, 2026Updated 7 months ago
- ☆17Nov 11, 2025Updated 11 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…☆22May 6, 2026Updated 5 months ago
- ML-aided Query Optimizer☆17May 31, 2024Updated 2 years ago
- ☆36Jan 22, 2025Updated last year
- ☆14Sep 25, 2025Updated last year
- Pytorch implementation of LEON: A New Framework for ML-Aided Query Optimization.☆29Mar 7, 2024Updated 2 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- [SIGMOD'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search☆20Nov 9, 2025Updated 11 months ago
- ☆17Oct 13, 2022Updated 4 years ago
- A benchmark for UDF queries☆14Jun 30, 2026Updated 4 months ago
- 电子科技大学2022级研究生课程《机器学习》,包含课件、实验、小组作业、平时作业和电子书。☆20Mar 3, 2023Updated 3 years ago
- Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++☆30Feb 25, 2017Updated 9 years ago
- ☆13Jan 17, 2024Updated 2 years ago