In-memory deduplication uses a hash set to track seen records, operating in O(n) time with a single pass. Sort-based dedup requires O(n log n) for sorting plus a pass to remove duplicates. Rollup performs aggregation, not duplicate removal. With sufficient memory, in-memory is fastest.