gabotechs opened a new pull request, #23720:
URL: https://github.com/apache/datafusion/pull/23720

   ## Which issue does this PR close?
   
   <!--
   We generally require a GitHub issue to be filed for all bug fixes and 
enhancements and this helps us generate change logs for our releases. You can 
link an issue to this PR using the GitHub syntax. For example `Closes #123` 
indicates that this PR will close issue #123.
   -->
   
   - Closes #11680.
   
   ## Rationale for this change
   
   <!--
    Why are you proposing this change? If this is already explained clearly in 
the issue then this section is not needed.
    Explaining clearly why changes are proposed helps reviewers understand your 
changes and offer better suggestions for fixes.  
   -->
   
   During partial + final aggregations, in order to accumulate + repartition 
data cross partitions, a hash is computed over the grouping expressions.
   
   This hash is computed 3 times:
   
   ```rust
   Aggregate(final): 3rd time hash computed 
     Repartition: 2nd time hash computed
       Aggregate(partial): 1st time hash computed
   ```
   
   And depending on what's getting hashed, it can be an expensive operation 
(e.g., hashing arbitrary length strings).
   
   This PR introduces a mechanism that allows reusing the hashes across 
different operators, by propagating them under an internal column in the schema:
   
   ```rust
   Aggregate(final): precomputed 
     Repartition: precomputed
       Aggregate(partial): 1st time hash computed
   ```
   
   :warning: needs https://github.com/apache/datafusion/pull/23719 first
   
   ## What changes are included in this PR?
   
   <!--
   There is no need to duplicate the description in the issue here but it is 
sometimes worth providing a summary of the individual changes in this PR.
   -->
   
   Introduces to core structs that aim to set the foundations of hash reuse 
across operators:
   - `ExpressionHasher`: handles hashing columns based on expressions, 
maintaining an internal buffer for reusing allocations, stamping the hashes 
into internal columns so that they can cross operator boundaries, and 
retrieving those hashes from the internal columns if present.
   - `GroupHashTracker`: during groupings, it keeps track of the per-group 
hashes so that operators that aggregate can emit them as an additional internal 
column for reuse purposes.
   
   These two structs are used across all the aggregation implementations in the 
codebase for reusing hashes.
   
   Additionally, some metrics for tracking how many hashes where computed VS 
how many hashes where reused are also added to operators that need to deal with 
hashes
   
   ## Are these changes tested?
   
   <!--
   We typically require tests for all PRs in order to:
   1. Prevent the code from being accidentally broken by subsequent changes
   2. Serve as another way to document the expected behavior of the code
   
   If tests are not included in your PR, please explain why (for example, are 
they covered by existing tests)?
   -->
   
   Yes, by existing and new tests.
   
   ## Are there any user-facing changes?
   
   <!--
   If there are user-facing changes then we may require documentation to be 
updated before approving the PR.
   -->
   
   <!--
   If there are any breaking changes to public APIs, please add the `api 
change` label.
   -->
   
   No, this should be transparent to users.
   


-- 
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]

Reply via email to