XML Tree Pattern Matching Algorithms

V. S. N. Deepthi; A. Rajya Lakshmi; P. Suresh Babu

An XML database is a data persistence software system that allows data to be stored in XML format. This data can then be queried, exported and serialized into the desired format. XML databases are usually associated with document-oriented databases. The XML documents are usually modelled as trees and queries in XML query languages and are typically twig (or small tree) patterns with some nodes having value-based predicates. Therefore, finding all distinct matching’s of a twig pattern becomes a core operation in an XML query evaluation. This paper presents two algorithms for XML tree pattern matching. The TwigStack algorithm is used to compute answers to a query twig pattern. This algorithm solves the problem of larger intermediate results with decompositionmatching- merging methods. When the patterns have only ancestor-descendant edges, the intermediate result of each path matching is guaranteed to be part of the final result. The TreeMatch algorithm defines an extended XML tree pattern (twig) means P-C, A-D, negation, wildcard and order restriction. This algorithm provides tree matching for class Q/, //, *, class Q/, //, *,

Select Volume / Issues:

• Volume 3 Issue 5, Sept. 2012

Year:

2012

Type of Publication:

Article

Keywords:

Query processing; Tree pattern matching; Twigs; XML

Journal:

IJECCE

Volume:

3

Number:

5

Pages:

1234-1237

Month:

Sept.