Loading...
Please wait, while we are loading the content...
Similar Documents
A Rapid Tree Pattern Matching Algorithm for XML Query
| Content Provider | Semantic Scholar |
|---|---|
| Author | Tech, Persuing M. |
| Copyright Year | 2012 |
| Abstract | Finding all distinct matching’s of the query tree pattern is the main operation of XML query evaluation. The existing methods we research a large set of XML tree pattern, called extended XML tree pattern, which may include P-C, A-D relationships, negation functions, wildcards and order restriction. We establish a theoretical framework about "matching cross" which demonstrates the intrinsic reason in the proof of optimality on holistic algorithms for tree pattern matching are decomposition matching-merging processes, which may produce large useless intermediate result or require repeated matching of some sub-patterns. We propose a fast tree pattern matching algorithm called TreeMatch to directly find all distinct matchings of a query tree pattern. The only requirement for the data source is that the matching elements of the non-leaf pattern nodes do not contain subelements with the same tag. The TreeMatch does not produce any intermediate results and the final results are compactly encoded in stacks, from which the explicit representation can be produced efficiently. It can effectively control the size of intermediate results during query processing. Keywords— leaf pattern, Query processing, XML, algorithms, tree pattern , Query patterns. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://recentscience.org/article/uploadfiles/A%20Rapid%20Tree%20Pattern%20Matching%20Algorithm%20for%20XML%20Query4_26692707.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
