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.

Tree-based data structure for organizing vectors through recursive axis-aligned partitioning, enabling logarithmic time complexity searches for balanced data but struggling with high-dimensional spaces.

Vector similarity metric combining both angle and magnitude information for comprehensive similarity measurement, equivalent to cosine similarity when vectors are normalized.

Straight-line distance metric between vectors in multidimensional space, sensitive to both magnitude and direction, ideal when embedding magnitude carries important information.

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.