facebookresearch / vector_db_id_compressionLinks
Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.
☆85Updated 11 months ago
Alternatives and similar repositories for vector_db_id_compression
Users that are interested in vector_db_id_compression are comparing it to the libraries listed below
Sorting:
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆66Updated 2 months ago
- Graph Library for Approximate Similarity Search☆136Updated 3 months ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆100Updated 2 months ago
- ☆198Updated this week
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆32Updated 3 weeks ago
- Code repository for the paper - "AdANNS: A Framework for Adaptive Semantic Search"☆66Updated 2 years ago
- Memory-Bounded GPU Acceleration for Vector Search☆32Updated 2 months ago
- Simple high-throughput inference library☆153Updated 7 months ago
- ⚡ Faster similarity search with PDX: A vertical data layout for vectors☆63Updated 4 months ago
- XTR: Rethinking the Role of Token Retrieval in Multi-Vector Retrieval☆60Updated last year
- Collection of datasets for benchmarking filtered vector similarity retrieval☆58Updated 6 months ago
- state-of-the-art search over vector embeddings and structured data (SIGMOD '24)☆95Updated 9 months ago
- Fast and vectorizable algorithms for searching in a vector of sorted floating point numbers☆153Updated last year
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆174Updated last week
- XTR/WARP (SIGIR'25) is an extremely fast and accurate retrieval engine based on Stanford's ColBERTv2/PLAID and Google DeepMind's XTR.☆174Updated 7 months ago
- A lightweight, user-friendly data-plane for LLM training.☆37Updated 3 months ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆169Updated 6 months ago
- MSVBASE is a system that efficiently supports complex queries of both approximate similarity search and relational operators. It integrat…☆101Updated last year
- DS SERVE: The Largest Open Vector Store over Pretain Data; A Framework for Efficient and Scalable Neural Retrieval☆29Updated 2 weeks ago
- Official software repository of L. Delfino, D. Erriquez, S. Martinico, F. M. Nardini, C. Rulli, and R. Venturini. "kANNolo: Sweet and Smo…☆44Updated last month
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆39Updated 5 months ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆172Updated 4 years ago
- DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables☆17Updated last year
- ☆78Updated 11 months ago
- Official code for "Binary embedding based retrieval at Tencent"☆44Updated last year
- ☆13Updated 11 months ago
- Exploration of Vector database Index for fast approximate nearest neighbour search.☆33Updated last year
- High-performance MinHash implementation in Rust with Python bindings for efficient similarity estimation and deduplication of large datas…☆223Updated 3 weeks ago
- Tree Attention: Topology-aware Decoding for Long-Context Attention on GPU clusters☆131Updated last year
- Compression for Foundation Models☆34Updated 5 months ago