Lists (2)
Stars
LightMem: Lightweight and Efficient Memory-Augmented Generation
[SIGMOD'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
code base for Filtered Approximate Nearest Neighbor Search: A Systematic Survey and Benchmark: [Experiment, Analysis \& Benchmark]
[SIGMOD 2026] DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search.
Scalable long-context LLM decoding that leverages sparsity—by treating the KV cache as a vector storage system.
Public repository for CleANN, an efficient fully-dynamic approximate nearest neighbor search index
Repository for SIEVE: Effective Filtered Vector Search with Collection of Indexes VLDB '25 submission
A low-latency, billion-scale, and updatable graph-based vector store on SSD.
ColBERT: state-of-the-art neural search (SIGIR'20, TACL'21, NeurIPS'21, NAACL'22, CIKM'22, ACL'23, EMNLP'23)
This is the official implementation of the paper ⌈ Hi-PNG: Efficient Interval-Filtering ANNS via Hierarchical Interval Partition Navigating Graph ⌋
HAKES: Efficient Data Search with Embedding Vectors at Scale
GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
A low-latency, billion-scale, and updatable graph-based vector store on SSD.
A lightweight library for the RaBitQ algorithm and its applications in vector search.
A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
Mitigating Lost-in-Retrieval Problems in Retrieval Augmented Multi-Hop Question Answering, ACL 2025
Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.