Sorting a collection of records on some (search) key is a very useful operation. When the data to be sorted is too large to fit into available main memory, we need to use an external sorting algorithm. Such algorithms seek to minimize the number of disk accesses.
Minibase supports external merge sort (see the text for a full description) :
Suppose we have M buffer pages available in memory, and we need to sort a large file with, say, N pages. There are two passes for the external sort.
The public interface for the external sorting utility is available here.
Back to the List of Components
Back to the Minibase Home Page