From nested-loop to join queries in OODB

Hennie J. Steenhagen; Peter M.G. Apers; Henk M. Blanken; Rolf A. de By

From nested-loop to join queries in OODB

Hennie J. Steenhagen
, Peter M.G. Apers
, Henk M. Blanken
, Rolf A. de By

Databases (Former)

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

130 Downloads (Pure)

Abstract

Most declarative SQL-like query languages for object-oriented database systems are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-, and where-clause. Expressions in the from-clause may be base tables as well as set-valued attributes. In this paper, we propose a general strategy for the optimization of nested OOSQL queries. As in the relational model, the translation/optimization goal is to move from tuple- to set-oriented query processing. Therefore, OOSQL is translated into the algebraic language ADL, and by means of algebraic rewriting nested queries are transformed into join queries as far as possible. Three different optimization options are described, and a strategy to assign priorities to options is proposed.

Original language	English
Title of host publication	Proceedings of 20th International Conference on Very Large Data Bases (VLDB 1994)
Publisher	Morgan Kaufmann
Pages	618-629
Number of pages	12
ISBN (Print)	1-55860-153-8
Publication status	Published - Sept 1994
Event	20th International Conference on Very Large Data Bases, VLDB 1994 - Santiago de Chile, Chile Duration: 12 Sept 1994 → 15 Sept 1994 Conference number: 20

Conference

Conference	20th International Conference on Very Large Data Bases, VLDB 1994
Abbreviated title	VLDB
Country/Territory	Chile
City	Santiago de Chile
Period	12/09/94 → 15/09/94

Keywords

DB-OODB: OBJECT-ORIENTED DATABASES

Access to Document

ArticleFinal published version, 1.22 MB

https://dl.acm.org/doi/10.5555/645920.672819

Cite this

@inproceedings{349e4d15b8a342d39610186e78bc19b3,

title = "From nested-loop to join queries in OODB",

abstract = "Most declarative SQL-like query languages for object-oriented database systems are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-, and where-clause. Expressions in the from-clause may be base tables as well as set-valued attributes. In this paper, we propose a general strategy for the optimization of nested OOSQL queries. As in the relational model, the translation/optimization goal is to move from tuple- to set-oriented query processing. Therefore, OOSQL is translated into the algebraic language ADL, and by means of algebraic rewriting nested queries are transformed into join queries as far as possible. Three different optimization options are described, and a strategy to assign priorities to options is proposed.",

keywords = "DB-OODB: OBJECT-ORIENTED DATABASES",

author = "Steenhagen, \{Hennie J.\} and Apers, \{Peter M.G.\} and Blanken, \{Henk M.\} and \{de By\}, \{Rolf A.\}",

year = "1994",

month = sep,

language = "English",

isbn = "1-55860-153-8",

pages = "618--629",

booktitle = "Proceedings of 20th International Conference on Very Large Data Bases (VLDB 1994)",

publisher = "Morgan Kaufmann",

address = "United States",

note = "20th International Conference on Very Large Data Bases, VLDB 1994, VLDB ; Conference date: 12-09-1994 Through 15-09-1994",

}

TY - GEN

T1 - From nested-loop to join queries in OODB

AU - Steenhagen, Hennie J.

AU - Apers, Peter M.G.

AU - Blanken, Henk M.

AU - de By, Rolf A.

N1 - Conference code: 20

PY - 1994/9

Y1 - 1994/9

N2 - Most declarative SQL-like query languages for object-oriented database systems are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-, and where-clause. Expressions in the from-clause may be base tables as well as set-valued attributes. In this paper, we propose a general strategy for the optimization of nested OOSQL queries. As in the relational model, the translation/optimization goal is to move from tuple- to set-oriented query processing. Therefore, OOSQL is translated into the algebraic language ADL, and by means of algebraic rewriting nested queries are transformed into join queries as far as possible. Three different optimization options are described, and a strategy to assign priorities to options is proposed.

AB - Most declarative SQL-like query languages for object-oriented database systems are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-, and where-clause. Expressions in the from-clause may be base tables as well as set-valued attributes. In this paper, we propose a general strategy for the optimization of nested OOSQL queries. As in the relational model, the translation/optimization goal is to move from tuple- to set-oriented query processing. Therefore, OOSQL is translated into the algebraic language ADL, and by means of algebraic rewriting nested queries are transformed into join queries as far as possible. Three different optimization options are described, and a strategy to assign priorities to options is proposed.

KW - DB-OODB: OBJECT-ORIENTED DATABASES

M3 - Conference contribution

SN - 1-55860-153-8

SP - 618

EP - 629

BT - Proceedings of 20th International Conference on Very Large Data Bases (VLDB 1994)

PB - Morgan Kaufmann

T2 - 20th International Conference on Very Large Data Bases, VLDB 1994

Y2 - 12 September 1994 through 15 September 1994

ER -

From nested-loop to join queries in OODB

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this