结构化P2P网络上基于类别树的索引机制

摘要

为解决结构化P2P系统的模糊检索问题,提出一种新的索引机制,构建并使用类别树对结点和实体进行标识.使用类别的静态描述产生查询请求；使用类别的动态描述优选下一跳结点,使查询始终围绕关键字列表逐步收敛到满足需求的P2P结点上.给出了分类树、静态描述和动态描述的存储、管理策略,避免了性能和可用性瓶颈.实验结果表明,该索引机制具有较好的检索效果,已成功应用于某服务计算平台.%To solve the fuzzy search problem existing in general structured P2P network,an improved indexing mechanism is proposed.Based on the classification tree established for a P2P system,the items and nodes are identified.Static descriptions of categories are used to create query request.Dynamic descriptions are used to filter out unwanted next hop nodes,which makes query converge gradually to the target node according to keys.The storage and management strategies for classification tree,static descriptions and dynamic descriptions are given,which avoid performance and availability bottleneck.This mechanism can achieve high rate of recall,which is proved by experiments,and has been successfully applied in a service computing platform for nearly one year.