Block oriented processing of relational database operations in modern computer architectures

Abstract

Several recent papers have pointed out that database systems are not well tuned to take advantage of modern superscalar processor architectures. In particular, the Clocks-Per-Instruction (CPI) for rather simple database queries are quite poor compared to scientific kernels or SPEC benchmarks. The lack of performance of database systems has been attributed to poor utilization of caches and processor function units as well as higher branching penalties. In this paper, we argue that a block oriented processing strategy for database operations can lead to better utilization of the processors and caches generating significantly higher performance. We have implemented the block oriented processing technique for aggregation, expression evaluation, and sorting operations as a feature in the DB2 Universal Database system. We present results from representative queries on a 30 GB TPC-H database to show the value of this technique.