Distributed suffix tree overlay for peer-to-peer search
文献类型：期刊论文
| 作者 | Zhuge, Hai; Feng, Liang |
| 刊名 | IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
 |
| 出版日期 | 2008-02-01 |
| 卷号 | 20期号:2页码:276-285 |
| 关键词 | DHT knowledge grid peer-to-peer semantic overlay suffix tree load balance |
| ISSN号 | 1041-4347 |
| DOI | 10.1109/TKDE.2007.190688 |
| 英文摘要 | Establishing an appropriate semantic overlay on peer-to-peer (P2P) networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support a semantic search. 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. Its time cost is sublinear with the length of the keyword sequence. Analysis and experiments show that the DST-based search is fast, load-balanced, and useful in realizing an accurate content search on P2P networks. |
| WOS研究方向 | Computer Science ; Engineering |
| 语种 | 英语 |
| WOS记录号 | WOS:000251686000010 |
| 出版者 | IEEE COMPUTER SOC |
| 源URL | [http://119.78.100.204/handle/2XEOYT63/11426]  |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 通讯作者 | Zhuge, Hai |
| 作者单位 | Chinese Acad Sci, Inst Comp Technol, Key Lab IIP, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhuge, Hai,Feng, Liang. Distributed suffix tree overlay for peer-to-peer search[J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,2008,20(2):276-285. |
| APA | Zhuge, Hai,&Feng, Liang.(2008).Distributed suffix tree overlay for peer-to-peer search.IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,20(2),276-285. |
| MLA | Zhuge, Hai,et al."Distributed suffix tree overlay for peer-to-peer search".IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 20.2(2008):276-285. |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。