| HR-Tree——一种基于P2P端点的XML树型索引方法 |
| |
| 引用本文： | 程崇燕,包小源,宋爽.HR-Tree——一种基于P2P端点的XML树型索引方法[J].微电子学与计算机,2007,24(9):72-74. |
| |
| 作者姓名： | 程崇燕 包小源 宋爽 |
| |
| 作者单位： | 天津师范大学,计算机与信息工程学院,天津,300387 |
| |
| 摘 要： | 提出一种应用在P2P平台上的XML索引方法HR-Tree。HR-Tree索引方法首先利用区域划分的方法对于XML数据进行处理,再使用散列的方法把数据进行分类,最后利用HR-Tree树建立索引。和XR-Tree等索引方法相比,HR-Tree查询更为灵活,更能满足P2P各端点查询的要求。实验表明,该算法在XML数据的查询处理上是一个有效的方法。
|
| 关 键 词： | 区域划分 |
| 文章编号： | 1000-7180（2007）09-0072-03 |
| 修稿时间： | 2007-04-28 |
HR-Tree-a XML Index Applied on P2P Platform |
| |
| CHENG Chong-yan,BAO Xiao-yuan,SONG Shuang.HR-Tree-a XML Index Applied on P2P Platform[J].Microelectronics & Computer,2007,24(9):72-74. |
| |
| Authors: | CHENG Chong-yan BAO Xiao-yuan SONG Shuang |
| |
| Affiliation: | Computer and Information Engineering College, Tianjin Normal University, Tianjin 300387, China |
| |
| Abstract: | P2P is a very popular communication way on Web. XML is a method of data expressing and communicating on Internet. HR-Tree index first deals with XML data with range partitioning, then label the data based on hashing, finally construct the index using HR-Tree. Compared with other index such as XR-Tree and so on, the query on the HR-Tree is more flexible and accords with the P2P query. The experiment shows that this algorithm is an effective method on the XML query. |
| |
| Keywords: | HR-Tree P2P |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
