Skip to content

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

Oct 2026 · The VLDB journal · Vol 35 · 0 citations · 81 references

TL;DR

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.

View source

Similar papers

Preprint Nov 2026

Dynamic Graph Indexing for Label-Filtered Approximate Nearest Neighbor Search

Approximate nearest neighbor search (ANNS) over high-dimensional vectors is a core primitive in modern retrieval systems. In practice, objects are often also associated with labels (e.g., attributes or keywords), and retrieval must combine vector similarity with explicit label-based filtering, giving rise to label-filt...

Meng-Xu Jiang, Zhi Yang, Fang-Yuan Zhang et al. · 0 citations
Book Open access Nov 2026

Personalized kNN Query Execution in Vector Databases

This work proposes a query execution strategy for personalized k-nearest neighbour search that retrieves an enlarged candidate set using a standard Euclidean index and refines it under the user's subjective metric and shows that a Cholesky-based whitening transformation can reorganize embeddings so that personalized se...

Matúš Šikyňa, P. Zezula · 0 citations
Preprint Oct 2026

Grant: A Framework for Approximate Nearest Neighbor Search with Multi-Attribute Range Filters

Recently, academia and industry have considered the problem of approximate nearest neighbor search (ANNS) with filters. In this setting, each object consists of a high-dimensional vector and attribute values. Given a query vector, filters for attribute values, and $k$, this problem retrieves $k$ vectors approximately n...

Daichi Amagata · 0 citations
Preprint Oct 2026

ACTIVE: A Dynamic Pareto-Frontier-Based Unified Index for Dual-Vector Query

Existing approximate nearest neighbor search (ANNS) methods generally assume that each entity has a single vector. In many real-world applications, however, an entity is associated with more than one vector, and queries may jointly consider two attributes. With different queries assigning different weights to each attr...

Sheng-Yuan Lin, Shu-Feng Gong, Zheng Wang et al. · 0 citations
Preprint Oct 2026

CORAL: Cross-modal Vector Retrieval via Incremental Graph Construction at Scale

Cross-modal vector retrieval is widely used in multimodal systems, such as search engines and vector databases. It typically operates in out-of-distribution (OOD) settings, where query vectors follow a distribution that differs from that of the vectors stored in the database. In such cases, conventional indexes suffer...

Shi-Xin Wan, Guo-Yu Hu, Yifan Wu et al. · 0 citations
Open access Sep 2026

ANNex: Efficient Filtered Approximate Nearest Neighbor Search via Graph-Traversal Metadata Filtering

Approximate Nearest Neighbor (ANN) search is a foundational primitive in modern recommendation and retrieval systems. However, production deployments routinely require filtered ANN search-retrieving the top- K nearest neighbors that also satisfy metadata predicates-a requirement that popular highperformance libraries s...

D. Shaikh · 0 citations

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