4 repositorios
Techniques for converting high-precision vectors into compact forms to reduce memory footprint and latency.
Distinct from Vector Indexing: Specifically addresses the compression of vectors for memory efficiency, whereas the parent is general indexing management.
Explore 4 awesome GitHub repositories matching data & databases · Vector Index Compression. Refine with filters or upvote what's useful.
ParlAI is a conversational AI research framework designed for training, evaluating, and sharing dialogue models using a unified interface for datasets and agents. It functions as a PyTorch-based training platform and a dialogue data collection system, providing a centralized model zoo for the distribution of versioned pretrained agents. The project distinguishes itself through a knowledge-grounded retrieval system that combines dense and sparse indexing to ground responses in external information. It also provides a comprehensive infrastructure for gathering human-AI interaction data via inte
Utilizes compressed embeddings within FAISS indices to optimize memory usage and speed up passage retrieval.
zvec is an embedded vector database engine and indexing library designed for high-dimensional similarity search. It functions as a hybrid search engine and a retrieval-augmented generation knowledge base, allowing for the storage and retrieval of dense and sparse vectors. The system is distinguished by its hybrid retrieval pipeline, which fuses vector similarity, full-text keyword matching, and scalar metadata filtering into single query operations. It supports a plugin-based model integration system for registering custom embedding models and rerankers, as well as language bindings for nativ
Converts high-precision vectors into compact forms to reduce memory usage and lower query latency.
RAGatouille is a retrieval framework and search engine designed for implementing and training late-interaction retrieval models. It serves as a modular retrieval component for generative AI pipelines, focusing on high-performance document ranking to improve search accuracy. The project provides a toolkit for training and fine-tuning retrieval models using pairs and triplets, featuring automatic hard-negative mining for domain adaptation. It implements a late-interaction mechanism that balances retrieval speed with precision by utilizing compressed embeddings. The system covers document index
Implements quantized vector storage to reduce memory footprint and latency during retrieval.
USearch is a high-performance vector similarity search engine and approximate nearest neighbor index designed for dense embeddings. It functions as a low-level vector database core and high-dimensional vector indexer, providing the primitives necessary to store and retrieve vectors across massive datasets. The engine distinguishes itself through hardware-level SIMD acceleration for distance kernels and a proximity-graph indexing system that enables fast retrieval across billions of vectors. It supports multi-precision vector quantization to balance memory usage and accuracy, and utilizes memo
Reduces memory footprint by storing vectors as half-precision floats, 8-bit integers, or packed binary formats.