UCSY's Research Repository

XML Twig Pattern Matching Processing

Show simple item record

dc.contributor.author Thet, Yi Mon
dc.date.accessioned 2019-11-14T06:34:01Z
dc.date.available 2019-11-14T06:34:01Z
dc.date.issued 2012-02-28
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/2405
dc.description.abstract Finding all occurrences of a twig pattern query is a core operation of XML query processing system. Many algorithms have been proposed. Existing algorithms generate individual path matches and then stitch them together through a merge operation to form twig matches. Due to the merging operation they have very expensive cost. To avoid the merging cost, many one phase algorithms have been proposed. However, these algorithms are quite efficient for queries with only ancestor-descendent relationship. TwigMMatch algorithm is proposed. Like Holistic TwigStack, a chain of linked stacks is applied to process the twig matches. The proposed algorithm not only avoids the merging process but also process the twig queries with mixed edges. en_US
dc.language.iso en_US en_US
dc.publisher Tenth International Conference On Computer Applications (ICCA 2012) en_US
dc.subject a twig pattern query en_US
dc.subject parent-child and ancestor-descendant relationship en_US
dc.title XML Twig Pattern Matching Processing en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account