基于序列的不确定XML整体小枝查询技术

Abstract

Abstract:

In view of the problem that reduces the query efficiency since sequence-based algorithm of uncertain XML twig pattern matching PrTRIM(Probabilistic TRee Indexing and Matching) needs two stages of subsequence matching and structure matching.H-PrTRIM(Holistic Probabilistic TRee Indexing and Matching) algorithm based on PrTRIM algorithm is thus proposed. It merges subsequence matching and structure matching that in PrTRIM algorithm into one and carries out subsequence matching and structure matching at the same time in H-PrTRIM algorithm. Hence the result of subsequence matching is the final result of query. The problem that reduces the query efficiency since too much intermediate results of subsequence matching is solved. The results of experiment show that H-PrTRIM algorithm is more efficient than PrTRIM algorithm and has advantages in the case of querying large documents and complex query.

Key words: uncertain XML;sequence;holistic twig pattern

CLC Number:

TP392

WANG Peng, ZHANG Xiao-Lin. A Technology of Uncertain XML Sequence-based Holistic Twig Pattern Matching[J]., 2013, 26(11): 146-.

A Technology of Uncertain XML Sequence-based Holistic Twig Pattern Matching

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 1

Metrics

Comments

Recommended 0