Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"external merge sort"”.

  1. An efficient external sorting algorithm for flash memory embedded devices

    … of available memory and energy constraints. Sorting is a fundamental algorithm used frequently in databases. Flash memory has unique performance characteristics. Page writes to flash memory are much more expensive than reads. In addition, random reads from flash memory can be performed at …

    ubc Repository record for An efficient external sorting algorithm for flash memory embedded devices (opens in a new tab) Download PDF for An efficient external sorting algorithm for flash memory embedded devices (opens in a new tab)

  2. Effective Use of SSDs in Database Systems

    … The third technique is an SSD-friendly external merge sort. This sorting technique has better performance than other common external sorting techniques. It also improves the SSD's lifespan by reducing the number of write operations required during sorting.

    waterloo Repository record for Effective Use of SSDs in Database Systems (opens in a new tab)

  3. Optimizing Database Algorithms for Random-Access Block Devices

    … one is about permuting data out-of-core. While external merge sort is popular for implementing permutation on hard disks, it carries unnecessary overhead in storing and comparing keys. We propose more efficient algorithms for a useful class of permutations called Address-Digit Permutations on …

    duke Repository record for Optimizing Database Algorithms for Random-Access Block Devices (opens in a new tab)