Abstract
| Original language | English |
|---|---|
| Pages (from-to) | 91-131 |
| Number of pages | 41 |
| Journal | ACM transactions on database systems |
| Volume | 29 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Mar 2004 |
Fingerprint
Keywords
- XPath
- DB-PRJPF: PATHFINDER
- DB-XMLDB: XML DATABASES
- XML
- Main-memory databases
- XML indexing
Cite this
}
Accelerating XPath Evaluation in Any RDBMS. / Grust, Torsten; van Keulen, Maurice; Teubner, Jens.
In: ACM transactions on database systems, Vol. 29, No. 1, 03.2004, p. 91-131.Research output: Contribution to journal › Article › Academic › peer-review
TY - JOUR
T1 - Accelerating XPath Evaluation in Any RDBMS
AU - Grust, Torsten
AU - van Keulen, Maurice
AU - Teubner, Jens
PY - 2004/3
Y1 - 2004/3
N2 - 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.
AB - 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.
KW - XPath
KW - DB-PRJPF: PATHFINDER
KW - DB-XMLDB: XML DATABASES
KW - XML
KW - Main-memory databases
KW - XML indexing
U2 - 10.1145/974750.974754
DO - 10.1145/974750.974754
M3 - Article
VL - 29
SP - 91
EP - 131
JO - ACM transactions on database systems
JF - ACM transactions on database systems
SN - 0362-5915
IS - 1
ER -