Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
8-1993
Abstract
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.
Discipline
Databases and Information Systems
Publication
19th International Conference on Very Large Data Bases: August 24-27 1993, Dublin, Ireland: Proceedings
First Page
618
Last Page
629
ISBN
9781558601529
Publisher
VLDB Endowment
City or Country
Palo Alto, CA
Embargo Period
7-11-2017
Citation
PANG, Hwee Hwa; CAREY, Michael J.; and LIVNY, Miron.
Memory-adaptive external sorting. (1993). 19th International Conference on Very Large Data Bases: August 24-27 1993, Dublin, Ireland: Proceedings. 618-629.
Available at: https://ink.library.smu.edu.sg/sis_research/3663
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://www.vldb.org/conf/1993/P618.PDF