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
String Dictionary selection now probes a small distributed sample before it builds an exact candidate. The old estimator missed profitable dictionaries when columns contained thousands of repeated strings. Samples above 75% distinct values reject Dictionary. An incomplete probe uses the existing estimator. An admitted candidate has explicit limits for values, value bytes, code bytes, and input bytes. The compressor compares the candidate's actual size and reuses the candidate if it wins.
The probe reads at most 8,192 rows and 1 MiB of values. String samples now compact their payload before size estimates, so unrelated retained bytes do not distort the score.
On seven local runs of the standard compression benchmark, Euro2016 stayed effectively neutral: write +0.01%, full materialization +0.46%, and size -0.14%. HashTags wrote 4.4% faster and used 2.1% fewer bytes, but full materialization was 10.9% slower. The benchmark expands Dictionary into flat strings. Engines that preserve Dictionary can retain the encoded form.
Using the Walltime instrument on standard Hosted Runners will lead to inconsistent data.
For the most accurate results, we recommend using CodSpeed Macro Runners: bare-metal machines fine-tuned for performance measurement consistency.
⚠️Different runtime environments detected
Some benchmarks with significant performance changes were compared across different runtime environments,
which may affect the accuracy of the results.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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.
String Dictionary selection now probes a small distributed sample before it builds an exact candidate. The old estimator missed profitable dictionaries when columns contained thousands of repeated strings. Samples above 75% distinct values reject Dictionary. An incomplete probe uses the existing estimator. An admitted candidate has explicit limits for values, value bytes, code bytes, and input bytes. The compressor compares the candidate's actual size and reuses the candidate if it wins.
The probe reads at most 8,192 rows and 1 MiB of values. String samples now compact their payload before size estimates, so unrelated retained bytes do not distort the score.
On seven local runs of the standard compression benchmark, Euro2016 stayed effectively neutral: write +0.01%, full materialization +0.46%, and size -0.14%. HashTags wrote 4.4% faster and used 2.1% fewer bytes, but full materialization was 10.9% slower. The benchmark expands Dictionary into flat strings. Engines that preserve Dictionary can retain the encoded form.
🤖 Generated with Codex