Skip to content
Book Open access

Personalized kNN Query Execution in Vector Databases

Nov 2026 · Proceedings of the 35th ACM International Conference on Information and Knowledge Management · pp. 4372-4382 · 0 citations

Abstract

Modern vector databases enable search over high-dimensional embeddings, but query execution engines rely on a specific similarity metric that cannot reflect how individual users perceive similarity. We advocate a metric-level perspective on personalization, keeping the shared embedding space and the underlying index unchanged, and representing each user's specific search needs by a small matrix for Mahalanobis distance learned using relevance feedback and metric learning. Using a lower bounding relationship between Mahalanobis and Euclidean distances, we propose a query execution strategy for personalized k-nearest neighbour search that retrieves an enlarged candidate set using a standard Euclidean (or inner product) index and refines it under the user's subjective metric. Experiments on CLIP embeddings from Profiset and LAION-2B-en datasets using FAISS-based indices show that this approach can be layered on top of existing vector databases with predictable behaviour, high overlap with precise Mahalanobis kNN search results, and only a small overhead over standard Euclidean search. When the Euclidean–Mahalanobis discrepancy becomes too large for efficient refinement, we propose approximation techniques and show that a Cholesky-based whitening transformation can reorganize embeddings so that personalized search reduces to Euclidean indexing again.

Read PDF

Similar papers

Open access Sep 2026

Metric Algebra: Embedding-Independence in Vector Databases

Vector databases are increasingly central to retrieval applications, yet deployments remain embedding-siloed: different databases store vectors produced by different embedding models and ANN pipelines, making cross-database search ill-defined or forcing expensive re-embedding and index rebuilds. We propose metric al...

Tian-Jian Yang, Yang Cao, Bei-Ning Yang et al. · 0 citations

Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning

LLM-Guided Graph Pruning (LGP), a general framework that addresses this mismatch directly by leveraging LLM reasoning to refine an existing ANN graph index itself, and consistently improves end-to-end retrieval performance over both vanilla greedy graph search and LLM-based reranking across widely used graph-based ANN...

Fangzhou Wu, Hai-Ke Xu, Sandeep Silwal · 0 citations
Oct 2026

Parajoin: A Parallelism-aware approximate filtered similarity join method in vector databases

ParaJoin is presented, the first framework purposely designed for ARFSJ, which introduces an adaptive partitioning algorithm that dynamically reconstructs partitions for arbitrary join ranges, and it develops batch optimization strategies that combine fine-grained task division with neighborhood result reuse.

Kang-Ping Yi, Bin Yao, Bo Tang · 0 citations
Preprint Nov 2026

Per-Query Recall Guarantees for Approximate Nearest Neighbor Search in Dynamic Vector Databases

Vector search runs as an operator in database systems, where a missed neighbor can make a filter, join, or aggregate wrong, yet approximate nearest neighbor (ANN) indexes are tuned only for an average recall target. In our measurements, indexes tuned to an average recall of 0.99 left 5-19% of in-distribution queries an...

W. Loh, Suan Lee · 0 citations
Open access Oct 2026

Sparcent: faster multi-vector dense retrieval with sparse centroid indices

Multi-vector dense retrieval methods have set the state-of-the-art retrieval quality on ranking tasks. However, the superior effectiveness of such methods comes with substantial computational overhead, which makes their deployment in large-scale search engines infeasible. As a remedy, we propose a novel approach, Sparc...

Erman Yafay, I. S. Altingovde · 0 citations
Preprint Oct 2026

Fidelity Synopses: Pre-Execution Plan Selection for Approximate Vector Search

Vector search has become a database operator with many physical implementations: different index families, build-time and search-time parameters, and compressed or disk-resident variants. Each trades cost against fidelity, the fraction of a query's exact top-k nearest neighbors that a configuration returns. Deployments...

Adithya Ramanatha, Sanskar S. Singh, Maya Ramanath · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.