节点文献
IBFS:一种基于模式匹配索引路由的广度优先的资源搜索机制
IBFS—A Breadth First Source Searching Mechanism Based on Schema Matching Index Routing
【Author】 L(u|¨) Li’ang,Shen Derong,Li Meifang,Wang Guangqi,and Yu Ge (School of Information Science and Engineering,Northeastern University,Shenyang 110004)
【机构】 东北大学信息科学与工程学院;
【摘要】 目前,大多数的网格数据服务都是采用集中式注册和查找管理机制,容易导致服务器单点失败和访问瓶颈问题.随着网格规模的扩大,P2P对等模式将成为网格的主要框架结构.针对纯分布式无结构P2P网络框架的数据库网格的服务资源搜索机制进行研究,将网格数据服务描述信息的存储、数据服务的搜索以及查询结果的集成都分散到P2P网络中的各个节点上,充分利用了网络资源.结合已有改进的搜索机制和数据库网格服务的特点,提出了一种基于模式匹配索引路由的广度优先资源搜索机制IBFS,在查询数据服务过程中最早缩减查询路由分支,削减访问节点数量,缓解了P2P网络带宽吞噬问题,达到了快速而有效地为用户提供满意的查询结果的目的.
【Abstract】 Currently,most Grid Data Services adopt the centralized register and searching mechanism, which easily results in single peer failure and access bottleneck.With expanding of the network scale,P2P become one of the primary frameworks of the Grid.This paper focus on the service sources’ searching mechanism of Database-Grid within pure non-structural P2P network.Grid is combined with the P2P technique,and the phases of storing Grid Data Services description,and searching data services and data sources are dispersed to different peers,and finally,query result is integrated to certain peers of the P2P network,by which means the network resources are fully utilized.Also,referring to the existing improved searching mechanism and the features of Database-Grid services,a breadth first source searching mechanism based on schema matching index routing is proposed,with which the routing filiations are reduced as early as possible in the phase of searching data services,the number of the visited nodes is cut down,and the bandwidth licking up problem of P2P network is resolved.Therefore,the purpose of returning satisfying result to the user rapidly and efficiently is achieved.
【Key words】 grid; IBFS; P2P; grid data service; search route; schema matching;
- 【会议录名称】 第二十三届中国数据库学术会议论文集(研究报告篇)
- 【会议名称】第二十三届中国数据库学术会议
- 【会议时间】2006-11-10
- 【会议地点】中国广东广州
- 【分类号】TP391.3
- 【主办单位】中国计算机学会数据库专业委员会