Alternative Title

Memory Adaptive External Sorts and Sort-Merge Joins

Version

Publisher’s Version

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

Computer Sciences | Databases and Information Systems

Research Areas

Data Management and Analytics

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

Additional URL

http://www.vldb.org/conf/1993/P618.PDF

Share

COinS