The Community for Technology Leaders
RSS Icon
Issue No.06 - June (2008 vol.19)
pp: 735-749
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of information shared in such systems mandates efficient semantic based search instead of key-based search. This paper presents the design of an overlay network, namely semantic small world (SSW), that facilitates efficient semantic based search in P2P systems. SSW achieves the efficiency based on the following four ideas: 1) semantic clustering: peers with similar semantics organize into peer clusters; 2) dimension reduction: to address the high maintenance overhead associated with capturing high-dimensional data semantics in the overlay, peer clusters are adaptively mapped to a one-dimensional naming space; 3) small world network: peer clusters form into a one-dimensional small world network, which is search efficient with low maintenance overhead; 4) efficient search algorithms: peers perform efficient semantic based search, including approximate point query and range query, in the proposed overlay. Extensive experiments using both synthetic data and real data demonstrate that SSW is superior to the state-of-the-art on various aspects, including scalability, maintenance overhead, adaptivity to distribution of data and locality of interest, resilience to peer failures, load balancing, and efficiency in support of various types of queries on data objects with high dimensions.
distributed systems, distributed data structure, indexing methods, overlay, peer-to-peer systems, distributed query processing, Internet content sharing
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jing Zhao, "SSW: A Small-World-Based Overlay for Peer-to-Peer Search", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 6, pp. 735-749, June 2008, doi:10.1109/TPDS.2007.70757
[1] Text Retrieval Conf. Web Site, http:/, 2007.
[2] K. Aberer, A. Datta, M. Hauswirth, and R. Schmidt, “Indexing Data-Oriented Overlay Networks,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 685-696, 2005.
[3] J. Aspnes and G. Shah, “Skip Graphs,” Proc. 14th ACM-SIAM Symp. Discrete Algorithms (SODA '03), pp. 384-393, Jan. 2003.
[4] M. Bawa, T. Condie, and P. Ganesan, “LSH Forest: Self-Tuning Indexes for Similarity Search,” Proc. 14th Int'l Conf. World Wide Web (WWW '05), pp. 651-660, May 2005.
[5] M. Bawa, G.S. Manku, and P. Raghavan, “SETS: Search Enhanced by Topic Segmentation,” Proc. ACM Special Interest Group on Information Retrieval Conf. (SIGIR), pp. 306-313, July 2003.
[6] M.W. Berry, Z. Drmac, and E.R. Jessup, “Matrices, Vector Spaces, and Information Retrieval,” SIAM Rev., vol. 41, no. 2, pp. 335-362, 1999.
[7] A.R. Bharambe, M. Agrawal, and S. Seshan, “Mercury: Supporting Scalable Multi-Attribute Range Queries,” Proc. ACM SIGCOMM '04, pp. 353-366, Aug. 2004.
[8] Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, S. Shenker, and J. Hellerstein, “A Case Study in Building Layered DHT Applications,” Proc. ACM SIGCOMM, pp. 97-108, Aug. 2005.
[9] A. Iamnitchi, M. Ripeanu, and I.T. Foster, “Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations,” Proc. First Int'l Workshop Peer-to-Peer Systems, pp. 232-241, Mar. 2002.
[10] H.V. Jagadish, B.C. Ooi, and Q.H. Vu, “BATON: A Balanced Tree Structure for Peer-to-Peer Networks,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 661-672, Sept. 2005.
[11] H. Jin, X. Ning, and H. Chen, “Efficient Search for Peer-to-Peer Information Retrieval Using Semantic Small World,” Proc. 15th Int'l Conf. World Wide Web (WWW '06), pp. 1003-1004, May 2006.
[12] J. Kleinberg, “Navigation in a Small World,” Nature, vol. 406, no. 845, Aug. 2000.
[13] J. Kleinberg, “The Small-World Phenomenon: An Algorithm Perspective,” Proc. 32nd Ann. ACM Symp. Theory of Computing (SOTC '00), pp. 163-170, May 2000.
[14] M. Li, W.-C. Lee, and A. Sivasubramaniam, “Semantic Small World: An Overlay Network for Peer-to-Peer Search,” Proc. 12th Int'l Conf. Network Protocols, pp. 228-238, Oct. 2004.
[15] M. Li, W.-C. Lee, and A. Sivasubramaniam, “DPTree: A Balanced-Tree-Based Index Framework for Peer-to-Peer Systems,” Proc. 14th Int'l Conf. Network Protocols (ICNP '06), pp. 12-21, Nov. 2006.
[16] G.S. Manku, M. Bawa, and P. Raghavan, “Symphony: Distributed Hashing in a Small World,” Proc. Fourth Usenix Symp. Internet Technologies and Systems (USITS '03), Mar. 2003.
[17] W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M.T. Schlosser, I. Brunkhorst, and A. Löser, “Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks,” Proc. 12th World Wide Web Conf. (WWW '03), pp. 536-543, May 2003.
[18] C.H. Ng, K.C. Sia, and C.H. Chang, “Advanced Peer Clustering and Firework Query Model in the Peer-to-Peer Network,” Proc. 12th World Wide Web Conf. (WWW '03), May 2003.
[19] S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, and S. Schenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM '01, pp. 161-172, Aug. 2001.
[20] P. Reynolds and A. Vahdat, “Efficient Peer-to-Peer Keyword Searching,” Proc. ACM/IFIP/USENIX Int'l Middleware Conf. (Middleware '03), pp. 21-40, June 2003.
[21] A.I.T. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329-350, Nov. 2001.
[22] 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.
[23] C. Tang, Z. Xu, and S. Dwarkadas, “Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks,” Proc. ACM SIGCOMM '03, pp. 175-186, Aug. 2003.
[24] H. Zhang, A. Goel, and R. Govindan, “Using the Small-World Model to Improve Freenet Performance,” Proc. IEEE INFOCOM, June 2002.
[25] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool