Princeton University |
Computer Science 425 |
We covered the slides for Chapter 12, Part A and Part B. We did not discuss the material of slide 12 of Part A in detail (refining sort-merge join by combining the merging phase of sorting with the merging phase of the join). We did discuss briefly on the board the external sorting method that can give a linear I/O-time sort if sufficient buffers are available (material found in Chapter 11).