Publikation: Query deforestation
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
The construction of a declarative query engine for a DBMS includes the challenge of compiling algebraic queries into efficient execution plans that can be run on top of the persistent storage. This work pursues the goal of employing foldr-build deforestation for the derivation of efficient streaming programs - programs that do not allocate intermediate data structures to perform their task - from algebraic (combinator) query plans. The query engine is based on the insertion representation of collections and base types, making the deforestation idea amenable to a wide range of type constructors and operators. In addition to the removal of intermediate data structures, deforestation actually implements certain algebraic optimizations for free. Query deforestation is a generally applicable technique that puts the derivation of streaming programs in a compact formal framework that should be immediately applicable.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
GRUST, Torsten, Marc H. SCHOLL, 1998. Query deforestationBibTex
@techreport{Grust1998Query-6182,
year={1998},
series={Konstanzer Schriften in Mathematik und Informatik},
title={Query deforestation},
number={68},
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/6182">
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:creator>Scholl, Marc H.</dc:creator>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:01Z</dc:date>
<dc:format>application/pdf</dc:format>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6182/1/Query_deforestation.pdf"/>
<dcterms:issued>1998</dcterms:issued>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:01Z</dcterms:available>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6182/1/Query_deforestation.pdf"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:title>Query deforestation</dcterms:title>
<dc:language>deu</dc:language>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6182"/>
<dc:contributor>Grust, Torsten</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Scholl, Marc H.</dc:contributor>
<dc:creator>Grust, Torsten</dc:creator>
<dcterms:abstract xml:lang="eng">The construction of a declarative query engine for a DBMS includes the challenge of compiling algebraic queries into efficient execution plans that can be run on top of the persistent storage. This work pursues the goal of employing foldr-build deforestation for the derivation of efficient streaming programs - programs that do not allocate intermediate data structures to perform their task - from algebraic (combinator) query plans. The query engine is based on the insertion representation of collections and base types, making the deforestation idea amenable to a wide range of type constructors and operators. In addition to the removal of intermediate data structures, deforestation actually implements certain algebraic optimizations for free. Query deforestation is a generally applicable technique that puts the derivation of streaming programs in a compact formal framework that should be immediately applicable.</dcterms:abstract>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:rights>terms-of-use</dc:rights>
</rdf:Description>
</rdf:RDF>