Matching Twig Patterns in Uncertain XML Based on Ordered Pair
LIU Lixin
WANG Yongping
Abstract：As the current uncertain XML twig pattern queries do not solve the patent-child relationship effectively, this paper proposes ProOPCTwig algorithms based on ordered pair.The algorithm stores query tree and P-document by ordered pair.It compares the ordered pair of query tree pointed by pointer of stream nodes and the ordered pair with the same label in P-document to query.The main works include dealing with the distributed nodes effectively, calculating probability of every result, and improving efficiency of matching ordered pair.Theoretical analysis and experimental results prove the efficiency of ProOPCTwig.
Keywords：uncertain XML dataP-documenttwig patternpatent-child relationshipordered pair
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 492-497 )