I saw a lecture explaining that the database engine uses the divide-and-conquer algorithm for sorting to split the data set into separate runs and then sort them if the data that we need to sort couldn't fit in memory. In this algorithm when the pages are sorted and then written to disk, then merge the pages and compare each value, the output page is written to disk, this will finally merge two big pages which contain all tuples, my question is if the size of the tuple is very large more than memory size how will it handle at the last point when merging two big pages if these two pages size is large than memory size?
Asked
Active
Viewed 20 times
