feat(sql): require a query hint to enable rare-symbols optimization in ASOF JOIN#6333
Merged
bluestreak01 merged 3 commits intomasterfrom Oct 31, 2025
Merged
feat(sql): require a query hint to enable rare-symbols optimization in ASOF JOIN#6333bluestreak01 merged 3 commits intomasterfrom
bluestreak01 merged 3 commits intomasterfrom
Conversation
|
Important Review skippedAuto reviews are disabled on this repository. Please check the settings in the CodeRabbit UI or the You can disable this status message by setting the ✨ Finishing touches🧪 Generate unit tests (beta)
Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out. Comment |
Contributor
[PR Coverage check]😍 pass : 12 / 12 (100.00%) file detail
|
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.
The Memoized Scan algorithm for ASOF JOIN on symbol column has two kinds of caching:
For Match Caching, we only need a single hash lookup per LHS row for a cache hit, and another one for a cache miss.
For Drive-By Caching, we need a hash lookup for every visited RHS row. It pays off when many of the symbols to look for occur in the deep past of the RHS table. It allows us to make just one deep scan and find all of them. However, when there aren't many such symbols, hash lookups introduce a significant overhead, and result in worse performance in many typical cases.
Therefore, we're putting Drive-By Caching behind a query hint.