Dynamic Discovery Of Incomplete Information In XML

Nowadays, more and more data is storing, integrating, publishing and exchanging online. As XML has the feature of cross platform, easy to use, etc., it is widely accepted in a short time. In many fields, XML has become a leading standard of data express and exchange. XML, as a representation model of semi-structured data, has strong ability of performance information. It can express structured data and non-structural one. But in the real world, there is always some incomplete information, especially in the data exchange process, which is caused by the difference of XML models. This incomplete information will adversely affect on the XML database's connections and queries. So, it becomes especially important to discovery of incomplete information appearing in these XML documents and treatment it correctly.Currently, researchers' works focus on the theoretical research of incomplete information in XML. They pay a lot of attention to reason the rules of function dependences (FD). But, for the effective discovery of FDs about incomplete information and complete it by those FDs, there is not much deeply research. Based on current research state, this paper focus on effective find and complete the incomplete information in XML data. Through our studies, XML documents can further enhance the ability to express the real world. Then promote the combination of theoretical and practical and generate enormous economic benefits.In this paper, the adoption of a complete example shows how to analyze the XML document itself, to identify interesting FDs. Then use these FDs to discover the incomplete information in XML data and complete it. Our research works are shown as below:1. We introduce the incomplete information and the related concepts into XML, that is to say, when a tree have some nodes which values are null, this tree become a incomplete tree, and from this, we can get the concepts of tree tuple, tuple class, etc.2. By compare the XML Schema and DTD's strengths and weaknesses, explained why we selected XML Schema as the basis of the study.3. In order to find the interesting FDs, this paper presents DiscoverFDs algorithm. This algorithm focuses on incomplete information. By comparing attribute partitions of XML documents, it dynamic discoveries interesting FDs. DiscoverFDs algorithm is a powerful tool for our research, and is the key point of this paper.4. According to the interesting FDs, we can analyze data in the XML database, and complete the incomplete information by using XMLChase algorithm.