SIEVE builds a workload-aware collection of small HNSW subindexes and uses a cost model to pick the best one per query, speeding up filtered vector search up to 8.06x versus prior graph-based methods.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
SIEVE: Effective Filtered Vector Search with Collection of Indexes
SIEVE builds a workload-aware collection of small HNSW subindexes and uses a cost model to pick the best one per query, speeding up filtered vector search up to 8.06x versus prior graph-based methods.