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.