Indexing and query processing of XML documents

The Extensible Markup Words (XML) is starting to become the de facto standard for details description and swap over the web. Having to its ordered (recursive) and self-describing format, XML is versatile sufficient to convey a lot of avenues of data. To retrieve beneficial information from XML, issues expressed in query language such as XPath is used to specify some elements that fit a given criteria. An XPath expression is made up of a collection of area steps, each comprising an axis, a node test, and perhaps a predicate. An axis identifies the structural relationship between elements among two adjacent site steps. A node check allows restriction on the names or kinds of the factors selected in a spot step. A predicate specifies further criteria. In this dissertation, the indexing and query processing of XML paperwork are studied. First, we designed an effective indexing structure for XML documents so that each basic XPath axis step is protected. The indexing structure is constructed on top of the B+-tree that is available in practically all commercial relational database methods. For most of the basic axis steps, we are able to derive theoretical worst case execution time range.

Contents: Indexing and query processing of XML documents

1 Introduction

1.1 XML and XPath

1.2 Issues on XPath evaluation
1.3 Contribution and organization of the thesis
2 Relational Support for XPath Axes
2.1 Preliminaries
2.1.1 TheXPathaxes
2.1.2 Grust et al.’s Document Region
2.2 The Descendant, Preceding and Following Axes
2.2.1 Mapping Nodes to Intervals
2.2.2 Finding descendants, preceding and following nodes
2.3 The Ancestor Axis
2.3.1 RI-tree
22.3.2 FindingAncestors
2.4 TheLocalAxes
2.5 Handling Name Tests
2.6 Summary
2.7 ExperimentalEvaluation
2.7.1 Range Searching on B+-tree
2.7.2 Interval Queries of RI-Tree
2.7.3 Range Query on RI-Tree
3 Faster Twig Pattern Matching Using Extended Dewey ID
3.1 Problem Statement, Model and Notation
3.2 Extended Dewey ID and Some Intuition
3.3 Details of TJFaster
3.4 ComplexityAnalysis
3.5 Experimental Evaluation
3.5.1 Experimental setup
3.5.2 Datasets
3.5.3 Query
3.5.4 Results
4 Conclusion and Future Work
4.1 Conclusion
4.2 FutureWork