TY  - THES
AB  - An adaptive external sorting algorithm is proposed where individual sorts vary the amount of memory, they use during their lifetimes based on both the availability of memory and the needs of the sort. Algorithms for allocating memory among multiple concurrent instances of this algorithm are also investigated. Most previous work in this area has investigated how to partition memory among queries that receive a static memory allocation when they begin. Other work has investigated adaptive algorithms but has not considered strategies for partitioning memory among multiple concurrent instances of queries based on these algorithms.
AD  - Oregon Graduate Institute of Science and Technology
AU  - Beck, Kevin L.
DA  - 1994-01-01
DO  - 10.6083/M4HD7T06
DO  - DOI
ID  - 7887
KW  - Algorithms
L1  - https://digitalcollections.ohsu.edu/record/7887/files/Beck.Kevin.1994.pdf
L2  - https://digitalcollections.ohsu.edu/record/7887/files/Beck.Kevin.1994.pdf
L4  - https://digitalcollections.ohsu.edu/record/7887/files/Beck.Kevin.1994.pdf
LK  - https://digitalcollections.ohsu.edu/record/7887/files/Beck.Kevin.1994.pdf
N2  - An adaptive external sorting algorithm is proposed where individual sorts vary the amount of memory, they use during their lifetimes based on both the availability of memory and the needs of the sort. Algorithms for allocating memory among multiple concurrent instances of this algorithm are also investigated. Most previous work in this area has investigated how to partition memory among queries that receive a static memory allocation when they begin. Other work has investigated adaptive algorithms but has not considered strategies for partitioning memory among multiple concurrent instances of queries based on these algorithms.
PB  - Oregon Health and Science University
PY  - 1994-01-01
T1  - Memory allocation in adaptive external sorting
TI  - Memory allocation in adaptive external sorting
UR  - https://digitalcollections.ohsu.edu/record/7887/files/Beck.Kevin.1994.pdf
Y1  - 1994-01-01
ER  -