Memory Adaptive External Sorts and Sort-Merge Joins
In real-time and goal-oriented database systems, the amount of memory assigned to queries that sort or join large relations may fluctuate due to contention from other higher priority transactions. This study focuses on techniques that enable external sorts both to reduce their buffer usage when they lose memory, and to effectively utilize any additional buffers that are given to them. We also show how these techniques can be extended to work with sort-merge joins. A series of experiments confirms that our proposed techniques are useful for sorting and joining large relations in the face of memory fluctuations.
Computer Sciences | Databases and Information Systems
Data Management and Analytics
19th International Conference on Very Large Data Bases: August 24-27 1993, Dublin, Ireland: Proceedings
City or Country
Palo Alto, CA
PANG, Hwee Hwa; CAREY, Michael J.; and LIVNY, Miron, "Memory-Adaptive External Sorting" (1993). Research Collection School Of Information Systems (SMU Access Only). Paper 36.
Available at: http://ink.library.smu.edu.sg/sis_research_smu/36