Abstract:Vector joins - finding all vector pairs between a set of query and data vectors whose distances are below a given threshold - are fundamental to modern vector and vector-relational database systems that power multimodal retrieval and semantic analytics. Existing state-of-the-art approach exploits work sharing among similar queries but still suffers from redundant index traversals and excessive distance computations. We propose a unified framework for efficient approximate vector joins that (1) introduces soft work sharing to reuse traversal results beyond the join results of previous queries, (2) builds a merged index over both query and data vectors to further speedup graph explorations, (3) improves robustness for out-of-distribution queries through an adaptive hybrid search strategy, and (4) further optimizes all these as offloading only the necessary online overhead to offline while minimizing maintenance cost. Experiments on eight datasets demonstrate substantial improvements in efficiency-recall trade-off over the state of the art.
From: Kyoungmin Kim [view email]
[v1]
Tue, 17 Mar 2026 10:47:35 UTC (4,790 KB)
[v2]
Thu, 23 Jul 2026 01:55:36 UTC (10,541 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。