CleANN combines workload-aware bridge building, on-the-fly neighborhood consolidation, and semi-lazy memory cleaning to keep graph-based ANNS recall near static-build levels under fully dynamic concurrent workloads.
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
-
CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
CleANN combines workload-aware bridge building, on-the-fly neighborhood consolidation, and semi-lazy memory cleaning to keep graph-based ANNS recall near static-build levels under fully dynamic concurrent workloads.