External Sorting - Universit#233; dOttawa - University of Ottawa外部排序-大学和# 233；dottawa -渥太华大学.pptVIP

Selected Topics: External Sorting, Join Algorithms, … Chapters 13—15: 13.1—13.5, 14.4, … Why Sort? A classic problem in computer science (See Knuth, v.3)! Data requested in sorted order e.g., find students in increasing gpa order Sorting is first step in bulk loading B+ tree index. Sorting useful for eliminating duplicate copies in a collection of records (Why?) Sort-merge join algorithm involves sorting. Problem: sort 1Gb of data with 1Mb of RAM. why not virtual memory? 2-Way Merge Sort: Requires 3 Buffers Pass 1: Read a page, sort it (in memory), write it. only one buffer page is used Pass 2, 3, …, etc.: three buffer pages used. 2-Way Merge Sort: Algorithm proc two-way_extsort(file) // Given a file on disk, sort it using 3 buffer pages //Pass 0: produce 1runs Read each page of file into memory, sort it, and write it out. //Merge pairs of runs to produce longer runs until 1 run is left While # of runs at end of previous pass 1 do: //Process passes i=1,2,… While there are runs to be merged from previous pass do: Pick next 2 runs from previous pass. Reach read each run into an input buffer, 1 page at a time. Merge the runs and write result to the output buffer by forcing output buffer to disk one page at a time. endproc Two-Way External Merge Sort Each pass we read + write each page in file = 2N I/O’s per pass. N pages in the file = the number of passes So total cost is: Idea: Divide and conquer: sort subfiles and merge Input file contains 7 pages; dark pages shows what would happen with 8 pages. General External Merge Sort To sort a file with N pages using B buffer pages: Pass 0: use B buffer pages. Produce sorted runs of B pages each. Pass 2, …, etc.: merge B-1 runs. General External Merge Sort: Algorithm proc extsort(file) // Given a file on disk, sort it using B buffer pages //Pass 0: produce Bs runs Read B pages of file into memory, sort them, and write them out. //Merge B-1 runs to produce longer r