Lixin Liu
Abstract
A twig matching algorithm called TwigPM was presented for XML data stream with complex recursive hierarchical structure.By obtaining the structure of relationships among query node,effective pruning operation was carried out.It reduced the processing time and data storage.The experimental results showed that the algorithm was efficient.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A twig matching algorithm called TwigPM was presented for XML data stream with complex recursive hierarchical structure.By obtaining the structure of relationships among query node,effective pruning operation was carried out.It reduced the processing time and data storage.The experimental results showed that the algorithm was efficient.
Key concepts: Twig, XML, Pruning, Computer science, Data structure, Node (physics), Matching (statistics), XML database