首页 | 本学科首页   官方微博 | 高级检索  
     

基于B+树的分布式哈希表路由结构
引用本文:喻梅,吴普青,赵政,于健.基于B+树的分布式哈希表路由结构[J].计算机工程与应用,2008,44(1):135-137.
作者姓名:喻梅  吴普青  赵政  于健
作者单位:1.天津大学 计算机科学与技术学院,天津 300072 2.天津大学 电气与自动化学院,天津 300072
摘    要:在基于分布式哈希表构造的对等网络中,路由表的结构影响关键字的查询效率。B+树是一种有效查找的树型索引结构。考虑便于管理网络中众多的节点路由信息,提出一种基于B+树的路由结构,它通过为节点的路由信息建立索引,不仅提高了查询效率,将查找长度控制在树的高度内,而且使每个节点维护的路由信息尽可能少,减少了存储开销。

关 键 词:对等网络  分布式哈希表  B+树  索引  
文章编号:1002-8331(2008)01-0135-03
收稿时间:2007-07
修稿时间:2007年7月1日

Routing structure based on B+ tree in Distributed Hash Table
YU Mei,WU Pu-qing,ZHAO Zheng,YU Jian.Routing structure based on B+ tree in Distributed Hash Table[J].Computer Engineering and Applications,2008,44(1):135-137.
Authors:YU Mei  WU Pu-qing  ZHAO Zheng  YU Jian
Affiliation:1.School of Computer Science and Technology,Tianjin University,Tianjin 300072,China 2.School of Electronic Engineering and Automation,Tianjin University,Tianjin 300072,China
Abstract:In the peer-to-peer network based on Distributed Hash Table(DHT),the structure of routing table impacts the efficiency of searching keywords .B tree is a tree-index structure convenient for search.Routing structure based on B tree is presented in order to manage the routing information easily.B tree enhances the search efficiency by building the indexes to the routing information between nodes,and it can control the lookup length in the height of B tree.B tree index structure also decreases storage cost through making the maintained information of the nodes little as soon as possible.
Keywords:P2P  DHT(Distributed Hash Table)  B  tree  index
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号