XML queries differ from relational queries in that the former are expressed as path expressions. The efficient handling of structural relationships has become a key factor in XML query processing. Many index-based solutions have been proposed for efficient structural join in XML queries. This work explores the state-of-the-art indexes, namely, B +-tree, XB-tree and XR-tree, and analyzes how well they support XML structural joins. Experiment results indicate that all three indexes yield comparable performances for nonrecursive XML data, while the XB-tree outperforms the rest for highly recursive XML data. 1
Since the boom in new proposals on techniques for efficient querying of XML data is now over and the...
We study the problem of querying relational data embedded in XML. Relational data can be represented...
In recent years, the database community has seen many sophisticated Structural Join and Holistic Twi...
XML documents are typically queried with a combination of value search and structure search. While q...
Queries on XML documents typically combine selections on element contents, and, via path expressions...
Extensible Markup Language (XML) has become the de facto standard for data representation, exchange ...
Queries on XML documents typically combine selections on element contents, and, via path expressio...
XML data integration tools are facing a variety of challenges for their efficient and effective oper...
Various index structures have been proposed to speed up the evaluation of XML path expressions. How...
XML queries typically specify patterns of selection pred-icates on multiple elements that have some ...
A general XML index can itself be sizable leading to low efficiency. To alleviate this predicament, ...
Evaluating structural joins is a crucial operation for performance of XML queries. Proposed in this ...
As XML gains unqualified success through being adopted as a universal data exchange format, particul...
With the growing importance of XML as a format for data representation and data transport, being abl...
Supporting efficient access to XML data using XPath [3] continues to be an important research proble...
Since the boom in new proposals on techniques for efficient querying of XML data is now over and the...
We study the problem of querying relational data embedded in XML. Relational data can be represented...
In recent years, the database community has seen many sophisticated Structural Join and Holistic Twi...
XML documents are typically queried with a combination of value search and structure search. While q...
Queries on XML documents typically combine selections on element contents, and, via path expressions...
Extensible Markup Language (XML) has become the de facto standard for data representation, exchange ...
Queries on XML documents typically combine selections on element contents, and, via path expressio...
XML data integration tools are facing a variety of challenges for their efficient and effective oper...
Various index structures have been proposed to speed up the evaluation of XML path expressions. How...
XML queries typically specify patterns of selection pred-icates on multiple elements that have some ...
A general XML index can itself be sizable leading to low efficiency. To alleviate this predicament, ...
Evaluating structural joins is a crucial operation for performance of XML queries. Proposed in this ...
As XML gains unqualified success through being adopted as a universal data exchange format, particul...
With the growing importance of XML as a format for data representation and data transport, being abl...
Supporting efficient access to XML data using XPath [3] continues to be an important research proble...
Since the boom in new proposals on techniques for efficient querying of XML data is now over and the...
We study the problem of querying relational data embedded in XML. Relational data can be represented...
In recent years, the database community has seen many sophisticated Structural Join and Holistic Twi...