###
DOI:
计算机系统应用英文版:2012,21(12):108-112,107
本文二维码信息
码上扫一扫!
EEXPSort-树形数据的高能效外存排序算法
(1.浙江工业大学 计算机科学与技术学院, 杭州 310014;2.浙江省可视媒体智能处理技术研究重点实验室, 杭州 310014)
EEXPSort-an Energy-Efficient Sorting Algorithm for Hierarchical Data in External Memory
(1.School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310014, China;2.Key Laboratory of Visual Media Intelligent Process Technology of Zhejiang Province, Hangzhou 310014, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1529次   下载 2927
Received:May 03, 2012    Revised:June 07, 2012
中文摘要: 树形数据排序是XML数据处理中一个基本问题. 提出了一种XML文档高能效排序算法―EEXPSort. 该算法扫描XML 文档产生相互独立的排序任务, 利用多核CPU 对排序任务进行并行处理; 同时采用数据压缩、单临时文件存储以及避免子树匹配等策略, 有效地减少磁盘IO 和CPU 操作时间. 对不同特性的XML 文档开展了大量比较实验, 结果表明所提算法能效优于现有性能最好的树形数据排序算法HERMES.
中文关键词: XML 文档  树形数据  能效  排序算法  优化策略
Abstract:A fundamental problem in XML data handling is hierarchical data sorting. This paper presents an energyefficient sorting algorithm called EEXPSort for XML document. It exploits multi-core CPU to parallelize the executions of the mutually independent tasks generated by scanning the XML document; For energy-efficiency, it employs data compression, single temporary-file storage and avoidance of tree-matching to effectively reduce disk IOs and CPU process. Extensive experiments on XML documents with different characteristics show that EEXPSort outperforms the existing quickest XML sorting schemes HERMES significantly in energy-efficiency and performance.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(61070042);浙江省自然科学基金(Y1090096)
引用文本:
王靖,周煜超,龚卫华,杨良怀.EEXPSort-树形数据的高能效外存排序算法.计算机系统应用,2012,21(12):108-112,107
WANG Jing,ZHOU Yu-Chao,GONG Wei-Hua,YANG Liang-Huai.EEXPSort-an Energy-Efficient Sorting Algorithm for Hierarchical Data in External Memory.COMPUTER SYSTEMS APPLICATIONS,2012,21(12):108-112,107