-
Type:
Task
-
Resolution: Unresolved
-
Priority:
Major - P3
-
None
-
Affects Version/s: None
-
Component/s: None
-
None
-
Storage Execution
-
Storage Execution 2026-11-23
-
None
-
None
-
None
-
None
-
None
-
None
-
None
Incremental spilling needs a buffer that keeps receiving keys while another buffer's sorted keys are written out at the collection scan's rate. NoLimitSorter keeps one buffer and writes everything at once when it exceeds maxMemoryUsageBytes.
This gives NoLimitSorter two buffers that trade roles, each holding its unspilled entries and the pool its keys are allocated from; memPool() returns the filling buffer's pool, and memory accounting covers both. This is the structure only: nothing populates or swaps the second buffer yet, so behavior is unchanged and file-backed sorters never use it.
- related to
-
SERVER-139235 Add incremental_sorter_spilling.js end-to-end jstest
-
- In Progress
-
- split from
-
SERVER-132056 Investigate incremental spilling in primary-driven index builds
-
- Closed
-
- split to
-
SERVER-139235 Add incremental_sorter_spilling.js end-to-end jstest
-
- In Progress
-
-
SERVER-139272 Sort the filling buffer and begin its spill when it exceeds half the budget
-
- In Progress
-
-
SERVER-139274 Pace incremental spilling with byte-count debt
-
- In Progress
-