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
期刊:
Proceedings 17th International Conference on Data Engineering
影响因子:
--
通讯作者:
A. Jhingran
A. Jhingran
中科院分区:
--
文献类型:
--
作者:
S. Padmanabhan;Timothy Malkemus;R. Agarwal;A. Jhingran

文献摘要

被引文献

相似文献

数据库系统没有很好地调整以利用现代超标量处理器架构。特别是,与科学内核或SPEC基准相比,相当简单的数据库查询的每指令时钟(CPI)相当差。数据库系统性能的不足是由于高速缓存和处理器功能单元的利用率低以及较高的分支代价。在本文中,我们认为,面向块的数据库操作的处理策略可以导致更好地利用处理器和缓存,产生显着更高的性能。我们已经实现了面向块的处理技术,用于聚合表达式求值和排序操作,并将其作为DB2 Universal Database(UDB)系统中的一个特性。我们提出了一个30 GB的TPC-H(事务处理理事会基准H)数据库的代表性查询的结果,以显示这种技术的价值。
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.