lec08_improve_run_merging 高级算法数据结构第八篇.pptVIP

Improve Run Merging Reduce number of merge passes. Use higher order merge. Number of passes = ceil(logk(number of initial runs)) where k is the merge order. More generally, a higher-order merge reduces the cost of the optimal merge tree. Improve Run Merging Overlap input, output, and internal merging. DISK MEMORY DISK Steady State Operation Read from disk Write to disk Merge DISK MEMORY DISK Partitioning Of Memory Need exactly 2 output buffers. I1 I0 O0 O1 Loser Tree … Ib Need at least k+1 (k is merge order) input buffers. 2k input buffers suffice. Number Of Input Buffers When 2 input buffers are dedicated to each of the k runs being merged, 2k buffers are not enough! Input buffers must be allocated to runs on an as needed basis. Buffer Allocation When ready to read a buffer load, determine which run will exhaust first. Examine key of the last record read from each of the k runs. Run with smallest last key read will exhaust first. Use an enforceable tie breaker. Next buffer load of input is to come from run that will exhaust first, allocate an input buffer to this run. Buffer Layout Output buffers Input buffer queues k=9 F0 F1 F2 F3 F4 F5 F6 F7 F8 R0 R1 R2 R3 R4 R5 R6 R7 R8 Pool of free input buffers Initialize To Merge k Runs Initialize k queues of input buffers, 1 queue per run, 1 buffer per run. Input one buffer load from each of the k runs. Put k – 1 unused input buffers into pool of free buffers. Set activeOutputBuffer = 0. Initiate input of next buffer load from first run to exhaust. Use remaining unused input buffer for this input. The Method kWayMerge k-way merge from input queues to the active output buffer. Merge stops when either the output buffer gets full or when an end-of-run key is merged into the output buffer. If merge hasn’t stopped and an input buffer gets empty, advance to next buffer in queue and free empty buffer. Merge k Runs repeat kWayMerge; wait for input/output to complete;