This document discusses the I/O costs of performing a DISTINCT operation on the Reserves relation using a two-phase hash-based approach. It analyzes the I/O costs for partitioning the data into buckets in the first phase and eliminating duplicates in the second phase under different buffer sizes. The total I/O cost is shown to be linear in the number of input and output pages.