AlayaDB-AI / ParaGraphLinks
A cross-modal vector index with fast construction on heterogeneous CPU-GPU environment. Published on DaMoN@SIGMOD 2025.
☆15Updated 4 months ago
Alternatives and similar repositories for ParaGraph
Users that are interested in ParaGraph are comparing it to the libraries listed below
Sorting:
- A low-latency, billion-scale, and updatable graph-based vector store on SSD.☆76Updated this week
- Query-Adaptive Vector Search☆64Updated last week
- Official implementation for paper "Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search"☆29Updated 11 months ago
- ☆76Updated last year
- A code base for Vexless☆16Updated last year
- A list of papers in the field of approximate nearest neighbor search on high-dimensional vectors.☆97Updated last week
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆51Updated last year
- A lightweight library for the RaBitQ algorithm and its applications in vector search.☆104Updated last month
- ☆25Updated 4 months ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆54Updated 3 years ago
- Code for "Baleen: ML Admission & Prefetching for Flash Caches" (FAST 2024).☆27Updated last year
- Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"☆25Updated 3 weeks ago
- ☆30Updated 10 months ago
- ☆25Updated 2 months ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆36Updated 3 years ago
- ☆30Updated 5 months ago
- A persistent learned index for non-volatile memory with high read/write performance.☆18Updated 3 years ago
- LITS: An Optimized Learned Index for Strings☆12Updated 5 months ago
- ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems☆80Updated 2 years ago
- ☆26Updated 9 months ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆164Updated 6 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…☆22Updated 9 months ago
- [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…☆56Updated 6 months ago
- ☆64Updated 6 months ago
- GPU-accelerated vector query processing system that supports large vector datasets beyond GPU memory.☆35Updated last year
- ☆14Updated 2 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆63Updated 10 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated last year
- Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory☆110Updated last year
- A Learned Index for Log-Structured Merge Trees☆47Updated 2 years ago