1. Use qsort for first run
2. Limit number of tuples in leftist trees: - put one tuple from current tree to disk if limit reached; - end run creation if limit reached by nextrun. 3. Avoid mergeruns() if first run is single one!
Showing
This diff is collapsed.
Please register or sign in to comment