Proposes Unified Dominance Graph (UDG) for interval-predicate ANNS by mapping to dominance space and building a predicate-specific graph index with patch edges for better search under filters.
Digra: A dynamic graph indexing for approximate nearest neighbor search with range filter,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
MCI approximates dense nearest neighbor graphs via maximal clique covers and progressive local densification to support fast arbitrary-filtered approximate nearest neighbor search with reduced space.
FAVOR achieves 1.3-5x higher QPS at 95% Recall@10 for arbitrary filtered ANNS by combining exclusion-distance reshaping in HNSW graphs with a selectivity-driven router that switches between brute-force and optimized search.
citing papers explorer
-
Unified Dominance Graph for Interval-Predicate Approximate Nearest Neighbor Search
Proposes Unified Dominance Graph (UDG) for interval-predicate ANNS by mapping to dominance space and building a predicate-specific graph index with patch edges for better search under filters.
-
MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
MCI approximates dense nearest neighbor graphs via maximal clique covers and progressive local densification to support fast arbitrary-filtered approximate nearest neighbor search with reduced space.
-
FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances
FAVOR achieves 1.3-5x higher QPS at 95% Recall@10 for arbitrary filtered ANNS by combining exclusion-distance reshaping in HNSW graphs with a selectivity-driven router that switches between brute-force and optimized search.