分布式XML Twig查询处理方法  

Distributed XML Twig query processing method

作　　者：何志学[1,2] 廖湖声[1] 王静 

机构地区：[1]北京工业大学计算机学院,北京100124 [2]北华航天工业学院计算机与遥感信息技术学院,河北廊坊065000

出　　处：《计算机工程与设计》2016年第1期123-126,210,共5页Computer Engineering and Design

基　　金：北京市自然科学基金项目(4122011);河北省教育厅青年基金项目(QN2014178);北华航天工业学院科研基金项目(KY-2014-09);校级科技创新团队基金项目(XJTD20140)

摘　　要：在单机环境下,难以处理半结构化XML大数据查询,为此分析Twig查询的结构匹配特征,基于MapReduce编程模型,提出TwigMRR算法对XML Twig查询进行分布式处理。对XML数据进行Dewey编码,水平切分后存储于分布式文件系统,通过执行Map-Reduce-Reduce任务对Twig分解后的线性路径查询进行分布式并行计算以取得结果。实验结果验证了该算法的有效性和完整性,与类似算法的比较结果表明了其在处理效率方面的优势。To deal with the difficulties of large-scale XML query processing in single computer unit,Twig query structure matching features were analyzed,TwigMRR algorithm was proposed for XML Twig queries distributed processing based on MapReduce program model.XML data were stored into distributed file system after encoded using Dewey and partitioned horizontally.Map-Reduce-Reduce tasks were executed to evaluate the linear path queries generated with the divided Twig.The experimental results show that the proposed approach is efficient and scalable,and it is more effective than other related works.

关 键 词：分布式计算 TWIG查询 MAPREDUCE模型 XML数据 HADOOP平台 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]