东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2005, Vol. 26 ›› Issue (6): 538-541.DOI: -

• 论著 • 上一篇    下一篇

XML数据聚簇技术研究

乔百友;王国仁;韩东红;赵相国   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳　110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2005-06-15 发布日期:2013-06-24
  • 通讯作者: Qiao, B.-Y.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60273079)

Study on techniques of clustering XML data

Qiao, Bai-You (1); Wang, Guo-Ren (1); Han, Dong-Hong (1); Zhao, Xiang-Guo (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2005-06-15 Published:2013-06-24
  • Contact: Qiao, B.-Y.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

661

摘要： 在分析DOM标准中数据访问的特点后,提出了两种XML数据聚簇存储方法:基于父子关系的XML数据聚簇存储方法和基于兄弟关系的XML数据聚簇存储方法·针对两种典型树遍历操作,分析了两种XML聚簇存储方法发生I/O的概率,给出了两种DOM树遍历路径表达式查询算法,即深度优先查询算法和宽度优先查询算法·基于XMark和XMach测试基准进行了性能评价·

关键词: XML, DOM树, 聚簇存储, 路径表达式, 遍历查询, 性能评价

Abstract: Analyzing the characteristics of data access in DOM standards, two methods are proposed for clustering XML data, which are based on the parent-child and sibling relationship separately. Then the probabilities of I/O occurrence of the two clustering methods are analyzed with respect to two typical operations of traversing over a tree, and two corresponding path expression algorithms to traverse over DOM tree are given, namely depth-first and breadth-first algorithms. A performance evaluation based on XMark and XMach is carried out as testing references.

中图分类号: