Loading...
Please wait, while we are loading the content...
Similar Documents
XML Tree Pattern Matching Algorithms
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ambati, Lakshmi Tulasi. Murthy, Yelisetty S. S. R. Kavitha, S. |
| Copyright Year | 2012 |
| Abstract | In the present day digital world, it is imperative that all organizations and enterprises facilitate efficient processing of queries on XML data. XML queries typically specify patterns of selection predicates on multiple elements that have specified tree structured relationships. The primitive tree-structured relationships are parent-child and ancestordescendant. Finding all occurrences of these relationships in an XML database is a core operation for XML query processing. In this paper the pattern matching algorithms TwigStack and TwigStackList are discussed. The behavior of TwigStack is analyzed, and a comparison of these two algorithms is attempted. The TwigStack algorithm the initial holistic algorithm, has features of performing simultaneous scan over streams of XML nodes to match their structural relationships holistically, reducing a number of unnecessary intermediate results, and skipping XML nodes that will not contribute to final answers. The family of holistic pattern matching algorithms has appeared as the major important algorithms for processing XML query patterns due to its efficiency and performance advantage. The experimental results show that the query performance is significantly improved especially for queries having relatively more complex structures and/or higher selectivities. Keywords––Xml,TwigStack,TwigStackList; |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ijerd.com/paper/vol2-issue1/F02013945.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |