Naive histogram topology P parse lines ach (Q> is d hash distribute k s quicksort Each KR R c count occurrences MS merge sort MS nNaïve histogram topology Q Q R Q R k k k n n Each is: R is: Each MS C P C S C S D P parse lines D hash distribute S quicksort C count occurrences MS merge sort