Query Evaluation in CROQUE : Calculus and Algebra Coincide
Query Evaluation in CROQUE : Calculus and Algebra Coincide
Loading...
Date
1997
Authors
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Contribution to a conference collection
Publication status
Published in
Proceedings of the 15. British National Conference on Databases
Abstract
With the substantial change of declarative query languages
from plain SQL to the so-called "object SQLs", in particular OQL, there
has surprisingly been not much change in the way problems of query representation and optimization for such languages are tackled. We identify
some of the difficulties pure algebraic approaches experience when facing object models and the operations defined for them. Calculus-style
formalisms suite this challenge better, but are said not to be efficiently
implementable in the database context.
This paper proposes a hybrid query representation and optimization approach, combining the strengths of a many-sorted query algebra and
the monoid comprehension calculus. We show that efficient execution
plans beyond nested-loop processing can be derived in such a framework. The translation process accounts for queries manipulating bulk-typed values by employing various join methods of the database engine, as well as queries that use aggregation, construction of arbitrary values, and arithmetics.
from plain SQL to the so-called "object SQLs", in particular OQL, there
has surprisingly been not much change in the way problems of query representation and optimization for such languages are tackled. We identify
some of the difficulties pure algebraic approaches experience when facing object models and the operations defined for them. Calculus-style
formalisms suite this challenge better, but are said not to be efficiently
implementable in the database context.
This paper proposes a hybrid query representation and optimization approach, combining the strengths of a many-sorted query algebra and
the monoid comprehension calculus. We show that efficient execution
plans beyond nested-loop processing can be derived in such a framework. The translation process accounts for queries manipulating bulk-typed values by employing various join methods of the database engine, as well as queries that use aggregation, construction of arbitrary values, and arithmetics.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
GRUST, Torsten, Joachim KRĂ–GER, Dieter GLUCHE, Andreas HEUER, Marc H. SCHOLL, 1997. Query Evaluation in CROQUE : Calculus and Algebra Coincide. In: Proceedings of the 15. British National Conference on DatabasesBibTex
@inproceedings{Grust1997Query-6023, year={1997}, title={Query Evaluation in CROQUE : Calculus and Algebra Coincide}, booktitle={Proceedings of the 15. British National Conference on Databases}, author={Grust, Torsten and Kröger, Joachim and Gluche, Dieter and Heuer, Andreas and Scholl, Marc H.} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6023"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Kröger, Joachim</dc:creator> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:title>Query Evaluation in CROQUE : Calculus and Algebra Coincide</dcterms:title> <dc:creator>Gluche, Dieter</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:48Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:contributor>Kröger, Joachim</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6023"/> <dc:rights>terms-of-use</dc:rights> <dc:contributor>Scholl, Marc H.</dc:contributor> <dc:format>application/pdf</dc:format> <dc:contributor>Heuer, Andreas</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6023/1/Query_evaluation_1997.pdf"/> <dc:contributor>Grust, Torsten</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:abstract xml:lang="eng">With the substantial change of declarative query languages<br />from plain SQL to the so-called "object SQLs", in particular OQL, there<br />has surprisingly been not much change in the way problems of query representation and optimization for such languages are tackled. We identify<br />some of the difficulties pure algebraic approaches experience when facing object models and the operations defined for them. Calculus-style<br />formalisms suite this challenge better, but are said not to be efficiently<br />implementable in the database context.<br />This paper proposes a hybrid query representation and optimization approach, combining the strengths of a many-sorted query algebra and<br />the monoid comprehension calculus. We show that efficient execution<br />plans beyond nested-loop processing can be derived in such a framework. The translation process accounts for queries manipulating bulk-typed values by employing various join methods of the database engine, as well as queries that use aggregation, construction of arbitrary values, and arithmetics.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:48Z</dc:date> <dc:contributor>Gluche, Dieter</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6023/1/Query_evaluation_1997.pdf"/> <dc:creator>Heuer, Andreas</dc:creator> <dc:creator>Grust, Torsten</dc:creator> <dcterms:issued>1997</dcterms:issued> <dc:creator>Scholl, Marc H.</dc:creator> <dcterms:bibliographicCitation>In: Proceedings of the 15. British National Conference on Databases</dcterms:bibliographicCitation> <dc:language>eng</dc:language> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> </rdf:Description> </rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
No