The Excellence
Directory Platform Template

IVF is an indexing technique widely used in vector databases where vectors are clustered into inverted lists (partitions), enabling efficient Approximate Nearest Neighbor search by probing only a subset of relevant partitions at query time.

Product Quantization is a compression and indexing technique for vector search that splits vectors into subspaces and quantizes each part separately, allowing vector databases to store large-scale embeddings compactly while supporting efficient ANN search.

Applied book on using deep learning for search, including dense vector representations, semantic search, and neural ranking, all directly relevant to building applications on top of vector databases.

Technical book covering theory and practice of multidimensional and metric data structures for similarity search, forming a theoretical basis for index structures used in vector databases.

Module of Google’s Machine Learning Crash Course that explains word and text embeddings, how they are obtained, and the difference between static and contextual embeddings, giving essential background for using vector representations in vector databases and similarity search systems.

Ball-tree is a binary tree data structure used for organizing points in a multi-dimensional space, particularly useful in vector databases for nearest neighbor search. It partitions data points into hyperspheres (balls), enabling efficient search and scalability in high-dimensional vector spaces.

K-means Tree is a clustering-based data structure that organizes high-dimensional vectors for fast similarity search and retrieval. It is used as an indexing method in some vector databases to optimize performance for vector search operations.

M-tree is a dynamic index structure for organizing and searching large data sets in metric spaces, enabling efficient nearest neighbor queries and dynamic updates, which are important features for vector databases handling high-dimensional vectors.

R-tree is a tree data structure widely used for indexing multi-dimensional information such as vectors, supporting efficient spatial queries like nearest neighbor and range queries, which are essential in vector databases.

Spectral Hashing is a method for approximate nearest neighbor search that uses spectral graph theory to generate compact binary codes, often applied in vector databases to enhance retrieval efficiency on large-scale, high-dimensional data.

A vector database is a specialized database designed to store, index, and retrieve unstructured data represented as high-dimensional vectors, enabling efficient semantic search, similarity search, and powering applications such as LLM long-term memory, semantic search, and recommendation systems.

Locality-Sensitive Hashing (LSH) is an algorithmic technique for approximate nearest neighbor search in high-dimensional vector spaces, commonly used in vector databases to speed up similarity search while reducing memory footprint.