Dandandan commented on issue #20773:
URL: https://github.com/apache/datafusion/issues/20773#issuecomment-4018583798
I wonder if we can make things also more cache aware with some sorting /
partitioning based on hash as well with more minimal changes with higher
cardinality, perhaps getting a similar win in cache efficiency:
* sort/partition hashes so we make the access to the table more linear (and
also detect/skip duplicate keys)
* sort/partition group indices to make accumulate access more linear
--
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]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
