k-shortest-path: add correctness benchmark harness#95
Open
shiva-istari wants to merge 1 commit into
Open
Conversation
End-to-end benchmark for Dgraph's k-shortest path algorithm. Compares Dgraph's path-cost vector against a gonum Yen oracle across a maxfrontiersize sweep to detect the eviction-correctness bug reported in dgraph-io/dgraph#9577. One command from zero to results: ./scripts/bench.sh --dataset-url <url> [branch ...] The script downloads the dataset, builds each branch, bulk-loads the graph into Dgraph, sweeps maxfrontiersize, and prints a cross-branch correctness table. Supports detached runs inside a memory-capped systemd transient unit (--detach) for long sweeps on a remote VM. Components: - cmd/prepare: download + convert a DIMACS/CSV road graph to LDBC format - cmd/convert: LDBC -> Dgraph RDF + schema - cmd/bench: sweep maxfrontiersize, compare costs vs gonum Yen oracle - internal/oracle: gonum YenKShortestPaths wrapper - internal/compare: path-cost vector diff (ok/count_mismatch/weight_mismatch) - internal/client: Dgraph DQL shortest-path query + self-consistency check - scripts/bench.sh: end-to-end orchestration (dataset → zero → bulk → sweep) - scripts/lib/alpha.sh: Dgraph alpha lifecycle helpers (start/stop/reset/health) Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
End-to-end benchmark for Dgraph's k-shortest path algorithm. Compares Dgraph's path-cost vector against a gonum Yen oracle across a maxfrontiersize sweep to detect the eviction-correctness bug reported in dgraph-io/dgraph#9577.
One command from zero to results:
./scripts/bench.sh --dataset-url [branch ...]
The script downloads the dataset, builds each branch, bulk-loads the graph into Dgraph, sweeps maxfrontiersize, and prints a cross-branch correctness table. Supports detached runs inside a memory-capped systemd transient unit (--detach) for long sweeps on a remote VM.
Components: