HR-Tree——一种基于P2P端点的XML树型索引方法

HR-Tree——a XML Index Applied on P2P Platform

提出一种应用在P2P平台上的XML索引方法HR-Tree。HR-Tree索引方法首先利用区域划分的方法对于XML数据进行处理,再使用散列的方法把数据进行分类,最后利用HR-Tree树建立索引。和XR-Tree等索引方法相比,HR-Tree查询更为灵活,更能满足P2P各端点查询的要求。实验表明,该算法在XML数据的查询处理上是一个有效的方法。

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.