We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.
Already on GitHub?
to your account
Is your feature request related to a problem or challenge? Please describe what you are trying to do.
Writing dictionary encoded arrays using parquet spends lot of time rehashing arrays.
Describe the solution you'd like
Use am initial capacity for the interner hashmap. This saves reallocating and shuffling around the table every time the capacity is too low (each time the size doubles).
Describe alternatives you've considered
The text was updated successfully, but these errors were encountered:
Successfully merging a pull request may close this issue.