Memory-adaptive external sorting
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1993
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/3663 https://ink.library.smu.edu.sg/context/sis_research/article/4665/viewcontent/PangHH_1993_MemoryAdaptiveExternalSorting_VLDB.PDF |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | 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. |
|---|