The object data standard: ODMG 3.0
The object data standard: ODMG 3.0
Path materialization revisited: an efficient storage model for XML data
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
XBase: making your gigabyte disk queriable
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XQuery formal semantics state and challenges
ACM SIGMOD Record
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
VXMLR: A Visual XML-Relational Database System
Proceedings of the 27th International Conference on Very Large Data Bases
Quilt: An XML Query Language for Heterogeneous Data Sources
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query optimization in XML structured-document databases
The VLDB Journal — The International Journal on Very Large Data Bases
A transaction mechanism for native XML database
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Accelerating XML structural join by partitioning
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Extending XML with nonmonotonic multiple inheritance
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
Regular path expression is one of the core components of XML query languages, and several approaches to evaluating regular path expressions have been proposed. In this paper, a new path expression evaluation approach, extent join, is proposed to compute both parent-children ('/') and ancestor-descendent ('//') connectors between path steps. Furthermore, two path expression optimization rules, pathshortening and path-complementing, are proposed. The former reduces the number of joins by shortening the path while the latter optimizes the execution of a path by using an equivalent complementary path expression to compute the original path. Experimental results show that the algorithms proposed in this paper are much more efficient than conventional ones.