Главная
Study mode:
on
1
[] Introduction and Welcome
2
[] Discussion on the Need for Quantization
3
[] Challenges of Traditional Vector Indexing
4
[] Compensating for Data Growth with Quantization
5
[] Overcoming the Challenges with Oversampling
6
[] Compatibility of Different Models with Binary Quantization
7
[] Benefits and Speed of Binary Quantization
8
[] Comparison of Dot Product and Hamming Distance
9
[] Implementing Binary Quantization
10
[] Closing Remarks
Description:
Explore binary quantization methods for vector databases in this technical talk featuring Qdrant CTO Andrey Vasnetsov. Dive deep into optimization techniques and search speed improvements for vector stores, addressing the challenges posed by expensive vector searches and large neural network encoders. Learn how binary quantization serves as a solution for vector compression, particularly when dealing with low-latency storage requirements and scalability concerns. Master practical implementations of vector indexing, understand the benefits of oversampling, and discover the compatibility of various models with binary quantization. Compare dot product and Hamming distance calculations while gaining insights into real-world applications from an experienced Machine Learning Engineer who emphasizes practical demonstrations over theoretical concepts.

Binary Quantization Methods for Vector Database Optimization

Qdrant - Vector Database & Search Engine
Add to list