pith. sign in

Efficient and robust approximate nearest neighbor search using hierar- chical navigable small world graphs.IEEE Transactions on Pattern Analysis and Machine Intelligence

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DB 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Leveraging I/O Stalls for Efficient Scheduling in ANNS

cs.DB · 2026-05-19 · unverdicted · novelty 7.0

LIOS executes ANNS index updates inside search I/O stall windows via resumable subtasks, overrun bounding, and dynamic fraction adjustment, delivering up to 2.68x insertion and 2.18x deletion speedups in FreshDiskANN and OdinANN while controlling latency degradation.

citing papers explorer

Showing 1 of 1 citing paper.

  • Leveraging I/O Stalls for Efficient Scheduling in ANNS cs.DB · 2026-05-19 · unverdicted · none · ref 19

    LIOS executes ANNS index updates inside search I/O stall windows via resumable subtasks, overrun bounding, and dynamic fraction adjustment, delivering up to 2.68x insertion and 2.18x deletion speedups in FreshDiskANN and OdinANN while controlling latency degradation.