首页 | 官方网站   微博 | 高级检索  
     

基于并行子树构建的XML解析方法
引用本文:陈荣鑫,廖湖声,陈维斌.基于并行子树构建的XML解析方法[J].计算机科学,2011,38(3):191-194,235.
作者姓名:陈荣鑫  廖湖声  陈维斌
作者单位:1. 北京工业大学计算机学院,北京,100124;大学计算机工程学院,厦门,361021
2. 北京工业大学计算机学院,北京,100124
3. 华侨大学计算机学院,泉州,362021
基金项目:本文受福建省自然科学基金项目(2008J04005)和北京市自然科学基金项目(4082003)资助。
摘    要:XML解析的高耗时特点制约着XML应用系统整体性能的提高,并行化是一种重要的优化手段。现有的并行XML解析算法存在的问题是需要通过预处理进行数据划分,才能实现分片并行完全解析处理。预处理往往很耗时,若进行优化处理,则实现复杂。提出的方法可实现对XML数据任意分片直接进行解析,并行构建各个片断中的子树,再通过子树合并获得全局的文档树。实验结果表明该方法能有效利用多核计算环境,并行实现XML解析。

关 键 词:XML解析,子树构建,并行,多核

XML Parsing Schema Based on Parallel Sub-tree Construction
CHEN Rong-xin,LIAO Hu-sheng,CHEN Wei-bin.XML Parsing Schema Based on Parallel Sub-tree Construction[J].Computer Science,2011,38(3):191-194,235.
Authors:CHEN Rong-xin  LIAO Hu-sheng  CHEN Wei-bin
Affiliation:((,allege of Computer Science,Beijing University of Technology,Beijing 100124,China)(Computer Engineering College,Jimei University,Xiamen 361021 ,China)(Computer Science College, Huaqiao University, Quanzhou 362021, China)
Abstract:Abstract Since XML parsing is time-consuming operation which greatly affects the performance of XML application,parallclization is an important optimization measure. Existing parsing methods need prcparsing stage to ensure proper data partition so as to complete XML segments parsing in parallel, however, pre-parsing tends to be long-running and Rdifficult to be optimized. This paper presented a schema which supports parallel suB-tree construction upon arbitrary XML segments. Sub-trees were merged to form whole XML tree in final stage. Experiment results indicate that our schema can efficiently realize parallel XML parsing in multi-core environment.
Keywords:XML parsing  Sulrtrec construction  Parallel  Multi core
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号