RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search.
Jianyang GaoCheng LongPublished in: CoRR (2024)
Keyphrases
- error bounds
- approximate nearest neighbor search
- high dimensional
- theoretical analysis
- nearest neighbor
- nearest neighbor search
- metric space
- similarity search
- hash functions
- vector space
- worst case
- locality sensitive hashing
- kd tree
- low dimensional
- data points
- high dimensional spaces
- databases
- multi dimensional
- knn
- feature vectors
- image retrieval
- high dimensional data
- input data
- high dimensionality
- multiresolution
- bag of features
- feature space
- database systems
- data sets