perf(query-planner): replace DFS transitive reduction with petgraph algo#9804
Open
tninesling wants to merge 2 commits into
Open
perf(query-planner): replace DFS transitive reduction with petgraph algo#9804tninesling wants to merge 2 commits into
tninesling wants to merge 2 commits into
Conversation
Replace the O(V*E) DFS-from-every-node `reduce()` with petgraph's `dag_transitive_reduction_closure` (Habib-Morvan-Rampon algorithm). The StableDiGraph-to-AdjList conversion is extracted into `to_toposorted_adjacency_list`, which maps sparse stable node indices to dense toposort-ordered indices for the reduction algorithm. Redundant edges are identified by querying the reduction graph directly rather than materializing an intermediate adjacency matrix. All existing call sites, operation order, and defer-edge recording behavior are preserved — this is a pure algorithm swap. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Contributor
✅ Docs preview has no changesThe preview was not built because there were no changes. Build ID: 0e87dd75c215ce54c89a19c8 ✅ AI Style Review — No Changes DetectedNo MDX files were changed in this pull request. Review Log: View detailed log
|
Contributor
|
@tninesling, please consider creating a changeset entry in |
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.
Replace the O(V*E) DFS-from-every-node
reduce()with petgraph'sdag_transitive_reduction_closure(Habib-Morvan-Rampon algorithm).The StableDiGraph-to-AdjList conversion is extracted into
to_toposorted_adjacency_list, which maps sparse stable node indices to dense toposort-ordered indices for the reduction algorithm. Redundant edges are identified by querying the reduction graph directly rather than materializing an intermediate adjacency matrix.All existing call sites, operation order, and defer-edge recording behavior are preserved — this is a pure algorithm swap.
Checklist
Complete the checklist (and note appropriate exceptions) before the PR is marked ready-for-review.
Exceptions
Note any exceptions here
Notes
Footnotes
It may be appropriate to bring upcoming changes to the attention of other (impacted) groups. Please endeavour to do this before seeking PR approval. The mechanism for doing this will vary considerably, so use your judgement as to how and when to do this. ↩
Configuration is an important part of many changes. Where applicable please try to document configuration examples. ↩
A lot of (if not most) features benefit from built-in observability and
debug-level logs. Please read this guidance on metrics best-practices. ↩Tick whichever testing boxes are applicable. If you are adding Manual Tests, please document the manual testing (extensively) in the Exceptions. ↩