From c24fb4c2d698c32a1251d0e9d9a8e67f41645520 Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Fri, 31 Aug 2007 21:07:15 +0200 Subject: [PATCH] New TODO notes. --- lib/sorter/TODO | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/lib/sorter/TODO b/lib/sorter/TODO index 30f02a8c..207eefa2 100644 --- a/lib/sorter/TODO +++ b/lib/sorter/TODO @@ -7,7 +7,10 @@ Improvements: o Use radix-sort for internal sorting. 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 Buffer sizing in internal sorters. o Switching between direct and normal I/O. o When merging, choose the output file with less runs instead of always switching? 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 Log messages should show both original and new size of the data. The speed + should be probably calculated from the former. -- 2.39.2