Accelerating XPath Evaluation in Any RDBMS

Cite This

Files in this item

Checksum: MD5:b46b61a8c82508c738a88cb199355ba8

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

@article{Grust2004Accel-6033, title={Accelerating XPath Evaluation in Any RDBMS}, year={2004}, doi={10.1145/974750.974754}, 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 xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:bibliographicCitation>First publ. in: ACM Transactions on Database Systems (TODS) ; 29 (2004), 1. - S. 91-131</dcterms:bibliographicCitation> <dc:rights>terms-of-use</dc:rights> <dc:format>application/pdf</dc:format> <dcterms:issued>2004</dcterms:issued> <dc:contributor>Teubner, Jens</dc:contributor> <dc:date rdf:datatype="">2011-03-24T16:08:52Z</dc:date> <dc:contributor>Grust, Torsten</dc:contributor> <dc:contributor>Keulen, Maurice van</dc:contributor> <dcterms:available rdf:datatype="">2011-03-24T16:08:52Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Keulen, Maurice van</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dcterms:hasPart rdf:resource=""/> <bibo:uri rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:title>Accelerating XPath Evaluation in Any RDBMS</dcterms:title> <dc:language>eng</dc:language> <dcterms:rights rdf:resource=""/> <dc:creator>Teubner, Jens</dc:creator> <dspace:hasBitstream rdf:resource=""/> <dc:creator>Grust, Torsten</dc:creator> <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> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Accelerating_XPath_Location_Steps_in_Any_RBMDS_2004.pdf 1025

This item appears in the following Collection(s)

Search KOPS


My Account