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
Using the sample file provided in #1749, Vortex compression is nearly ~10x slower than the equivalent Parquet compression:
A couple of thoughts
This schema is large (14,000 columns) and deeply nested (Struct(Struct(List) * 14,000))
Tree search for best encodings is probably a large part of this
The search could be trivially parallelized
The compression step for structs/chunks could similarly be parallelized trivially
There is probably a certain amount of wasteful work being done in the single-threaded case that we should fix. Need to dig into a full profile to get a solid breakdown
The text was updated successfully, but these errors were encountered:
Using the sample file provided in #1749, Vortex compression is nearly ~10x slower than the equivalent Parquet compression:
A couple of thoughts
Struct(Struct(List) * 14,000
))The text was updated successfully, but these errors were encountered: