Repository navigation
docs: ASAPPlanner memo-based joint optimization with MILP - #776
Merged
Merged
Conversation
…ample to the joint search design
7 tasks
…nd and dynamic programming
…screte site variables
…the lazy-cut loop, and the multi-query optimization view
…tive, constraints and lazy cuts
…icients and term cuts
…aluation apart; one solution decodes to one plan
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.
Why
ASAP primitives expand the search space and create cross-query cost dependencies. This proposal explains compact candidate generation and joint cost-based selection.
What
Adds a concise memo/MILP design and a separate window/materialization proposal. The main document uses connected explanatory prose and design rationale, with traditional memo rule examples followed by P95/P99 through ASAPPlanner stages. It cites Graefe’s Cascades paper and distinguishes demand-driven exploration from separate exhaustive phases.
The proposed representation has groups and physical candidates. Multiple candidates from one group may be selected; consumers connect directly to selected candidates. Shared state is represented by memo groups, without separate physical-instance slots. Distinct execution scopes or incompatible input bindings require distinct generated candidates.
The MILP defines candidate selection, compatible connections, query coverage, dependency support, acyclicity, and cost/accuracy/resource requirements. Optimality is restricted to the generated inventory and configured models. Proposed behavior is distinguished from existing implementation.
Key code interfaces added / modified
None (documentation only).
Before this PR
No unified proposal connecting memo expansion, ASAP-aware shared state, window/materialization choices, and joint selection.
After this PR
P95 and P99 remain separate result groups and can connect to one shared KLL candidate. Several KLL configurations may also be selected for different consumers. The design explains this with examples and a compact MILP formulation.
Verification
git diff --checkpassed.