Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
Description
For many datasets, dictionary encoding everything can result in drastically lower memory usage and subsequently better performance in doing analytics
One difficulty of dictionary encoding in multithreaded conversions is that ideally you end up with one dictionary at the end. So you have two options:
- Implement a concurrent hashing scheme – for low cardinality dictionaries, the overhead associated with mutex contention will not be meaningful, for high cardinality it can be more of a problem
- Hash each chunk separately, then normalize at the end
My guess is that a crude concurrent hash table with a mutex to protect mutations and resizes is going to outperform the latter
Attachments
Issue Links
- depends upon
-
ARROW-5052 [C++] Add an incomplete dictionary type
- Closed
- links to