[VLDB 25] Maximum Inner Product is Query-Scaled Nearest Neighbor
☆40Oct 31, 2025Updated 8 months ago
Alternatives and similar repositories for PSP
Users that are interested in PSP are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- [SIGIR 25] Stitching Inner Product and Euclidean Metrics for Topology-aware Maximum Inner Product Search☆16Aug 23, 2025Updated 11 months ago
- [SIGMOD2026] Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search with Task-Centric Benchmarks☆27Dec 31, 2025Updated 6 months ago
- [SIGMOD'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search☆19Nov 9, 2025Updated 8 months ago
- ☆13Jan 1, 2024Updated 2 years ago
- Segmented Code Adjustment Quantization (SAQ)☆26Sep 22, 2025Updated 10 months ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- ☆33Jan 22, 2025Updated last year
- Public repository for CleANN, an efficient fully-dynamic approximate nearest neighbor search index☆16Sep 18, 2025Updated 10 months ago
- Learning-based Approximate k-NN Search in Graph Databases☆11Nov 29, 2021Updated 4 years ago
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆62Sep 16, 2024Updated last year
- Repository for SIEVE: Effective Filtered Vector Search with Collection of Indexes VLDB '25 submission☆17Jul 30, 2025Updated 11 months ago
- ☆17Mar 13, 2026Updated 4 months ago
- Ada-ef (SIGMOD '26) — Adaptive efSearch for HNSW-based vector search☆19Jun 19, 2026Updated last month
- SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search☆43Mar 3, 2025Updated last year
- An Experimental Evaluation of the State-of-the-Art Graph-Based Vector Search Methods and Techniques☆23Jun 3, 2025Updated last year
- 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.
- ☆34Sep 13, 2025Updated 10 months ago
- Algorithms for approximate nearest neighbor search with window filters☆46Feb 5, 2024Updated 2 years ago
- ☆86Sep 4, 2024Updated last year
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆62Jul 17, 2020Updated 6 years ago
- Memory-Bounded GPU Acceleration for Vector Search☆33Dec 29, 2025Updated 6 months ago
- code for satellite system graphs☆124Nov 26, 2023Updated 2 years ago
- High-Ratio Vector Quantization☆15Feb 3, 2026Updated 5 months ago
- An interactive Multi-modal Query Answering system, powered by MUST and latest LLMs☆30Sep 1, 2024Updated last year
- ☆14Apr 19, 2026Updated 3 months ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- The repo has been moved to https://github.com/VectorDB-NTU/RaBitQ-Library. [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with…☆252Apr 22, 2026Updated 3 months ago
- ⚡ PDX: A Library for Fast Vector Search and Indexing on CPUs (x86, ARM) — for Python and C++. Index millions of vectors in seconds. Searc…☆95Mar 6, 2026Updated 4 months ago
- cuVS - a library for vector search and clustering on the GPU. The IVF RaBitQ is under the cuvs_ivf_rabitq branch.☆19Updated this week
- Implementation of "RaanA: A Fast, Flexible, and Data-Efficient Post-Training Quantization Algorithm"☆17Apr 11, 2025Updated last year
- ☆234Updated this week
- ⚡ Super fast clustering for high-dimensional vectors on CPUs (x86, ARM) and GPUs — for Python and C++. 100x faster clustering of vector e…☆68Updated this week
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆105Sep 2, 2025Updated 10 months ago
- An official lightweight library for the RaBitQ algorithm and its applications in vector search.☆240Updated this week
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆191Jul 2, 2026Updated 3 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.
- A low-latency, billion-scale, and updatable graph-based vector store on SSD.☆145Updated this week
- Source code of our paper for our paper: Accelerating Biclique Counting on GPU☆15Mar 5, 2024Updated 2 years ago
- [SIGMOD 2026] DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search.☆28Aug 19, 2025Updated 11 months ago
- ☆36May 31, 2026Updated last month
- Framework for evaluating ANNS algorithms on billion scale datasets.☆444Jul 13, 2026Updated last week
- state-of-the-art search over vector embeddings and structured data (SIGMOD '24)☆117Mar 6, 2025Updated last year
- Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"☆34Nov 9, 2025Updated 8 months ago