o Parallelization of internal sorting.
o Clean up data types and make sure they cannot overflow. (size_t vs. u64 vs. sh_off_t vs. uns)
o Switching between direct and normal I/O.
o Parallelization of internal sorting.
o Clean up data types and make sure they cannot overflow. (size_t vs. u64 vs. sh_off_t vs. uns)
o Switching between direct and normal I/O.
o Deal with too rough range estimates in radix splitting.
o How does the speed of radix splitting decrease with increasing number of hash bits?
Does it help to use more bits than we need, so that we sort less data in memory?
o Deal with too rough range estimates in radix splitting.
o How does the speed of radix splitting decrease with increasing number of hash bits?
Does it help to use more bits than we need, so that we sort less data in memory?