Research On Twig Pattern Matches In Fuzzy XML

There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set available for visualizing and processing information encoded in this universal standard. In this thesis, we explore the additional and unique benefits achieved by this approach on fuzzy database applications. At the same time, information is often vague or ambiguous in the real world applications. Some data are inherently fuzzy since their values are subjective in the real applications. For example, consider values representing the satisfaction degree for a film, different person may have different satisfaction degree. This leads to be an inevitable consequence that the satisfaction degree is imprecise and uncertain.As the next generation of the Web language, XML is straightforwardly usable, which has been the de-facto standard of information representation and exchange over the Web. The existed works fall short in their ability to model imprecise and uncertain data using XML. In this paper, we propose a new fuzzy XML data model based on XML Schema. With the model used, the fuzzy information in XML documents can be represented naturally. Along with the model, an associated algebra is presented formally. We also introduce how to use our algebra to capture queries expressed in XQuery. It shows that this model and algebra can establish a firm foundation for publishing and managing the histories of fuzzy data on the Web.In order to find all occurrences of a twig pattern in XML database, a considerable amount of twig pattern matching algorithms have been proposed. Previous work mainly focuses on twig pattern query under the complete semantics. It falls short in their ability to support twig pattern query under different semantics in fuzzy XML. In this paper, we further study the problem of twig matches in fuzzy XML. We begin by introducing the extended region scheme to accurately and effectively represent nodes information in fuzzy XML. We then discuss the fuzzy query semantics and compute the membership information by using Einstein operator instead of Zadeh's min-max technique. On the basic, two efficient algorithms for querying twig under complete and incomplete semantics in fuzzy XML are proposed. The experimental results show that our proposed algorithms can perform on the fuzzy twig pattern matching efficiently.