Research On Query Method Of Fuzzy XML Data Based On Index

As the next Web language, XML becomes the criterion of message expression and exchange currently. XML message increases explosively with the widely application of XML. At the same time, some message has fuzziness in nature because of the existence of subjectivity. How to answer a query under fuzzy XML context becomes an important problem.Twig query mode is always used to present the nodes and the relations of these nodes that people show their interest. Finding out these nodes is the process of twig mode query. The same message may have different structure because of different organization. This reason leads to two conditions when process query. These two conditions are isomorphic condition and isomerous condition. When deal with a twig mode query under fuzzy XML conditions, on one hand, previous algorithm has low efficiency under isomorphic condition, on the other hand, previous algorithm can not process twig mode query under isomerous condition. According to these problems, this paper comes up with the fuzzy XML data query algorithm based on index.Aimed at the problem under isomorphic condition, this paper improves the previous algorithm and builds index on the new algorithm. In allusion to the problem under isomerous condition, this paper brings forward a new algorithm and builds index on the new algorithm. The new algorithm can process the twig mode query under isomerous condition successfully. At last, on one hand, we prove that the new algorithm has better efficiency than previous algorithm and the index algorithm has better efficiency than the new algorithm through experiment under isomorphic condition; on the other hand, we prove that the new algorithm can process the twig mode query and the index algorithm has better efficiency than the new algorithm under isomerous condition.