What one PageRank sweep costs: five implementations on one host
What one sweep of one PageRank kernel costs across five implementations on one host, with every distance carrying its margin.
benchmarks
A collection of 3 issues
Graph algorithms, full paths, and the work a benchmark must count
A full-path graph algorithm benchmark over 2.147 billion path entries: an explicit output contract, three rounds of optimization, two regressions and one correctness bug.
Graph stores under strain: Rust in process matches Neo4j's reach, beats it on speed, and closes most of the memory gap
Rust in process now matches Neo4j's reach at 117 million edges and beats it on speed in every same-machine pair; Neo4j's memory lead is down to 10 to 40%. What 352 runs in 33 verified bundles show.