From nested-loop to join queries in OODB

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

70 Downloads (Pure)


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 languageEnglish
Title of host publicationProceedings of 20th International Conference on Very Large Data Bases (VLDB 1994)
PublisherMorgan Kaufmann
Number of pages12
ISBN (Print)1-55860-153-8
Publication statusPublished - Sept 1994
Event20th International Conference on Very Large Data Bases, VLDB 1994 - Santiago de Chile, Chile
Duration: 12 Sept 199415 Sept 1994
Conference number: 20


Conference20th International Conference on Very Large Data Bases, VLDB 1994
Abbreviated titleVLDB
CitySantiago de Chile




Dive into the research topics of 'From nested-loop to join queries in OODB'. Together they form a unique fingerprint.

Cite this