This Article 
 Bibliographic References 
 Add to: 
Distributed Suffix Tree Overlay for Peer-to-Peer Search
February 2008 (vol. 20 no. 2)
pp. 276-285
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.

[1] F.M. Cuenca-Acuna and T.D. Nguyen, “Text-Based Content Search and Retrieval in Ad Hoc P2P Communities,” Proc. Int'l Workshop Peer-to-Peer Computing, pp. 220-234, May 2002.
[2] L. Garcés-Erice, P.A. Felber, E.W. Biersack, G. Urvoy-Keller, and K.W. Ross, “Data Indexing in Peer-to-Peer DHT Networks,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), pp. 200-208, Mar. 2004.
[3] M. Harren, J.M. Hellerstein, R. Huebsch, B.T. Loo, S. Shenker, and I. Stoica, “Complex Queries in DHT-Based Peer-to-Peer Networks,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 242-250, Mar. 2002.
[4] J. Li, B.T. Loo, J. Hellerstein, F. Kaashoek, D.R. Karger, and R. Morris, “On the Feasibility of Peer-to-Peer Web Indexing and Search,” Proc. Second Int'l Workshop Peer-to-Peer Systems (IPTPS '03), pp. 207-215, Feb. 2003.
[5] E.M. McCreight, “A Space-Economical Suffix Tree Construction Algorithm,” J. ACM, vol. 23, no. 2, pp. 262-272, 1976.
[6] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM '01, pp. 161-172, Aug. 2001.
[7] P. Reynolds and A. Vahdat, “Efficient Peer-to-Peer Keyword Searching,” Proc. ACM/IFIP/Usenix Int'l Middleware Conf. (Middleware '03), pp. 21-44, June 2003.
[8] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms, pp. 329-350, Nov. 2001.
[9] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149-160, Aug. 2001.
[10] C. Tang and S. Dwarkadas, “Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval,” Proc. First Symp. Networked Systems Design and Implementation (NSDI '04), pp. 211-224, Mar. 2004.
[11] C. Zhang, A. Krishnamurthy, and R.Y. Wang, “Brushwood: Distributed Trees in Peer-to-Peer Systems,” Proc. Fourth Int'l Workshop Peer-to-Peer Systems (IPTPS '05), pp. 47-57, Feb. 2005.
[12] B.Y. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Technical Report UCB/CSD-01-1141, Computer Science Dept., Univ. of California, Berkeley, 2001.
[13] H. Zhuge and L. Feng, “Distributed Suffix Tree Overlay for P2P Search,” Technical Report KGRC-2007-02, www.knowledgegrid. netTR. 2007.
[14] H. Zhuge, X. Sun, J. Liu, E. Yao, and X. Chen, “A Scalable P2P Platform for the Knowledge Grid,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 12, pp. 1721-1736, Dec. 2005.
[15] H. Zhuge and X. Li, “Peer-to-Peer in Metric Space and Semantic Space,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 6, pp.759-771, June 2007.

Hai Zhuge, Liang Feng, "Distributed Suffix Tree Overlay for Peer-to-Peer Search," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 2, pp. 276-285, Feb. 2008, doi:10.1109/TKDE.2007.190688
Usage of this product signifies your acceptance of the Terms of Use.