Query deforestation

dc.contributor.authorGrust, Torstendeu
dc.contributor.authorScholl, Marc H.
dc.date.accessioned2011-03-24T16:10:01Zdeu
dc.date.available2011-03-24T16:10:01Zdeu
dc.date.issued1998deu
dc.description.abstractThe 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.eng
dc.description.versionpublished
dc.format.mimetypeapplication/pdfdeu
dc.identifier.ppn117299677deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/6182
dc.language.isodeudeu
dc.legacy.dateIssued2005deu
dc.relation.ispartofseriesKonstanzer Schriften in Mathematik und Informatik
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subject.ddc004deu
dc.titleQuery deforestationdeu
dc.typeWORKINGPAPERdeu
dspace.entity.typePublication
kops.bibliographicInfo.seriesNumber68deu
kops.citation.bibtex
@techreport{Grust1998Query-6182,
  year={1998},
  series={Konstanzer Schriften in Mathematik und Informatik},
  title={Query deforestation},
  number={68},
  author={Grust, Torsten and Scholl, Marc H.}
}
kops.citation.iso690GRUST, Torsten, Marc H. SCHOLL, 1998. Query deforestationdeu
kops.citation.iso690GRUST, Torsten, Marc H. SCHOLL, 1998. Query deforestationeng
kops.citation.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>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographyfalse
kops.identifier.nbnurn:nbn:de:bsz:352-opus-14662deu
kops.opus.id1466deu
kops.relation.seriesofconstanceKonstanzer Schriften in Mathematik und Informatik
relation.isAuthorOfPublication79d29015-25f9-4ec2-bc8e-77a0c07303ba
relation.isAuthorOfPublication.latestForDiscovery79d29015-25f9-4ec2-bc8e-77a0c07303ba
relation.isSeriesOfPublicationea66d95a-84e6-4c61-b6cd-bb04093953bb
relation.isSeriesOfPublication.latestForDiscoveryea66d95a-84e6-4c61-b6cd-bb04093953bb

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Query_deforestation.pdf
Größe:
270.9 KB
Format:
Adobe Portable Document Format
Query_deforestation.pdf
Query_deforestation.pdfGröße: 270.9 KBDownloads: 118