Distributed suffix tree overlay for peer-to-peer search

doi:10.1109/TKDE.2007.190688

	Distributed suffix tree overlay for peer-to-peer search
	Zhuge, Hai; Feng, Liang
	2008-02-01
发表期刊	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
ISSN	1041-4347
卷号	20 期号:2 页码:276-285
摘要	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.
关键词	DHT knowledge grid peer-to-peer semantic overlay suffix tree load balance
DOI	10.1109/TKDE.2007.190688
收录类别	SCI
语种	英语
WOS研究方向	Computer Science ; Engineering
WOS类目	Computer Science, Artificial Intelligence ; Computer Science, Information Systems ; Engineering, Electrical & Electronic
WOS记录号	WOS:000251686000010
出版者	IEEE COMPUTER SOC
引用统计	被引频次：21[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/11427
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	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.