La Trobe University
The increasing popularity of flash memory means more database systems will run on flash memory in the future. One of the most important database operations is the external sort. Hence, this paper is focused on studying the problem of efficient external sorting on flash memory. In this paper, the authors target the situation where previously sorted data has become progressively unsorted due to data updates. Accordingly, they call this \"Partially\" sorted data. They focus on resorting partially sorted data by taking advantage of the partial sorted nature of the data to speed up the run generation phase of the traditional external merge sort.