Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases

Seah, Boon-Siew; Widjanarko, Klarinda G.; Bhowmick, Sourav S.; Choi, Byron; Leonardi, Erwin

doi:10.1007/978-3-540-71703-4_66

Cited by 7 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, consider the query Q4: //team [founded <'1970']/rank-distance ::name [1,3] on the document in Figure 1(a). It returns the nodes e 1 , e 8 , e 11 , and e 14 . These nodes contain information related to the name of the league, the names of teams which were founded before 1970, and their players' names.…”

Section: Rank-distance Axismentioning

confidence: 99%

“…Our proposed algorithm for evaluation of a rank-distance axis is built on top of the SUCXENT++ system [3,11], a treeunaware relational approach designed primarily for read-mostly workloads. Different from other encoding schemes, namely prepost encoding and Dewey numbering [5], SUCXENT++ uses a novel numbering scheme that only explicitly encodes the leaf nodes and the levels of the XML tree.…”

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

“…The SiblingSum attribute is introduced to evaluate position predicates with name test. The reader may refer to [3,11] for detailed description of these attributes and the role they play in XPath evaluation. This encoding information is captured by the schema of SUCXENT++ as shown below.…”

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

“…Next, the algorithm invokes the SQL translation algorithm for the XPath expression without a rank-distance axis in Line 02 in Algorithm 1. Since this algorithm has already been described in [3,11], we do not elaborate on this further. Here we focus our attention on the translation of the rank-distance axis component.…”

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

“…Line 38 sorts the result according to the document order. Line 39 enforces the join order option due to performance benefits as highlighted in [6,11].…”

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

See 4 more Smart Citations

Towards non-directional Xpath evaluation in a RDBMS

Bhowmick

Dyreson

Leonardi

et al. 2009

Proceedings of the 18th ACM Conference on Information and Knowledge Management

Self Cite

View full text Add to dashboard Cite

XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when evaluated on the same data in a different structure. This paper extends path expressions with a new non-directional axis called the rank-distance axis. Given a context node and two positive integers α and β, the rank-distance axis returns those nodes that are ranked between α and β in terms of closeness from the context node in any direction. This paper shows how to evaluate the rank-distance axis in a tree-unaware XML database. A tree-unaware implementation does not invade the database kernel to support XML queries, instead it uses an existing RDBMS such as Microsoft's SQL server as a back-end and provides a front-end layer to translate XML queries to SQL. This paper presents an overview of an algorithm that translates queries with a rank-distance axis to SQL.

show abstract

Section: Rank-distance Axismentioning

confidence: 99%

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

“…Line 38 sorts the result according to the document order. Line 39 enforces the join order option due to performance benefits as highlighted in [6,11].…”

Section: Overview Of Rank-distance Axis Evaluationmentioning

confidence: 99%

See 3 more Smart Citations