连续不确定XML数据查询处理算法  

Query processing algorithm for continuous uncertain XML data

作　　者：张晓琳[1] 霍伟[1] 刘立新[1] 崔光月[1] 

机构地区：[1]内蒙古科技大学信息工程学院,内蒙古包头014010

出　　处：《计算机工程与设计》2013年第7期2426-2430,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(61163015);内蒙古自然科学基金重点项目(20080404Zd21)

摘　　要：针对目前连续不确定XML数据同步多区间的查询处理算法易造成较大时间开销的问题,提出一种基于蒙特卡洛最小二乘思想的小枝模式查询处理算法QueryLSMC。算法根据查询请求依节点遍历序列顺序处理路径栈中节点,利用链表匹配并存储中间结果,通过构造随机样本集线性拟合目标节点中的连续分布函数,避免了对大量矩形分段的处理,有效地减少了计算量。实验结果表明,在取得理想精度的同时,该算法具有高效性。To solve the problem of the synchronous multiple internal query processing algorithm for continuous uncertain XML which could easily lead to a large time overhead, a twig pattern query algorithm QueryLSMC based on Monte Carlo of least squares method is proposed. The nodes in the path stack are processed based on query request 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 to reduce the computation hy fitting the function linearly with the random sample set. Meanwhile, the results show that the algorithm is highly efficient with ideal precision.

关 键 词：连续不确定XML 蒙特卡洛最小二乘 小枝模式查询 随机样本集 线性拟合 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]