| XML数据聚簇技术研究 |
| |
| 引用本文： | 乔百友,王国仁,韩东红,赵相国.XML数据聚簇技术研究[J].东北大学学报(自然科学版),2005,26(6):538-541. |
| |
| 作者姓名： | 乔百友 王国仁 韩东红 赵相国 |
| |
| 作者单位： | 东北大学,信息科学与工程学院,辽宁,沈阳,110004 |
| |
| 摘 要： | 在分析DOM标准中数据访问的特点后,提出了两种XML数据聚簇存储方法:基于父子关系的XML数据聚簇存储方法和基于兄弟关系的XML数据聚簇存储方法·针对两种典型树遍历操作,分析了两种XML聚簇存储方法发生I/O的概率,给出了两种DOM树遍历路径表达式查询算法,即深度优先查询算法和宽度优先查询算法·基于XMark和XMach测试基准进行了性能评价·
|
| 关 键 词： | XML DOM树 聚簇存储 路径表达式 遍历查询 性能评价 |
| 文章编号： | 1005-3026(2005)06-0538-04 |
| 修稿时间： | 2004年9月16日 |
Study on Techniques of Clustering XML Data |
| |
| QIAO Bai-you,WANG Guo-ren,HAN Dong-hong,ZHAO Xiang-guo.Study on Techniques of Clustering XML Data[J].Journal of Northeastern University(Natural Science),2005,26(6):538-541. |
| |
| Authors: | QIAO Bai-you WANG Guo-ren HAN Dong-hong ZHAO Xiang-guo |
| |
| Institution: | (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China |
| |
| 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. |
| |
| Keywords: | XML |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文 |
