Publikation:

Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps

Lade...
Vorschaubild

Dateien

Staircase_Join_2003.pdf
Staircase_Join_2003.pdfGröße: 281.77 KBDownloads: 1373

Datum

2003

Autor:innen

Grust, Torsten
Keulen, Maurice van
Teubner, Jens

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

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
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Proceedings of the 29th Conference on Very Large Databases (VLDB). 2003

Zusammenfassung

Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples. This text applies (and adapts) this successful principle to database-supported XML and XPath processing: the relational system is made tree aware, i.e., tree properties like subtree size, intersection of paths, inclusion or disjointness of subtrees are made explicit. We propose a local change to the database kernel, the staircase join, which encapsulates the necessary tree knowledge needed to improve XPath performance.
Staircase join operates on an XML encoding which makes this knowledge available at the cost of simple integer operations (e.g., +;6). We finally report on quite promising experiments with a staircase join enhanced main-memory database kernel.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

VLDB, Sept. 2003, Berlin
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690GRUST, Torsten, Maurice van KEULEN, Jens TEUBNER, 2003. Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps. VLDB. Berlin, Sept. 2003. In: Proceedings of the 29th Conference on Very Large Databases (VLDB). 2003
BibTex
@inproceedings{Grust2003Stair-6352,
  year={2003},
  title={Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps},
  booktitle={Proceedings of the 29th Conference on Very Large Databases (VLDB)},
  author={Grust, Torsten and Keulen, Maurice van and Teubner, Jens}
}
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/6352">
    <dc:creator>Keulen, Maurice van</dc:creator>
    <dcterms:issued>2003</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6352/1/Staircase_Join_2003.pdf"/>
    <dcterms:abstract xml:lang="eng">Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples. This text applies (and adapts) this successful principle to database-supported XML and XPath processing: the relational system is made tree aware, i.e., tree properties like subtree size, intersection of paths, inclusion or disjointness of subtrees are made explicit. We propose a local change to the database kernel, the staircase join, which encapsulates the necessary tree knowledge needed to improve XPath performance.&lt;br /&gt;Staircase join operates on an XML encoding which makes this knowledge available at the cost of simple integer operations (e.g., +;6). We finally report on quite promising experiments with a staircase join enhanced main-memory database kernel.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <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:12:00Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Grust, Torsten</dc:creator>
    <dc:contributor>Keulen, Maurice van</dc:contributor>
    <dc:creator>Teubner, Jens</dc:creator>
    <dc:format>application/pdf</dc:format>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6352/1/Staircase_Join_2003.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:00Z</dcterms:available>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:rights>terms-of-use</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6352"/>
    <dc:contributor>Teubner, Jens</dc:contributor>
    <dcterms:title>Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps</dcterms:title>
    <dc:contributor>Grust, Torsten</dc:contributor>
    <dcterms:bibliographicCitation>First publ. in: Proceedings of the 29th Conference on Very Large Databases (VLDB), Berlin, Sept. 2003</dcterms:bibliographicCitation>
  </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
Begutachtet
Diese Publikation teilen