Block oriented processing of relational database operations in modern computer architectures
Block oriented processing of relational database operations in modern computer architectures
复制标题
现代计算机体系结构中关系数据库操作的面向块处理
DOI:
10.1109/icde.2001.914871
复制
发表时间:
2001
期刊:
影响因子:
--
通讯作者:
A. Jhingran
中科院分区:
文献类型:
--
作者:
S. Padmanabhan;Timothy Malkemus;R. Agarwal;A. Jhingran
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 (UDB) system. We present results from representative queries on a 30-GB TPC-H (Transaction Processing Council Benchmark H) database to show the value of this technique.