由于当前的基于DHT的P2P系统在语言搜索方面都有很大的限制,因此建立一种恰当的既具有语言能力又有伸缩性的语言覆盖P2P网络是一种挑战.文中提出一种介于DHT和支持关键字序列查找的语言覆盖之间的中间层DST覆盖网,通过DHT获取并返回给DST覆盖网相应的处理和索引数组,由DST实现关键字序列查找.分析表明它的时间复杂度与关键字序列的长度成线性关系,实验证明在P2P网络上使用基于DST的搜索获得一个确切的文本的查找具有快速性、负载平衡和可用性.%Current DHT-based P2P networks are limited in their ability to support a semantic search, establishing an appopriate semantic overlay on peer-to-peer (P2P) networks to obtain both semantic ability and scalability is a challenge. This paper proposes the Distributed Suffix Tree (DST) overlay as the intermediate layer between the DHT overlay and the semantic overlay to support the search of a keyword sequence. Through DHT overlay get and return the corresponding net and indexed array to DHT overlay, then lookup the key words sequence by DHT. Analysis show its time cost is sublinear with the length of the keyword sequence, and experiments prove that the DST-based search is fast, load-balanced, and useful in realizing an accurate content search on P2P networks.
展开▼
