Publikation:

Translating QQL into Monoid Comprehensions : Stuck with Nested Loops? ; Revised Version

Lade...
Vorschaubild

Dateien

preprint_003_02.pdf.alt
preprint_003_02.pdf.altGröße: 342.8 KBDownloads: 163
preprint_003_02.pdf
preprint_003_02.pdfGröße: 342.8 KBDownloads: 67

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

Publikationstyp
Preprint
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

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690GRUST, Torsten, Marc H. SCHOLL, 1996. Translating QQL into Monoid Comprehensions : Stuck with Nested Loops? ; Revised Version
BibTex
@unpublished{Grust1996Trans-6001,
  year={1996},
  title={Translating QQL into Monoid Comprehensions : Stuck with Nested Loops? ; Revised Version},
  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/6001">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6001/1/preprint_003_02.pdf.alt"/>
    <dc:format>application/pdf</dc:format>
    <dc:creator>Grust, Torsten</dc:creator>
    <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>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6001/2/preprint_003_02.pdf"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6001"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:40Z</dc:date>
    <dcterms:issued>1996</dcterms:issued>
    <dc:creator>Scholl, Marc H.</dc:creator>
    <dc:format>unknown</dc:format>
    <dc:language>eng</dc:language>
    <dcterms:title>Translating QQL into Monoid Comprehensions : Stuck with Nested Loops? ; Revised Version</dcterms:title>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6001/1/preprint_003_02.pdf.alt"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:40Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Grust, Torsten</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6001/2/preprint_003_02.pdf"/>
    <dc:contributor>Scholl, Marc H.</dc:contributor>
  </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