Optimization of Nested Queries Using the NF2 Algebra

Lade...
Vorschaubild
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2016
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
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
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data. New York, NY, USA: ACM, 2016, pp. 1765-1780. Available under: doi: 10.1145/2882903.2915241
Zusammenfassung

A key promise of SQL is that the optimizer will find the most efficient execution plan, regardless of how the query is formulated. In general, query optimizers of modern database systems are able to keep this promise, with the notable exception of nested queries. While several optimization techniques for nested queries have been proposed, their adoption in practice has been limited. In this paper, we argue that the NF2 (non-first normal form) algebra, which was originally designed to process nested tables, is a better approach to nested query optimization as it fulfills two key requirements. First, the NF2 algebra can represent all types of nested queries as well as both existing and novel optimization techniques based on its equivalences. Second, performance benefits can be achieved with little changes to existing transformation-based query optimizers as the NF2 algebra is an extension of the relational algebra.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
2016 ACM SIGMOD/PODS Conference : International Conference on Management of Data, 26. Juni 2016 - 1. Juli 2016, San Francisco, CA, USA
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690HÖLSCH, Jürgen, Michael GROSSNIKLAUS, Marc H. SCHOLL, 2016. Optimization of Nested Queries Using the NF2 Algebra. 2016 ACM SIGMOD/PODS Conference : International Conference on Management of Data. San Francisco, CA, USA, 26. Juni 2016 - 1. Juli 2016. In: SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data. New York, NY, USA: ACM, 2016, pp. 1765-1780. Available under: doi: 10.1145/2882903.2915241
BibTex
@inproceedings{Holsch2016Optim-33583,
  year={2016},
  doi={10.1145/2882903.2915241},
  title={Optimization of Nested Queries Using the NF<sup>2</sup> Algebra},
  publisher={ACM},
  address={New York, NY, USA},
  booktitle={SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data},
  pages={1765--1780},
  author={Hölsch, Jürgen and Grossniklaus, Michael 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/33583">
    <dc:creator>Scholl, Marc H.</dc:creator>
    <dcterms:title>Optimization of Nested Queries Using the NF&lt;sup&gt;2&lt;/sup&gt; Algebra</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-04-15T06:39:55Z</dcterms:available>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Grossniklaus, Michael</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Hölsch, Jürgen</dc:creator>
    <dcterms:issued>2016</dcterms:issued>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33583/3/Hoelsch_0-326767.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Hölsch, Jürgen</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33583/3/Hoelsch_0-326767.pdf"/>
    <dcterms:abstract xml:lang="eng">A key promise of SQL is that the optimizer will find the most efficient execution plan, regardless of how the query is formulated. In general, query optimizers of modern database systems are able to keep this promise, with the notable exception of nested queries. While several optimization techniques for nested queries have been proposed, their adoption in practice has been limited. In this paper, we argue that the NF&lt;sup&gt;2&lt;/sup&gt; (non-first normal form) algebra, which was originally designed to process nested tables, is a better approach to nested query optimization as it fulfills two key requirements. First, the NF&lt;sup&gt;2&lt;/sup&gt; algebra can represent all types of nested queries as well as both existing and novel optimization techniques based on its equivalences. Second, performance benefits can be achieved with little changes to existing transformation-based query optimizers as the NF&lt;sup&gt;2&lt;/sup&gt; algebra is an extension of the relational algebra.</dcterms:abstract>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/33583"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Grossniklaus, Michael</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-04-15T06:39:55Z</dc:date>
    <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
Ja
Begutachtet
Diese Publikation teilen