RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search.
Jianyang GaoCheng LongPublished in: Proc. ACM Manag. Data (2024)
Keyphrases
- error bounds
- approximate nearest neighbor search
- high dimensional
- theoretical analysis
- nearest neighbor
- metric space
- nearest neighbor search
- similarity search
- hash functions
- worst case
- vector space
- locality sensitive hashing
- kd tree
- low dimensional
- dimensionality reduction
- high dimensional spaces
- high dimensional data
- knn
- distance function
- indexing techniques
- database systems
- search algorithm
- feature space
- feature vectors
- high dimensionality
- query optimization
- learning algorithm
- multi dimensional