Complex Queries for Heterogeneous Resources on a Structured P2P Semantic Link Network

This paper investigates the issue of realizing complex queries for heterogeneous resources on dynamic and large-scale decentralized networks. We build a distributed index on a structured P2P network HRing to represent semantic relations between resources to support complex query, and establish semantic links among nodes of P2P network to realize ef ficient routing of queries. Incorporating distributed index, semantic links and HRing forms a structured P2P Semantic Link Network (SemHRing). Current search engines are limited in abilit y to support relational queries, which are often required in real applications. SemHRing can support keyword queries and relational queries while guaranteeing high performance and low maintenance cost as well as high robustness. SemHRing can be a feasible solution to the distributed storage system f or next- generation search engines.

[1]  David R. Karger,et al.  Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems , 2004, IPTPS.

[2]  Yiming Hu,et al.  Integrating semantics-based access mechanisms with P2P file systems , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[3]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[4]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[5]  Beng Chin Ooi,et al.  BATON: A Balanced Tree Structure for Peer-to-Peer Networks , 2005, VLDB.

[6]  Xue Chen,et al.  HRing: A Structured P2P Overlay Based on Harmonic Series , 2008, IEEE Transactions on Parallel and Distributed Systems.

[7]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[8]  Anand Sivasubramaniam,et al.  Semantic small world: an overlay network for peer-to-peer search , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[9]  Hector Garcia-Molina,et al.  One torus to rule them all: multi-dimensional queries in P2P systems , 2004, WebDB '04.

[10]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[11]  Hector Garcia-Molina,et al.  Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems , 2004, VLDB.

[12]  Alon Y. Halevy,et al.  Indexing dataspaces , 2007, SIGMOD '07.

[13]  J. Ian Munro,et al.  Deterministic SkipNet , 2004, Inf. Process. Lett..

[14]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[15]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[16]  Johannes Gehrke,et al.  Querying peer-to-peer networks using P-trees , 2004, WebDB '04.

[17]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[18]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[19]  Charles U. Martel,et al.  Analyzing Kleinberg's (and other) small-world Models , 2004, PODC '04.

[20]  Dmitri Loguinov,et al.  On zone-balancing of peer-to-peer networks: analysis of random node join , 2004, SIGMETRICS '04/Performance '04.

[21]  Divyakant Agrawal,et al.  Range addressable network: a P2P cache architecture for data ranges , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[22]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[23]  Hai Zhuge,et al.  The knowledge grid , 2004 .

[24]  Sriram Ramabhadran,et al.  Brief announcement: prefix hash tree , 2004, PODC '04.

[25]  Ling Liu,et al.  PeerCQ: a decentralized and self-configuring peer-to-peer information monitoring system , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[26]  Pedro A. Szekely,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Proceedings. First Latin American Web Congress.

[27]  Nicholas J. A. Harvey,et al.  Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time , 2004, SODA '04.

[28]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[29]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2006, Theory of Computing Systems.

[30]  Jie Liu,et al.  A scalable P2P platform for the knowledge grid , 2005, IEEE Transactions on Knowledge and Data Engineering.

[31]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[32]  Karl Aberer,et al.  P-Grid: a self-organizing structured P2P system , 2003, SGMD.

[33]  Jonathan Kirsch,et al.  Load balancing and locality in range-queriable data structures , 2004, PODC '04.