Translating OSQL-queries into efficient set expressions

H.J. Steenhagen; R.A. de By; H. Blanken

doi:10.1007/BFb0014139

Translating OSQL-queries into efficient set expressions

H.J. Steenhagen, R.A. de By, H. Blanken

Databases (Former)

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

2 Citations (Scopus)

35 Downloads (Pure)

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	https://doi.org/10.1007/BFb0014139
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

Access to Document

10.1007/BFb0014139

ArticleFinal published version, 983 KB

Cite this

@inproceedings{d0f17e18afc74ebb8b4e0f8af30cc697,

title = "Translating OSQL-queries into efficient set expressions",

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].",

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

author = "H.J. Steenhagen and {de By}, R.A. and H. Blanken",

year = "1996",

month = mar,

doi = "10.1007/BFb0014139",

language = "English",

isbn = "3-540-61057-X",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "183--197",

booktitle = "Proceedings of the 5th International Conference on Extending Database Technology (EDBT)",

note = "5th International Conference on Extending Database Technology, EDBT 1996, EDBT ; Conference date: 25-03-1996 Through 29-03-1996",

}

Steenhagen, HJ, de By, RA & Blanken, H 1996, Translating OSQL-queries into efficient set expressions. in Proceedings of the 5th International Conference on Extending Database Technology (EDBT). Lecture Notes in Computer Science, vol. 1057, Springer, Berlin, pp. 183-197, 5th International Conference on Extending Database Technology, EDBT 1996, Avignon, France, 25/03/96. https://doi.org/10.1007/BFb0014139

Translating OSQL-queries into efficient set expressions. / Steenhagen, H.J.; de By, R.A.; Blanken, H.

Proceedings of the 5th International Conference on Extending Database Technology (EDBT). Berlin : Springer, 1996. p. 183-197 (Lecture Notes in Computer Science; Vol. 1057).

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

TY - GEN

T1 - Translating OSQL-queries into efficient set expressions

AU - Steenhagen, H.J.

AU - de By, R.A.

AU - Blanken, H.

N1 - Conference code: 5

PY - 1996/3

Y1 - 1996/3

N2 - 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].

AB - 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].

KW - DB-OODB: OBJECT-ORIENTED DATABASES

U2 - 10.1007/BFb0014139

DO - 10.1007/BFb0014139

M3 - Conference contribution

SN - 3-540-61057-X

T3 - Lecture Notes in Computer Science

SP - 183

EP - 197

BT - Proceedings of the 5th International Conference on Extending Database Technology (EDBT)

PB - Springer

CY - Berlin

T2 - 5th International Conference on Extending Database Technology, EDBT 1996

Y2 - 25 March 1996 through 29 March 1996

ER -

Translating OSQL-queries into efficient set expressions

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this