The Dynamic Exploration Graph extends the authors' earlier Exploration Graph with a deletion mechanism and a fixed-parameter expansion rule, and reports faster build times and better recall-speed trade-offs than HNSW, DiskANN, and SWINN on three standard datasets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets
The Dynamic Exploration Graph extends the authors' earlier Exploration Graph with a deletion mechanism and a fixed-parameter expansion rule, and reports faster build times and better recall-speed trade-offs than HNSW, DiskANN, and SWINN on three standard datasets.