Repository navigation
feat: Add HasMany and BelongsTo Eager Loading - #6
Merged
Merged
Conversation
Declare relations, batch related rows with a unique IN list, and nest them in memory so N parents cost one extra query instead of N.
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
1 participant
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.
Relations were the missing piece after the query builder and migrations. hasMany and belongsTo declare the FK once. relatedQuery compiles a single IN list with unique, non-null keys, and nestHasMany / nestBelongsTo attach the graph in memory.
A loop of per-parent SELECTs is N queries for N parents. The eager path is one extra query, including parents that have no children. belongsTo reuses one parent object per id (identity map). Empty or all-null key sets skip the related query so we never hit the database for nothing.
Closes #5