A memory-adaptive sort (MASORT) for database systems

Authors:
Weiye Zhang;Per-Åke Larson
Affiliations:
Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
Year:
1996

Citing 5
Cited 3

An adaptive hash join algorithm for multiuser environments

Proceedings of the sixteenth international conference on Very large databases
Query evaluation techniques for large databases

ACM Computing Surveys (CSUR)
AlphaSort: a RISC machine sort

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Memory-Adaptive External Sorting

VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Memory-Contention Responsive Hash Joins

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases

High-performance sorting on networks of workstations

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Competitive parallel disk prefetching and buffer management

Proceedings of the fifth workshop on I/O in parallel and distributed systems
Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.