[SERVER-60535] Investigate use of merging algorithm for ordered multi accumulators Created: 07/Oct/21  Updated: 09/Nov/21  Resolved: 09/Nov/21

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

Type: Task Priority: Major - P3
Reporter: Mihai Andrei Assignee: Mihai Andrei
Resolution: Won't Do Votes: 0
Labels: None
Remaining Estimate: Not Specified
Time Spent: Not Specified
Original Estimate: Not Specified

Issue Links:
Depends
Sprint: QE 2021-11-15
Participants:

 Description   

Currently, AccumulatorN::processInternal naively combines elements one at a time when merging partial results (e.g inserting each element one at a time). For $firstN/$lastN, this is ok, but in the case of the ordered accumulators, we can potentially improve this using the 'merge sorted lists' algorithm. This task should investigate whether this algorithm provides any perf benefits (we should explore this after we have perf coverage for all of the ordered accumulators).

For small 'n' (i.e. n <= 10), this might not make a big difference, but for larger 'n', it could save some work.


Generated at Thu Feb 08 05:50:04 UTC 2024 using Jira 9.7.1#970001-sha1:2222b88b221c4928ef0de3161136cc90c8356a66.