You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
Optimize hash operations and byte-wise row comparisons for dictionary encoding #21466
Two related performance improvements for dictionary-encoded columns during aggregation:
Byte-wise row comparisons : when checking for existing groups, group_rows.row(row) == group_values.row(*group_idx) compares raw bytes. Since dictionary encoding represents repeated values as integer indices, comparing those integers directly is significantly cheaper. Hash operations : hash calls on dictionary-encoded columns currently operate on the full string/primitive values. Replacing these with hashes of the integer dictionary keys is a minor but meaningful performance gain.
Note: Dictionary key→value mappings are not stable across RecordBatches;The same key index can map to a different value in a different batch. Any new logic must not assume otherwise.
Activity
Rich-T-kid commentedon Apr 8, 2026
this falls under #7000 & performance and regression test that will be included in the PR fall under #8791.
Rich-T-kid commentedon Apr 8, 2026
take
Rich-T-kid commentedon Aug 5, 2026
#23187 will close this when its merged
Rich-T-kid commentedon Aug 16, 2026
#23187 closes this