A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of your ANN indexes.
☆21May 6, 2026Updated 4 months ago
Alternatives and similar repositories for Steiner-hardness
Users that are interested in Steiner-hardness 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'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search☆20Nov 9, 2025Updated 10 months ago
- Ada-ef (SIGMOD '26) — Adaptive efSearch for HNSW-based vector search☆19Jun 19, 2026Updated 3 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…☆193Jul 2, 2026Updated 2 months ago
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆63Sep 16, 2024Updated 2 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆62Jul 17, 2020Updated 6 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.
- 📚 Awesome papers and technical blogs on vector DB (database), semantic-based vector search or approximate nearest neighbor search (ANN S…☆117Dec 2, 2025Updated 9 months ago
- SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search☆43Mar 3, 2025Updated last year
- ☆24Apr 4, 2024Updated 2 years ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆29Updated this week
- Public repository for CleANN, an efficient fully-dynamic approximate nearest neighbor search index☆18Sep 18, 2025Updated last year
- [SIGMOD2026] Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search with Task-Centric Benchmarks☆27Dec 31, 2025Updated 8 months ago
- Learning-based Approximate k-NN Search in Graph Databases☆11Nov 29, 2021Updated 4 years ago
- [ICDE 2024] VDTuner - Automated Performance Tuning for Vector Data Management Systems (Vector Databases)☆34Apr 21, 2024Updated 2 years ago
- ☆85Sep 4, 2024Updated 2 years 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.
- ☆35Jan 22, 2025Updated last year
- Dumpy: A Compact and Adaptive Index for Large Data Series Collections (SIGMOD'23)☆13Dec 12, 2023Updated 2 years ago
- [VLDB 25] Maximum Inner Product is Query-Scaled Nearest Neighbor☆42Oct 31, 2025Updated 10 months ago
- This is a source code for LSH-APG (PVLDB 2023)☆33Aug 21, 2024Updated 2 years ago
- 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 6 months ago
- Segmented Code Adjustment Quantization (SAQ)☆27Sep 22, 2025Updated last year
- 🏆 Winning NeurIPS (NIPS) Competition Track: Big ANN, Practical Vector Search Challenge 2023. （see big-ann-benchmark https://big-ann-benc…☆30Aug 16, 2024Updated 2 years ago
- Memory-Bounded GPU Acceleration for Vector Search☆33Dec 29, 2025Updated 8 months ago
- A list of papers in the field of approximate nearest neighbor search on high-dimensional vectors.☆141Aug 11, 2026Updated last month
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Benchmark for filtered ANN search applications☆29Apr 28, 2026Updated 4 months ago
- [SIGMOD 2026] DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search.☆31Aug 19, 2025Updated last year
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆65Jan 22, 2025Updated last year
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆22Feb 6, 2020Updated 6 years ago
- ☆20Jun 23, 2024Updated 2 years ago
- This is the source code of the method: DET-LSH (accepted by PVLDB 2024) and PDET-LSH (accepted by TKDE 2026).☆25Jul 29, 2026Updated last month
- state-of-the-art search over vector embeddings and structured data (SIGMOD '24)☆119Mar 6, 2025Updated last year
- Code repository for the paper - "AdANNS: A Framework for Adaptive Semantic Search"☆69Oct 10, 2023Updated 2 years ago
- Repository for SIEVE: Effective Filtered Vector Search with Collection of Indexes VLDB '25 submission☆17Jul 30, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Collection of datasets for benchmarking filtered vector similarity retrieval☆64Aug 8, 2026Updated last month
- GPU-accelerated vector query processing system that supports large vector datasets beyond GPU memory.☆41Mar 24, 2024Updated 2 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- ⚡ PDX: A Library for Fast Vector Search and Indexing on CPUs (x86, ARM) — for Python and C++. Index millions of vectors in seconds. Searc…☆97Updated this week
- ⚡ Super fast clustering for high-dimensional vectors on CPUs (x86, ARM) and GPUs — for Python and C++. Faster clustering of vector embedd…☆86Updated this week
- ☆15Apr 19, 2026Updated 5 months ago
- ☆16May 6, 2025Updated last year