build1 publisher
ACORN moves the filter into the HNSW graph walk with predicate subgraph traversal
The paper reports 2 to 1,000 times the throughput of prior filtered-search methods at fixed recall, and says an existing HNSW library is enough to implement it. Both claims turn on how the graph is built.
Publishers:arxiv.org
Reality
- Evidence46
- Adoption
- Insufficient
- Hype gap+35
- Incentives65
- Confidence50