基于B＋树的分布式哈希表路由结构  

Routing structure based on B+ tree in Distributed Hash Table

作　　者：喻梅[1] 吴普青[2] 赵政[1] 于健[1] 

机构地区：[1]天津大学计算机科学与技术学院,天津300072 [2]天津大学电气与自动化学院,天津300072

出　　处：《计算机工程与应用》2008年第1期135-137,共3页Computer Engineering and Applications

摘　　要：在基于分布式哈希表构造的对等网络中,路由表的结构影响关键字的查询效率。B+树是一种有效查找的树型索引结构。考虑便于管理网络中众多的节点路由信息,提出一种基于B+树的路由结构,它通过为节点的路由信息建立索引,不仅提高了查询效率,将查找长度控制在树的高度内,而且使每个节点维护的路由信息尽可能少,减少了存储开销。In the peer-to-peer network based on Distributed Hash Table （DHT）,the structure of routing table impacts the effi- ciency of searching keywords.B＋ tree is a tree-index structure convenient for search.Routing structure based on B＋ tree is present- ed 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.

关 键 词：对等网络 分布式哈希表 B+树 索引 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]