Flattening an object algebra to provide performance

被引：17

作者：

Boncz, P ^{[1
]}

Wilschut, AN ^{[1
]}

Kersten, ML ^{[1
]}

机构：

[1] Univ Twente, NL-7500 AE Enschede, Netherlands

来源：

14TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/ICDE.1998.655820

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity of object-oriented query languages. This paper demonstrates that the problem can be simplified by mapping an OO data model to the binary relational model implemented by Monet, a stat-of-the-art database kernel. We present a generic mapping scheme to flatten data models and study the case of a straightforward object-oriented model. We show how flattening enabled us to implement a query algebra, using only a very limited set of simple operations. The required primitives and query execution strategies are discussed, and their performance is evaluated on the 1GB TPC-D benchmark, showing that our divided-and-conquer approach yields excellent results.

引用

页码：568 / 577

页数：10