Accelerating XPath Evaluation in Any RDBMS

Grust, Torsten; Keulen, Maurice van; Teubner, Jens

Accelerating XPath Evaluation in Any RDBMS

Dateien

Accelerating_XPath_Location_Steps_in_Any_RBMDS_2004.pdfGröße: 406.14 KBDownloads: 639

Datum

2004

Autor:innen

Grust, Torsten

Keulen, Maurice van

Teubner, Jens

Publikationstyp

Zeitschriftenartikel

unikn.publication.listelement.citation.prefix.version.undefined

ACM Transactions on Database Systems (TODS). 2004, 29(1), pp. 91-131. Available under: doi: 10.1145/974750.974754

Zusammenfassung

This article is a proposal for a database index structure, the XPath accelerator, that has been specifically designed to support the evaluation of XPath path expressions. As such, the index is capable to support all XPath axes (including ancestor, following, preceding-sibling, descendant-or-self, etc.). This feature lets the index stand out among related work on XML indexing structures which had a focus on the child and descendant axes only. The index has been designed with a close eye on the XPath semantics as well as the desire to engineer its internals so that it can be supported well by existing relational database query processing technology: the index (a) permits set-oriented (or, rather, sequence-oriented) path evaluation, and (b) can be implemented and queried using well-established relational index structures, notably B-trees and R-trees. We discuss the implementation of the XPath accelerator on top of different database backends and show that the index performs well on all levels of the memory hierarchy, including disk-based and main-memory based database systems.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Main-memory databases, XML, XML indexing, XPath

Zitieren

ISO 690

GRUST, Torsten, Maurice van KEULEN, Jens TEUBNER, 2004. Accelerating XPath Evaluation in Any RDBMS. In: ACM Transactions on Database Systems (TODS). 2004, 29(1), pp. 91-131. Available under: doi: 10.1145/974750.974754

BibTex

@article{Grust2004Accel-6033,
  year={2004},
  doi={10.1145/974750.974754},
  title={Accelerating XPath Evaluation in Any RDBMS},
  number={1},
  volume={29},
  journal={ACM Transactions on Database Systems (TODS)},
  pages={91--131},
  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/6033">
    <dcterms:abstract xml:lang="eng">This article is a proposal for a database index structure, the XPath accelerator, that has been specifically designed to support the evaluation of XPath path expressions. As such, the index is capable to support all XPath axes (including ancestor, following, preceding-sibling, descendant-or-self, etc.). This feature lets the index stand out among related work on XML indexing structures which had a focus on the child and descendant axes only. The index has been designed with a close eye on the XPath semantics as well as the desire to engineer its internals so that it can be supported well by existing relational database query processing technology: the index (a) permits set-oriented (or, rather, sequence-oriented) path evaluation, and (b) can be implemented and queried using well-established relational index structures, notably B-trees and R-trees. We discuss the implementation of the XPath accelerator on top of different database backends and show that the index performs well on all levels of the memory hierarchy, including disk-based and main-memory based database systems.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:52Z</dc:date>
    <dc:format>application/pdf</dc:format>
    <dc:creator>Keulen, Maurice van</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:bibliographicCitation>First publ. in: ACM Transactions on Database Systems (TODS) ; 29 (2004), 1. - S. 91-131</dcterms:bibliographicCitation>
    <dc:contributor>Keulen, Maurice van</dc:contributor>
    <dc:contributor>Teubner, Jens</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:52Z</dcterms:available>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>2004</dcterms:issued>
    <dc:contributor>Grust, Torsten</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:language>eng</dc:language>
    <dc:creator>Teubner, Jens</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6033"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Grust, Torsten</dc:creator>
    <dcterms:title>Accelerating XPath Evaluation in Any RDBMS</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6033/1/Accelerating_XPath_Location_Steps_in_Any_RBMDS_2004.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6033/1/Accelerating_XPath_Location_Steps_in_Any_RBMDS_2004.pdf"/>
  </rdf:Description>
</rdf:RDF>