[SERVER-85669] Use more efficient algorithm for block hashagg with many partitions Created: 24/Jan/24  Updated: 08/Feb/24  Resolved: 08/Feb/24

Status: Closed
Project: Core Server
Component/s: None
Affects Version/s: None
Fix Version/s: 7.3.0-rc3

Type: Improvement Priority: Major - P3
Reporter: Matt Boros Assignee: Matt Boros
Resolution: Fixed Votes: 0
Labels: None
Remaining Estimate: Not Specified
Time Spent: Not Specified
Original Estimate: Not Specified

Assigned Teams:
Query Execution
Backwards Compatibility: Fully Compatible
Participants:

 Description   

When the block hashagg stage are given many partitions, we use a quadratic algorithm to process the block input. We can check for a large number of partitions and use a better algorithm instead.



 Comments   
Comment by Githook User [ 08/Feb/24 ]

Author:

{'name': 'Matthew Boros', 'email': 'mattBoros@users.noreply.github.com', 'username': 'mattBoros'}

Message: SERVER-85669 Use more efficient algorithm for block hashagg with many partitions (#18479)

GitOrigin-RevId: bbdb01da3cdc99e00ed330d6b0afec61ea8c8cb0
Branch: master
https://github.com/mongodb/mongo/commit/cdbfb3e1d7f2b4188202f9be628783076aa298ca

Generated at Thu Feb 08 06:58:19 UTC 2024 using Jira 9.7.1#970001-sha1:2222b88b221c4928ef0de3161136cc90c8356a66.