{'fraction_non_alphanumeric': 0.01366742596810934, 'fraction_numerical': 0.0056947608200455585, 'mean_word_length': 5.416058394160584, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Thesis: The Distributed Radix Join Algorithm - Efficient Distributed Join Processing on Modern Hardware

The ever increasing volume of data in scientific as well as commercial information systems calls for scalable databases. Distributed database systems can satisfy this demand as they are scalable to higher performance requirements simply by adding more computing nodes. However, they require efficient ways to query distributed relations in order to achieve high performance. We describe an efficient distributed algorithm for joining two large distributed relations. Our algorithm achieves a throughput of 140 M tuples per second on a cluster, consisting of 16 standard desktop machines. Furthermore, an analysis of the scalability of the algorithm is provided and it is shown that its performance on today’s commodity hardware is bound by the underlying network bandwidth.