All posts published on this site.
Everything published here, newest first.
WindowAggExec asks the planner for hash-partitioned, sorted input, then walks each partition’s frame with a sliding accumulator that adds rows entering the frame and retracts rows …
DataFusion’s IN-list evaluation picks a filter by list size and type: a branchless comparison chain for short lists, a bitmap for narrow types, a hash set for wide ones.
Scalar UDFs receive whole Arrow arrays per batch, not one ScalarValue per row — ColumnarValue is the currency that makes that possible.
DataFusion’s PartitionedTopK keeps one bounded heap per partition key, sharing a single row converter, memory reservation and row store, so a per-partition top-k costs O(N) instead …
DataFusion pushes row filters into the Parquet decoder itself: the filter’s columns are decoded first, the surviving rows are known before the wide columns are touched, and …