Multi-segment tree graph supports generalized RRANN queries for arbitrary predicates like containment and overlap, with up to 12.5x speedups over baselines on real data while keeping index size comparable.
arXiv preprint arXiv:2503.00402 , year =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DB 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Signal-triggered local repair in graph ANN indexes improves minimum recall@10 by 0.014-0.050 under bursty churn versus fixed-cadence repair at matched budget on SIFT-128 and Fashion-MNIST-784.
citing papers explorer
-
Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap [Technical Report]
Multi-segment tree graph supports generalized RRANN queries for arbitrary predicates like containment and overlap, with up to 12.5x speedups over baselines on real data while keeping index size comparable.
-
When to Repair a Graph ANN Index: Navigability-Signal-Triggered Local Repair Protects Tail Recall Under Bursty Churn
Signal-triggered local repair in graph ANN indexes improves minimum recall@10 by 0.014-0.050 under bursty churn versus fixed-cadence repair at matched budget on SIFT-128 and Fashion-MNIST-784.