Research On Query Process Technology For Continuous Uncertain XML

The solution proposed for the data format heterogeneity of the information exchangeprocess, XML technologies has been the standard of the data representation and datatransfer, IDC report shows that the IT departments of the500companies surveyed, morethan30%claim that they have made much use of XML database, thereby making efficientXML data management techniques become urgent research needs.In the economic,military, logistics, financial services, telecommunications and other application fields,because of inaccuracy of the original data set itself and in order to meet specificapplication purposes and uncertain information generated in the process of dealing withdata sets,the uncertain information are almost universal and play a key role, and thus makethe research of continuous uncertain XML data problems have greater practicalsignificance.Data query,analysis and process are the ultimate goal of the uncertain datamanagement, so to solve more types of query, and to develop more efficient query methodsare the important and key research objectives in XML data management.To solve the query processing problem of the continuous XML recording distributioncharacteristics of random variables which is called multidimensional continuous uncertainXML,an effective algorithm QueryMC based on Monte-Carlo method isproposed.According to the twig query pattern,the joint probability density funtion and theregion of query are identified.Furthermore the problem of query in QueryMC is modelledinto expectation of composite function by structuring random variables of uniformdistribution of the same region.It could be used to avoid the traditional dimensionalityreduction operation and to reduce the processing time by estimating the expectation withthe random sample set.And To solve the problem of the synchronous multiple internalquery processing algorithm for continuous uncertain XML which could easily lead to alarge time overhead,a twig pattern query algorithm QueryLSMC based on Monte Carlo ofleast squares method is proposed.The nodes in the path stack are processed based on queryrequest and traversal sequence,the intermediate results are matched and stored by interrelated lists.It could be used to avoid a large number of rectangle segments and toreduce the computation by fitting the function linearly with the random sample set.XML data sets are applied to the experiments to test the proposed query processingstrategies and are compared with the existing methods, the results show that the algorithmsare highly efficient with ideal precision.