Translating OSQL-Queries into Efficient Set Expressions

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

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

2 Citations (Scopus)
14 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 languageUndefined
Title of host publicationProceedings of the 5th International Conference on Extending Database Technology (EDBT)
Place of PublicationBerlin
PublisherSpringer
Pages183-197
Number of pages15
ISBN (Print)3-540-61057-X
DOIs
Publication statusPublished - Mar 1996
Event5th International Conference on Extending Database Technology, EDBT 1996 - Avignon, France
Duration: 25 Mar 199629 Mar 1996
Conference number: 5

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume1057
ISSN (Print)0302-9743

Conference

Conference5th International Conference on Extending Database Technology, EDBT 1996
Abbreviated titleEDBT
CountryFrance
CityAvignon
Period25/03/9629/03/96

Keywords

  • IR-63535
  • METIS-120009
  • EWI-7333
  • DB-OODB: OBJECT-ORIENTED DATABASES

Cite this

Steenhagen, H. J., Steenhagen, H. J., de By, R. A., & Blanken, H. (1996). Translating OSQL-Queries into Efficient Set Expressions. In Proceedings of the 5th International Conference on Extending Database Technology (EDBT) (pp. 183-197). [10.1007/BFb0014139] (Lecture Notes in Computer Science; Vol. 1057). Berlin: Springer. https://doi.org/10.1007/BFb0014139
Steenhagen, H.J. ; Steenhagen, H.J. ; de By, R.A. ; Blanken, Henk. / Translating OSQL-Queries into Efficient Set Expressions. Proceedings of the 5th International Conference on Extending Database Technology (EDBT). Berlin : Springer, 1996. pp. 183-197 (Lecture Notes in Computer Science).
@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 = "IR-63535, METIS-120009, EWI-7333, DB-OODB: OBJECT-ORIENTED DATABASES",
author = "H.J. Steenhagen and H.J. Steenhagen and {de By}, R.A. and Henk Blanken",
note = "Imported from EWI/DB PMS [db-utwente:inpr:0000003081]",
year = "1996",
month = "3",
doi = "10.1007/BFb0014139",
language = "Undefined",
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)",

}

Steenhagen, HJ, 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)., 10.1007/BFb0014139, 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.; Steenhagen, H.J.; de By, R.A.; Blanken, Henk.

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

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

TY - GEN

T1 - Translating OSQL-Queries into Efficient Set Expressions

AU - Steenhagen, H.J.

AU - Steenhagen, H.J.

AU - de By, R.A.

AU - Blanken, Henk

N1 - Imported from EWI/DB PMS [db-utwente:inpr:0000003081]

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 - IR-63535

KW - METIS-120009

KW - EWI-7333

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

ER -

Steenhagen HJ, Steenhagen HJ, de By RA, Blanken H. Translating OSQL-Queries into Efficient Set Expressions. In Proceedings of the 5th International Conference on Extending Database Technology (EDBT). Berlin: Springer. 1996. p. 183-197. 10.1007/BFb0014139. (Lecture Notes in Computer Science). https://doi.org/10.1007/BFb0014139