brancz opened a new issue, #37277: URL: https://github.com/apache/arrow/issues/37277
### Describe the enhancement requested I don't know if other languages offer this, but I assume this is a common thing needed. My scenario: I have dictionary arrays that traverse a query plan and potentially get filtered, and at the end, the dictionary may contain many more items than are actually still being referenced by indices in the dictionary. So I think it would be useful to have a `CompactDictionary` function that removes any unused entries from the dictionary and re-writes the indices to match the new, compact dictionary. Thoughts? (We may have to implement this anyway so in a way I'm asking if anyone has already written something like this and if not if this is a contribution that would be accepted) cc @zeroshade ### Component(s) Go -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
