From Nested-Loop to Join Queries in OODB (1994)
Cached
Download Links
- [www.vldb.org]
- [wwwis.cs.utwente.nl:8080]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. Int. Conf. on Very Large Data Bases (VLDB |
| Citations: | 18 - 0 self |
BibTeX
@INPROCEEDINGS{Steenhagen94fromnested-loop,
author = {Hennie J. Steenhagen and Peter M.G. Apers and Peter M. G and Rolf A. de By and Apers Henk and Henk M. Blanken and Rolf A.},
title = {From Nested-Loop to Join Queries in OODB},
booktitle = {In Proc. Int. Conf. on Very Large Data Bases (VLDB},
year = {1994},
pages = {618--629}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most declarative SQL-like query languages for object-oriented database systems (OOSQL) 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 setvalued 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 optimization options are described, and a strategy to assign priorities to options is proposed. 1 Introduction To support technical applications like CAD/CAM, GIS etc, relational technology has its shortcomings. In these areas, the popularity of object-oriented technology is growing. First, from the field of programming language...
