Repository navigation
Push partitioned hash join filters into V2 scans - #10415
joseph-isaacs wants to merge 29 commits into
Conversation
Convert TopK and hash-join dynamic filters into live `vortex.dynamic` comparisons so the scan prunes zones as the filter tightens. Only `col op literal` bounds are tracked; anything else is relaxed to `true`, so the Vortex filter never drops rows the operator needs. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FL15XgcyJgZ6xkaMo8p5o3
Hash-join dynamic filters are complete by the time the probe side opens a file, so read their bounds once and apply them as static comparisons, but only when the file's min/max statistics suggest they keep at most half of the column's value range. Non-selective join bounds (e.g. TPC-H order and customer keys) otherwise add a row-level filter that costs more than it saves. Filters that are still changing (TopK) keep the live template. TPC-H SF1, DataFusion over Vortex, 30 samples per mode: geomean on/off went from 1.065 to 0.981; q07 0.70x, q21 0.71x. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FL15XgcyJgZ6xkaMo8p5o3
When a file's type differs from the table's, the expression adapter wraps a dynamic filter's columns in casts. The opener then treated the filter as an unpushable static filter and failed the query (ClickBench q23, `ORDER BY "EventTime" LIMIT 10`). Send every dynamic filter down the dynamic path, dropping any that can't be converted, and look through casts to the underlying column. Bounds on a cast column are only applied when the literal converts to the file type and back unchanged, so a lossy cast can never tighten the filter. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FL15XgcyJgZ6xkaMo8p5o3
Multi-column TopK filters have the form `a < v OR (a = v AND b < w)`, which previously yielded no bounds, leaving every row to pay for an always-true template (ClickBench q26 regressed 1.24x). Read bounds recursively: `=` gives both `<=` and `>=`, and an OR keeps, per column and direction, the looser bound when both sides have one, so the example yields `a <= v`. Incomparable values yield no bound. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FL15XgcyJgZ6xkaMo8p5o3
Partitioned hash joins publish `CASE route(key) WHEN i THEN bounds_i ... END`, which previously yielded no bounds, leaving probe-side files with an always-true filter. Bounds are now the hull over a CASE's results, with `false`/`NULL` branches (empty partitions) contributing nothing. When a still-changing filter already has bounds at file open, emit only the comparisons and columns those bounds use rather than the full template. Tidy the opener's conjunct split and share a values helper across the end-to-end tests, adding a hash-join case whose bounds are selective enough to be applied. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FL15XgcyJgZ6xkaMo8p5o3
The cached bounds are read on every evaluation of the Vortex filter but replaced only when the DataFusion filter changes, a few dozen times per query for TopK. Hold them in an ArcSwap instead of a mutex so concurrent reads don't contend; a refresh never replaces a newer generation. With four threads reading the same filter, a lookup drops from ~1.3 us to ~0.3 us. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FL15XgcyJgZ6xkaMo8p5o3
Report each converted dynamic filter with its DataFusion predicate, whether it is complete, and the resulting Vortex expression, plus the kept fraction estimated for complete filters. This makes it possible to see which scans actually receive TopK and join filters in a benchmark run. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01XGkjCDMVSGtEWhEHHW5wGL
A constant list against an array of needles was answered with one equality comparison over the whole array per element, OR-ed together, so an `IN` list of a hundred keys cost a hundred passes over the column. For integer needles and lists of at least four non-null elements, sort the elements once and binary search per needle instead. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01XGkjCDMVSGtEWhEHHW5wGL
Complete hash-join filters carry `col IN (keys)` next to their min/max bounds whenever the build side has few distinct keys. Convert those lists into a static `in_list` when they prune a meaningful share of the rows the bounds keep: a list that is dense in the bounded range adds nothing but a decode of the column. Partitioned joins route keys through a CASE, whose branch lists are unioned. Before a live filter has any bounds, only its leading column gets the dynamic comparison template. A TopK filter over several sort keys is a lexicographic disjunction whose hull only ever bounds the first key, so the other columns cost evaluations on every batch for nothing; on TPC-DS q10 that was 32 dynamic comparisons per batch. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01XGkjCDMVSGtEWhEHHW5wGL
A misplaced `?` dropped every column that had bounds but no membership list, so complete join filters that only carry min/max bounds were never applied. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01XGkjCDMVSGtEWhEHHW5wGL
Keeps `expect` out of the rstest case expressions, which are inlined into a test returning `Result`. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01XGkjCDMVSGtEWhEHHW5wGL
Merging this PR will regress 3 benchmarks
|
| Mode | Benchmark | BASE |
HEAD |
Efficiency | |
|---|---|---|---|---|---|
| ❌ ℹ️ | Simulation | test_scan_filter_to_arrow_array[int_float] |
3.5 ms | 4.1 ms | -13.99% |
| ❌ ℹ️ | Simulation | test_repeated_scan_filter[int_float] |
3.4 ms | 3.9 ms | -11.22% |
| ❌ ℹ️ | Simulation | test_repeated_scan_filter[int] |
2.5 ms | 2.7 ms | -10.29% |
| ⚡ | Simulation | decode_bool[10000_2_all_true] |
175.5 µs | 15.3 µs | ×11 |
| ⚡ | Simulation | decode_bool[10000_2_all_false] |
175.9 µs | 15.6 µs | ×11 |
| ⚡ | Simulation | decode_bool[10000_10_all_true] |
47.3 µs | 14.7 µs | ×3.2 |
| ⚡ | Simulation | decode_bool[10000_10_all_false] |
47.7 µs | 15.1 µs | ×3.2 |
| ⚡ | Simulation | decode_bool[10000_100_all_true] |
17.7 µs | 13.9 µs | +27.11% |
| ⚡ | Simulation | decode_bool[10000_100_all_false] |
18.3 µs | 14.4 µs | +27.07% |
| ⚡ ℹ️ | Simulation | test_repeated_scan_scalar_at[int_float] |
486.7 µs | 401.4 µs | +21.25% |
| ⚡ | WallTime | words_gather_dispatch_avx2[65536] |
1.4 µs | 1.3 µs | +10.87% |
| 🆕 | Simulation | decode_primitive_array[i64, 1] |
N/A | 3 ms | N/A |
| 🆕 | Simulation | decode_primitive_array[i64, 128] |
N/A | 529.7 µs | N/A |
| 🆕 | Simulation | decode_primitive_array[i64, 16] |
N/A | 682.1 µs | N/A |
| 🆕 | Simulation | decode_primitive_array[i64, 2] |
N/A | 1.8 ms | N/A |
| 🆕 |
Simulation | decode_primitive_array[i64, 4096] |
N/A | 518.7 µs | N/A |
| 🆕 | Simulation | decode_primitive_array[u16, 1] |
N/A | 2.3 ms | N/A |
| 🆕 | Simulation | decode_primitive_array[u16, 128] |
N/A | 151.3 µs | N/A |
| 🆕 | Simulation | decode_primitive_array[u16, 16] |
N/A | 306.2 µs | N/A |
| 🆕 | Simulation | decode_primitive_array[u16, 2] |
N/A | 1.3 ms | N/A |
| ... | ... | ... | ... | ... | ... |
ℹ️ Only the first 20 benchmarks are displayed. Go to the app to view all benchmarks.
Tip
Investigate this regression by commenting @codspeedbot fix this regression on this PR, or directly use the CodSpeed MCP with your agent.
Comparing ji/nifty-wright-ahdfl0 (9302b39) with develop (18aebea)
Footnotes
-
6 benchmarks were skipped, so the baseline results were used instead. If they were deleted from the codebase, click here and archive them to remove them from the performance reports. ↩
…ilter Clippy's cognitive complexity limit rejected the closure that built a column's bounds and membership comparisons inline. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01XGkjCDMVSGtEWhEHHW5wGL
Polar Signals Profiling ResultsLatest Run
Previous Runs (36)
Powered by Polar Signals Cloud |
Benchmarks: String Encoding 📖Commits: PR vortex / vortex-file-compressed / ms (1.014x ➖, 0↑ 0↓)
vortex / vortex-file-compressed / % (1.000x ➖, 0↑ 0↓)
|
Benchmarks: PolarSignals Profiling 📖Commits: PR datafusion / vortex-file-compressed / ns (1.003x ➖, 0↑ 0↓)
No file size changes detected. |
Benchmarks: FineWeb S3 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.984x ➖, 1↑ 1↓)
datafusion / vortex-compact / ns (1.032x ➖, 1↑ 0↓)
datafusion / parquet / ns (0.932x ➖, 1↑ 0↓)
duckdb / vortex-file-compressed / ns (0.995x ➖, 0↑ 0↓)
duckdb / vortex-compact / ns (1.061x ➖, 0↑ 1↓)
duckdb / parquet / ns (0.949x ➖, 0↑ 0↓)
|
Benchmarks: TPC-H SF=10 on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (1.007x ➖, 1↑ 0↓)
datafusion / vortex-compact / ns (1.005x ➖, 1↑ 1↓)
datafusion / parquet / ns (1.000x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (0.995x ➖, 0↑ 0↓)
duckdb / vortex-compact / ns (0.995x ➖, 0↑ 0↓)
duckdb / parquet / ns (1.004x ➖, 0↑ 0↓)
No file size changes detected. |
Benchmarks: Clickbench on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.984x ➖, 3↑ 0↓)
datafusion / vortex-compact / ns (0.954x ➖, 3↑ 0↓)
datafusion / parquet / ns (0.998x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (1.009x ➖, 1↑ 3↓)
duckdb / vortex-compact / ns (1.006x ➖, 0↑ 0↓)
duckdb / parquet / ns (0.993x ➖, 1↑ 0↓)
No file size changes detected. |
Benchmarks: FineWeb NVMe 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.974x ➖, 0↑ 0↓)
datafusion / vortex-compact / ns (0.989x ➖, 2↑ 1↓)
datafusion / parquet / ns (1.005x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (1.011x ➖, 4↑ 2↓)
duckdb / vortex-compact / ns (1.021x ➖, 1↑ 3↓)
duckdb / parquet / ns (0.991x ➖, 0↑ 0↓)
No file size changes detected. |
Benchmarks: Compression 📖Commits: PR vortex / vortex-file-compressed / ns (0.984x ➖, 0↑ 0↓)
vortex / vortex-file-compressed / bytes (1.000x ➖, 0↑ 0↓)
vortex / vortex-file-compressed / ratio (0.989x ➖, 0↑ 0↓)
vortex / parquet / ns (1.000x ➖, 0↑ 0↓)
vortex / parquet / bytes (1.000x ➖, 0↑ 0↓)
vortex / arrow-ipc / ns (1.027x ➖, 0↑ 5↓)
vortex / arrow-ipc / bytes (1.000x ➖, 0↑ 0↓)
|
Benchmarks: TPC-H SF=1 on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (1.027x ➖, 0↑ 2↓)
datafusion / vortex-compact / ns (1.029x ➖, 0↑ 2↓)
datafusion / parquet / ns (1.003x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (1.016x ➖, 0↑ 0↓)
duckdb / vortex-compact / ns (0.994x ➖, 1↑ 0↓)
duckdb / parquet / ns (1.017x ➖, 0↑ 1↓)
No file size changes detected. |
Benchmarks: Clickbench Sorted on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.954x ➖, 1↑ 0↓)
datafusion / vortex-compact / ns (0.913x ➖, 2↑ 0↓)
datafusion / parquet / ns (0.995x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (1.020x ➖, 1↑ 2↓)
duckdb / vortex-compact / ns (1.017x ➖, 0↑ 2↓)
duckdb / parquet / ns (0.967x ➖, 1↑ 0↓)
File Size Changes (200 files changed, +0.0% overall, 96↑ 104↓)
Totals:
|
Benchmarks: TPC-H SF=1 on S3 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.988x ➖, 1↑ 1↓)
datafusion / vortex-compact / ns (1.050x ➖, 0↑ 5↓)
datafusion / parquet / ns (0.999x ➖, 1↑ 1↓)
duckdb / vortex-file-compressed / ns (1.004x ➖, 0↑ 1↓)
duckdb / vortex-compact / ns (0.980x ➖, 1↑ 0↓)
duckdb / parquet / ns (0.952x ➖, 0↑ 1↓)
|
Benchmarks: Appian on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-compact / ns (1.004x ➖, 0↑ 0↓)
datafusion / parquet / ns (1.002x ➖, 0↑ 0↓)
duckdb / vortex-compact / ns (0.991x ➖, 0↑ 0↓)
duckdb / parquet / ns (0.986x ➖, 0↑ 0↓)
No file size changes detected. |
Benchmarks: TPC-H SF=1 on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (1.005x ➖, 2↑ 0↓)
datafusion / parquet / ns (1.001x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (0.995x ➖, 0↑ 0↓)
duckdb / parquet / ns (1.001x ➖, 0↑ 0↓)
No file size changes detected. |
Benchmarks: TPC-DS SF=1 on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.962x ➖, 11↑ 0↓)
datafusion / parquet / ns (1.005x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (1.000x ➖, 3↑ 4↓)
duckdb / parquet / ns (1.002x ➖, 3↑ 4↓)
No file size changes detected. |
Benchmarks: Clickbench on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.984x ➖, 3↑ 0↓)
datafusion / parquet / ns (0.999x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (0.998x ➖, 2↑ 3↓)
duckdb / parquet / ns (1.000x ➖, 1↑ 1↓)
No file size changes detected. |
Benchmarks: TPC-H SF=10 on NVME 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (1.009x ➖, 1↑ 1↓)
datafusion / parquet / ns (1.001x ➖, 0↑ 0↓)
duckdb / vortex-file-compressed / ns (0.997x ➖, 0↑ 1↓)
duckdb / parquet / ns (0.993x ➖, 0↑ 0↓)
No file size changes detected. |
A dynamic conjunct whose bounds never prune still costs a filter evaluation and mask on every split. With `ScanBuilder::with_skip_unselective_dynamic`, a conjunct containing dynamic expressions that kept at least 99% of its input rows for four consecutive evaluations at one dynamic version is not evaluated again until its dynamic values change. Zone pruning still runs. The scan can then return rows the conjunct would reject, so this is opt-in for engines whose dynamic filters are hints the producing operator applies again. It is off by default, so DuckDB scans are unchanged. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
- VortexSource scans may skip dynamic conjuncts that keep almost every row: DataFusion's TopK and hash-join operators apply their filters again. - A live filter that completes mid-scan gets the file-statistics check a filter complete at file open gets: bounds on columns where they keep more than half of the file's value range, or without numeric statistics, are dropped, so their comparisons always pass and are then skipped. Completion does not change a filter's generation, so cached bounds record whether they were read from a complete filter. - Unbound filters get two placeholder comparisons per column (`<=`, `>=`) instead of four. Strict bounds apply through the non-strict comparison: integer bounds are stepped to their exact equivalent (`a < 5` is `a <= 4`), other types also keep rows equal to the bound. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
Benchmarks: TPC-H SF=1 on S3 📖Commits: PR How to read Verdict and Engines
datafusion / vortex-file-compressed / ns (0.894x ➖, 3↑ 0↓)
datafusion / parquet / ns (0.769x ➖, 9↑ 0↓)
duckdb / vortex-file-compressed / ns (0.935x ➖, 2↑ 1↓)
duckdb / parquet / ns (0.889x ➖, 1↑ 0↓)
|
Combines cbe3baf, which skips dynamic conjuncts proven to accept every row while unbound, with skipping bound dynamic conjuncts that keep almost every row. The unselective-skip scan test now uses a bound comparison, since an unbound one is skipped exactly on every split. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
|
CodSpeed Performance Analysis on
No fix to port. I haven't re-run the benchmark workflow: the CodSpeed check isn't a single job, so re-running it means re-running every benchmark shard. Generated by Claude Code |
DataFusion's hash-join dynamic filter lists every build-side row's key, so a key repeats once per matching build row. In TPC-H q17 each partition's list on `l_partkey` holds about 1,500 entries but only about 50 distinct parts. The converter compared the raw length with `MAX_MEMBERS` and dropped the whole filter, leaving the subquery's aggregate to read and group every lineitem row. Deduplicate the values while converting and give up only when the distinct count exceeds `MAX_MEMBERS`. Local TPC-H SF1 (Vortex, DataFusion, 4 cores), against the previous head: q17 0.33x, 3.3x less CPU; TPC-H geomean 0.837x of base (was 0.862x). TPC-DS SF1 geomean 0.958x of the previous head (q01 0.48x, q03 0.48x, q07 0.56x, q27 0.75x). Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
The previous commit checked each list entry against the distinct values seen so far with a linear search, and converted every entry first. A join's list can hold thousands of entries per partition. At TPC-H SF10, q17's 32 partition lists each repeat ~60 distinct keys ~30 times and are converted at every file open. Rejecting that union, which exceeds `MAX_MEMBERS`, then cost more than the old length check. CI measured q17 SF10 at +8.0%, up from +1.5%. Collect the distinct DataFusion values in a hash set and convert only those. Locally, with 32 target partitions on TPC-H SF1, q17 is 0.82x and 0.95x of the previous commit in alternating runs, using 10-28% less CPU. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
|
CodSpeed Performance Analysis on
No fix applies from this PR. I'm leaving the check as it is. Generated by Claude Code |
|
This PR has been marked as stale because it has been open for 14 days with no activity. Please comment or remove the stale label if you wish to keep it active, otherwise it will be closed in 7 days |
|
This PR was closed because it has been inactive for 7 days since being marked as stale. |
develop now scans with the V2 scan by default and already pushes DataFusion dynamic filters into it (#11215). The V1 scan changes on this branch are superseded, and the RunEnd files they touched moved and were rewritten, so this merge keeps develop's version of every file. The partitioned hash join handling is ported onto the V2 dynamic filter in the next commit. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
A hash join with partitioned build sides filters its probe side with `CASE hash_repartition(keys) % n WHEN i THEN <partition i's filter> ...`. The converter can't evaluate the routing hash, so the whole filter was dropped and the scan read every probe row. Every row the join keeps satisfies one partition's filter, so a key bound or key list that every partition has still holds, loosened to cover all of them. Convert that hull instead: the loosest bounds, and the union of the key lists while it has at most 256 distinct keys. The join still enforces its keys exactly. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
Summary
#11215 pushes DataFusion's dynamic filters into V2 scans, but a hash join with partitioned build sides still pushes nothing down. Its filter routes each probe key to its partition's filter by hash:
Vortex can't evaluate
hash_repartition, so the converter dropped the whole filter and the scan read every probe row.Every row the join keeps satisfies one partition's filter, so a bound or key list that every partition has still holds for that row once it is loosened to cover all of them. The scan now converts that hull:
The example above becomes
key >= 1 AND key <= 20. Partitions without rows (THEN false) don't constrain the hull. A partition with no bound means nothing is pushed down.The join still enforces its keys exactly, so a looser filter only means the scan returns more rows than it needs to.
This PR previously added dynamic filter support to the V1 scan.
developnow scans with V2 by default and #11215 covers that path, so this branch mergesdevelopkeeping its tree, and carries only the partitioned join change.Testing
vortex-datafusion/src/v2/dynamic_filters.rscover:cargo test -p vortex-datafusion --lib v2::dynamic_filterspasses.cargo clippy -p vortex-datafusion --all-targets --all-features -- -D warningspasses.cargo +nightly-2026-09-10 fmt -p vortex-datafusionis clean.https://claude.ai/code/session_01So4kxsqCY8WFG1NTMNJxKX
Generated by Claude Code