Study On Interconnection Relationship Compute For XML Fragments

In recent years,a new XML data called"XML data stream", widespread in some applications environment such as grid computing, security of data processing. In these applications user requirements the way of query on server, when the xml data stream arrives at the server,the filtering engine return the result of meet the user's query. However, compared with traditional XML data, because XML data streams have unlimited and real-time,the data processing must use the method of take it again.In this paper I studied the XML data stream is a XML fragment stream. The data stream make up of one or more XML data fragments and reach for the disorder.For the XML fragment'NFS query,because of the XML fragments stream have disorder and infinite. If you wait to all the fragments reached then meaningful judgments, so in time and space is completely impossible.So, this paper studies the method of Interconnection calculated on the XML fragments. Main contribution is the following three points:Proposed a classification of XML fragments, this study is based on the XML data stream,a XML data stream or XML fragments is not a complete XML document in great time, that some nodes will be missing the start or end tag,make the node can not be matched.XML query technologies become more sophisticated,the xml query'efficiently is related to the document's encoding mechanism, the previous encoding mechanism is base on complete document.So this paper has presented how to code for of XML fragments, and the combined method of XML ,code updates and the combined coding update, design a of a NFS query processing algorithms based on multi-stack.In the XML query,because it is fuzzy query so the result is mass,and most of the results is meaningless,how to filter the result of meaningless is important technology in XML query. The most common method is the calculation od Interconnection. This paper presents a more efficient method,make the query time have greatly reduced.