test(bench): b2-post-compaction query-latency comparison (RFC0009.7) - #225
Conversation
|
Warning Review limit reached
More reviews will be available in 48 minutes and 4 seconds. Learn how PR review limits work. Your organization has used up its prepaid credits, and credit purchases are no longer available. Enable the review add-on in the billing tab to keep reviews running — you're only billed for reviews past your plan's rate limits ($0.25/file). ⌛ How to resolve this issue?After more reviews become available, a review can be triggered using the We recommend that you space out your commits to avoid hitting the rate limit. 🚦 How do rate limits work?CodeRabbit enforces hourly rate limits for each developer per organization. Our paid plans include higher PR review limits than trial, open-source, and free plans. In all cases, reviews become available again over time. During sustained high-volume PR review activity, CodeRabbit may temporarily slow when the next review becomes available. Please see our Fair Usage Limits Policy for further information. ℹ️ Review info⚙️ Run configurationConfiguration used: defaults Review profile: CHILL Plan: Pro Plus Run ID: 📒 Files selected for processing (1)
📝 WalkthroughWalkthroughAdds a new ChangesB2 post-compaction query benchmark
Estimated code review effort🎯 2 (Simple) | ⏱️ ~10 minutes Possibly related issues
Possibly related PRs
Poem
🚥 Pre-merge checks | ✅ 5✅ Passed checks (5 passed)
✏️ Tip: You can configure your own custom pre-merge checks in the settings. ✨ 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 |
There was a problem hiding this comment.
Pull request overview
Adds an additional (non-gating) validated-side benchmark leg for RFC0009.7 by comparing template-exact query latency before vs after compaction on an identical synthetic partition, to quantify the small-file footer/metadata overhead compaction removes.
Changes:
- Introduces
b2-post-compactioncriterion group that builds an uncompacted N-file partition and a compacted single-file equivalent. - Runs the same
ourios_querier::Queriertemplate-exact query against both stores, asserts row conservation, prints row-group/bytes-read stats, and benchmarks both latencies. - Skips this benchmark group when running the band-scale baseline one-shot mode.
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
What
Adds the third RFC0009.7 validated leg to the compaction bench: B2-post-compaction — the same template-exact query over a partition of N small files vs the single consolidated file compaction produces.
b2-post-compactioncriterion group (skipped in band-scale baseline one-shot mode): builds N=32 small files (uncompacted), and the same N consolidated to one; queries both; asserts the result set is identical (compaction conserves rows); prints the hardware-independent row-group/byte counts and benches both latencies.Verified locally
The latency drop is the per-file footer/metadata-read overhead compaction removes — the PR #92 B2 finding (footer reads dominate query latency) that motivated RFC 0009. The 32→1 row-group / file reduction is structural (hardware-independent); the wall-clock ratio is indicative (it'll be captured authoritatively on
baseline-8vcpu-32gibfor the §9 record).fmt + clippy clean.
Why
Completes the RFC0009.7 validated evidence (D2 throughput + D3 size-band already measured authoritatively on baseline; this is the query-latency leg) ahead of the
green → validatedflip.Invariants
Non-gating, indicative bench. No product code touched; compaction's row-conservation correctness stays pinned by
ourios-parquet's tests.🤖 Generated with Claude Code
Summary by CodeRabbit