A memory-adaptive sort (MASORT) for database systems
Weiye Zhang, Per-Åke Larson · Conference of the Centre for Advanced Studies on Collaborative Research · 1996
A memory-adaptive sort is able to dynamically change the amount of memory used during sorting. The method described in this paper adjusts memory usage according to input size and memory requirements of other sorts running in a database system. It saves memory space for small sorts, reduces sort time for large sorts, and balances memory usage among concurrent sorts. Overall system performance is improved when several sorts are running concurrently.