Flattening an object algebra to provide performance

Peter Boncz; Annita N. Wilschut; Martin L. Kersten

doi:10.1109/ICDE.1998.655820

Flattening an object algebra to provide performance

Peter Boncz, Annita N. Wilschut, Martin L. Kersten

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

34 Citations (Scopus)

152 Downloads (Pure)

Abstract

Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in object-oriented (OO) DBMSs is difficult due to the complexity of OO 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 state-of-the-art database kernel. We present a generic mapping scheme to flatten data models and study the case of straightforward OO 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 1-GByte TPC-D (Transaction-processing Performance Council's Benchmark D), showing that our divide-and-conquer approach yields excellent results

Original language	English
Title of host publication	Proceedings International Conference on Data Engineering '98
Place of Publication	Piscataway, NJ
Publisher	IEEE
Pages	568-577
Number of pages	10
ISBN (Print)	0-8186-8289-2
DOIs	https://doi.org/10.1109/ICDE.1998.655820
Publication status	Published - Feb 1998
Event	14th International Conference on Data Engineering, ICDE 1998 - Orlando, United States Duration: 23 Feb 1998 → 27 Feb 1998 Conference number: 14

Publication series

Name	Proceedings International Conference on Data Engineering
Publisher	IEEE
Volume	1998
ISSN (Print)	1063-6382

Conference

Conference	14th International Conference on Data Engineering, ICDE 1998
Abbreviated title	ICDE
Country/Territory	United States
City	Orlando
Period	23/02/98 → 27/02/98

Keywords

DB-PRJMOA: MAGNUM OBJECT ALGEBRA
DB-GIS: GEOGRAPHIC INFORMATION SYSTEMS
DB-OODB: OBJECT-ORIENTED DATABASES

Access to Document

10.1109/ICDE.1998.655820

Flattening an object algebra to provide performance
Wilschut, A. N. (Keynote speaker)
23 Feb 1998
Activity: Talk or presentation › Oral presentation

Cite this

@inproceedings{e9e896960e1a4c6db4449adfa485177d,

title = "Flattening an object algebra to provide performance",

abstract = "Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in object-oriented (OO) DBMSs is difficult due to the complexity of OO 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 state-of-the-art database kernel. We present a generic mapping scheme to flatten data models and study the case of straightforward OO 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 1-GByte TPC-D (Transaction-processing Performance Council's Benchmark D), showing that our divide-and-conquer approach yields excellent results",

keywords = "DB-PRJMOA: MAGNUM OBJECT ALGEBRA, DB-GIS: GEOGRAPHIC INFORMATION SYSTEMS, DB-OODB: OBJECT-ORIENTED DATABASES",

author = "Peter Boncz and Wilschut, {Annita N.} and Kersten, {Martin L.}",

year = "1998",

month = feb,

doi = "10.1109/ICDE.1998.655820",

language = "English",

isbn = "0-8186-8289-2",

series = "Proceedings International Conference on Data Engineering",

publisher = "IEEE",

pages = "568--577",

booktitle = "Proceedings International Conference on Data Engineering '98",

address = "United States",

note = "14th International Conference on Data Engineering, ICDE 1998, ICDE ; Conference date: 23-02-1998 Through 27-02-1998",

}

Boncz, P, Wilschut, AN & Kersten, ML 1998, Flattening an object algebra to provide performance. in Proceedings International Conference on Data Engineering '98. Proceedings International Conference on Data Engineering, vol. 1998, IEEE, Piscataway, NJ, pp. 568-577, 14th International Conference on Data Engineering, ICDE 1998, Orlando, Florida, United States, 23/02/98. https://doi.org/10.1109/ICDE.1998.655820

Flattening an object algebra to provide performance. / Boncz, Peter; Wilschut, Annita N.; Kersten, Martin L.
Proceedings International Conference on Data Engineering '98. Piscataway, NJ: IEEE, 1998. p. 568-577 (Proceedings International Conference on Data Engineering; Vol. 1998).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Flattening an object algebra to provide performance

AU - Boncz, Peter

AU - Wilschut, Annita N.

AU - Kersten, Martin L.

N1 - Conference code: 14

PY - 1998/2

Y1 - 1998/2

N2 - Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in object-oriented (OO) DBMSs is difficult due to the complexity of OO 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 state-of-the-art database kernel. We present a generic mapping scheme to flatten data models and study the case of straightforward OO 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 1-GByte TPC-D (Transaction-processing Performance Council's Benchmark D), showing that our divide-and-conquer approach yields excellent results

AB - Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in object-oriented (OO) DBMSs is difficult due to the complexity of OO 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 state-of-the-art database kernel. We present a generic mapping scheme to flatten data models and study the case of straightforward OO 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 1-GByte TPC-D (Transaction-processing Performance Council's Benchmark D), showing that our divide-and-conquer approach yields excellent results

KW - DB-PRJMOA: MAGNUM OBJECT ALGEBRA

KW - DB-GIS: GEOGRAPHIC INFORMATION SYSTEMS

KW - DB-OODB: OBJECT-ORIENTED DATABASES

U2 - 10.1109/ICDE.1998.655820

DO - 10.1109/ICDE.1998.655820

M3 - Conference contribution

SN - 0-8186-8289-2

T3 - Proceedings International Conference on Data Engineering

SP - 568

EP - 577

BT - Proceedings International Conference on Data Engineering '98

PB - IEEE

CY - Piscataway, NJ

T2 - 14th International Conference on Data Engineering, ICDE 1998

Y2 - 23 February 1998 through 27 February 1998

ER -

Flattening an object algebra to provide performance

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Activities

Flattening an object algebra to provide performance

Cite this