Translating OQL into Monoid Comprehensions : Stuck with Nested Loops?

Lade...
Vorschaubild
Dateien
Translating_OQL_into_Monoid_Comprehensions.pdf
Translating_OQL_into_Monoid_Comprehensions.pdfGröße: 331.94 KBDownloads: 205
Datum
1996
Autor:innen
Grust, Torsten
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Working Paper/Technical Report
Publikationsstatus
Published
Erschienen in
Zusammenfassung

This work tries to employ the monoid comprehension calculus - which has proven to be an adequate framework to capture the semantics of modern object query languages featuring a family of collection types like sets, bags, and lists - in a twofold manner: First, serving as a target language for the translation of ODMG OQL queries. We review work done in this field and also give comprehension calculus equivalents for the recently introduced OQL 1.2 concepts.

Second, we use monoid comprehensions as the formalism in which we try to find efficient execution methods working on a rich set of physical structures (including indices, vertical and horizontal decomposition, etc.). The main problem coming up here is the "nested-loop nature" of the calculus expressions. While these loop-based semantics for evaluating comprehensions at least provide a way for executing OQL queries, their execution is almost always much less efficient than alternative physical algorithms of the database engine (e.g. different types of joins).

We are able to capture these efficient algorithms in the comprehension formalism, too. Furthermore, comprehensions are amenable to pattern-matching driven rewriting. This paper studies query rewrite optimization using monoid comprehensions and shows that efficient implementation plans can be derived in this framework.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690GRUST, Torsten, Marc H. SCHOLL, 1996. Translating OQL into Monoid Comprehensions : Stuck with Nested Loops?
BibTex
@techreport{Grust1996Trans-6407,
  year={1996},
  series={Konstanzer Schriften in Mathematik und Informatik},
  title={Translating OQL into Monoid Comprehensions : Stuck with Nested Loops?},
  number={3},
  author={Grust, Torsten 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/6407">
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:29Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6407/1/Translating_OQL_into_Monoid_Comprehensions.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Grust, Torsten</dc:creator>
    <dcterms:title>Translating OQL into Monoid Comprehensions : Stuck with Nested Loops?</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:29Z</dcterms:available>
    <dcterms:abstract xml:lang="eng">This work tries to employ the monoid comprehension calculus - which has proven to be an adequate framework to capture the semantics of modern object query languages featuring a family of collection types like sets, bags, and lists - in a twofold manner: First, serving as a target language for the translation of ODMG OQL queries. We review work done in this field and also give comprehension calculus equivalents for the recently introduced OQL 1.2 concepts.&lt;br /&gt;&lt;br /&gt;Second, we use monoid comprehensions as the formalism in which we try to find efficient execution methods working on a rich set of physical structures (including indices, vertical and horizontal decomposition, etc.). The main problem coming up here is the "nested-loop nature" of the calculus expressions. While these loop-based semantics for evaluating comprehensions at least provide a way for executing OQL queries, their execution is almost always much less efficient than alternative physical algorithms of the database engine (e.g. different types of joins).&lt;br /&gt;&lt;br /&gt;We are able to capture these efficient algorithms in the comprehension formalism, too. Furthermore, comprehensions are amenable to pattern-matching driven rewriting. This paper studies query rewrite optimization using monoid comprehensions and shows that efficient implementation plans can be derived in this framework.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6407"/>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Scholl, Marc H.</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Scholl, Marc H.</dc:creator>
    <dcterms:issued>1996</dcterms:issued>
    <dc:contributor>Grust, Torsten</dc:contributor>
    <dc:format>application/pdf</dc:format>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6407/1/Translating_OQL_into_Monoid_Comprehensions.pdf"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen