WRSWorld Research StateContribute
WORLD RESEARCH STATE

Malkov and Yashunin: hierarchical navigable proximity-graph search

Contribution grade

Approximate nearest-neighbor indexing · Human-designed research method or resource

Reference score280,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Built nested proximity-graph layers with randomized maximum levels and searched from coarse upper layers toward the base, combining distance-scale separation and neighbor-selection heuristics.

Scientific scope

Built nested proximity-graph layers with randomized maximum levels and searched from coarse upper layers toward the base, combining distance-scale separation and neighbor-selection heuristics. Navigable small-world graphs and skip-list-like hierarchies are inherited. Search is approximate; observed near-logarithmic scaling is not a worst-case exact-search guarantee for every metric/data distribution.

Evidence

The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. Navigable small-world graphs and skip-list-like hierarchies are inherited. Search is approximate; observed near-logarithmic scaling is not a worst-case exact-search guarantee for every metric/data distribution.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction