Issue No.02 - February (2008 vol.20)
Establishing an appropriate semantic overlay on Peer-to-Peer networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support semantic search. This paper proposes the DST (Distributed Suffix Tree) overlay as the intermediate layer between the DHT overlay and the semantic overlay. The DST overlay supports search of keyword sequences. Its time cost is sub-linear with the length of the keyword sequences. Using a common interface, the DST overlay is independent of the variation of the underlying DHT overlays. Analysis and experiments show that DST-based search is fast, load-balanced, and useful in realizing accurate content search on large networks.
Hai Zhuge, Liang Feng, "Distributed Suffix Tree Overlay for Peer-to-Peer Search", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 2, pp. 276-285, February 2008, doi:10.1109/TKDE.2007.190688