chore(sql): speed up horizon join time frame search for large RHS tables#6814
chore(sql): speed up horizon join time frame search for large RHS tables#6814bluestreak01 merged 8 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 Use the checkbox below for a quick retry:
✨ 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 |
Cover the case where O3 ingestion splits a partition into multiple frames that share the same ceiling. The test verifies that seekEstimate returns the last frame in each split group and that next() correctly advances past it. Co-Authored-By: Claude Opus 4.6 <[email protected]>
|
@bluestreak01 |
The bugfix is in e4d6356. Let's see how CI does now. |
[PR Coverage check]😍 pass : 68 / 76 (89.47%) file detail
|
|
@bluestreak01 thanks for the review! |
Speeds up HORIZON JOIN in case of very large right-hand-side tables.
Implementation
HorizonJoinTimeFrameHelper.findAsOfRow()now uses aTimeFrameCursor#seekEstimate()call to binary-search to the target timestamp's vicinity before linearly scanning frames, reducing frame iteration from O(N) to O(log N) for large right-hand-side tables.