Performance Impacts of Different Code Optimizations for the Radix Join Author:

iv Due to recent advancements in hardware technology, main-memory database systems are gaining more importance. This is because of the increasing capacities of the random-access memory over the years, as a result of which the entire data can now be held and processed within the limits of the available main-memory. In order to achieve a maximum performance, database operators in these systems need to be heavily tuned to exploit the capabilities of the underlying hardware, more specifically the capabilities of modern CPUs. To this end, software code optimizations relative to such hardware capabilities can be applied over an existing database algorithm. In our work, we study the performance behaviour of a set of code optimizations for the database join operator. For this, we adopt a set of optimization techniques from the literature and analyze their impacts on radix hash join algorithm. Acknowledgements This thesis represents the end of my two years bonding with Otto-von-Guericke Uni