Translating OSQL-Queries into Efficient Set Expressions


Share/Save/Bookmark

Steenhagen, H.J. and By, R.A. de and Blanken, H.M. (1996) Translating OSQL-Queries into Efficient Set Expressions. In: Proceedings of the 5th International Conference on Extending Database Technology (EDBT), 25-29 Mar 1996, Avignon, France (pp. pp. 183-197).

[img] PDF
Restricted to UT campus only
: Request a copy
1MB
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].
Item Type:Conference or Workshop Item
Additional information:Imported from EWI/DB PMS [db-utwente:inpr:0000003081]
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/63535
Official URL:http://www.springerlink.com/content/w8315h046182377w
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 120009