[WIP] Dictionary compressed arrangements #32095
Draft
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Evolving PR for enabling dictionary compression in arrangements.
Roughly, as each
row: &[u8]
is presented, we'll rip it apart into columns, and look for the option to use otherwise unused byte patterns (tags, otherwise used for row decoding) to reference popular values in each column. Columns are encoded independently, so things can be differently popular in different columns.Fair bit of work still to do, but checking in for the moment.
Motivation
Tips for reviewer
Checklist
$T ⇔ Proto$T
mapping (possibly in a backwards-incompatible way), then it is tagged with aT-proto
label.