AverSearch, a fully asynchronous graph-based nearest neighbor search engine, achieves lower query latency at higher throughput than the previous state of the art, iQAN, on multicore CPUs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss
AverSearch, a fully asynchronous graph-based nearest neighbor search engine, achieves lower query latency at higher throughput than the previous state of the art, iQAN, on multicore CPUs.