Buffer Tree Sort
Buffer Tree Sort Buffer tree sort uses a buffer tree to sort data in the external-memory model. Instead of sorting all records directly, it inserts records into a high fanout search tree whose internal nodes hold buffers. When a buffer fills, records are pushed downward in batches. The purpose is to reduce random I/O. Records move through the tree in large blocks, which makes the algorithm efficient when data is...