Abstract
Efficient query processing is one of the key promises of database technology. With the evolution of supported data models—from relational via nested relational to object-oriented—the need for such efficiency has not diminished, and the general problem has increased in complexity.
In this paper, we present a heuristics-based, extensible algorithm for the translation of object-oriented query expressions in a variant of OSQL to an algebra extended with specialized join operators, designed for the task. We claim that the resulting algebraic expressions are cost-efficient.
Our approach builds on well-known optimization strategies for the relational model, but extends them to include relations and more arbitrary sets as values. We pay special attention to the most costly forms of OSQL queries, namely those with full subqueries in the SELECT- or WHERE-clause. The paper builds on earlier results [17, 18].
Original language | English |
---|---|
Title of host publication | Proceedings of the 5th International Conference on Extending Database Technology (EDBT) |
Place of Publication | Berlin |
Publisher | Springer |
Pages | 183-197 |
Number of pages | 15 |
ISBN (Print) | 3-540-61057-X |
DOIs | |
Publication status | Published - Mar 1996 |
Event | 5th International Conference on Extending Database Technology, EDBT 1996 - Avignon, France Duration: 25 Mar 1996 → 29 Mar 1996 Conference number: 5 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Verlag |
Volume | 1057 |
ISSN (Print) | 0302-9743 |
Conference
Conference | 5th International Conference on Extending Database Technology, EDBT 1996 |
---|---|
Abbreviated title | EDBT |
Country/Territory | France |
City | Avignon |
Period | 25/03/96 → 29/03/96 |
Keywords
- DB-OODB: OBJECT-ORIENTED DATABASES