feat: Add subgraph sampling as reusable multi-hop subgraph sampling foundation - #831
Open
aotenjou wants to merge 7 commits into
Open
feat: Add subgraph sampling as reusable multi-hop subgraph sampling foundation#831aotenjou wants to merge 7 commits into
aotenjou wants to merge 7 commits into
Conversation
aotenjou
force-pushed
the
subgraph-sampling
branch
from
August 12, 2026 04:44
50f3e6b to
052cb3c
Compare
aotenjou
marked this pull request as draft
August 12, 2026 05:37
aotenjou
marked this pull request as ready for review
August 19, 2026 07:03
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.
What changes were proposed in this pull request?
This PR introduces a model-agnostic subgraph sampling foundation for graph learning algorithms such as GCN and GNN and an inner implementation of #502.
Changes
Add fanout-based one-hop neighbor sampling
fanout > 0selects at most the requested number of neighborsfanout = -1returns all neighbors matching the requested directionAdd layered sampled-subgraph assembly
Add stable logical edge identities
sourceId + targetId + label + timeAdd an iterative multi-hop BSP protocol
REQUEST,RESPOND,COMMIT_AND_REQUEST, andCOMPLETEphasesIntegrate sampling with the DSL algorithm runtime
initIterationandfinishIterationlifecycle callbacksTesting
The following local validation has passed:
Coverage includes:
fanout = -1How was this PR tested?