The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Exploiting semantic proximities for content search over p2p networks
Computer Communications
Context-aware middleware for pervasive elderly homecare
IEEE Journal on Selected Areas in Communications - Special issue on wireless and pervasive communications for healthcare
A semantic P2P framework for building context-aware applications in multiple smart spaces
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
A survey of structured P2P systems for RDF data storage and retrieval
Transactions on large-scale data- and knowledge-centered systems III
Managing context data for diverse operating spaces
Pervasive and Mobile Computing
| Hi-index | 0.00 |
The widespread use of RDF-based information necessitates efficient information retrieval techniques in wide-area networks. In this paper, we present Dynamic Semantic Space, a schema-based peer-to-peer overlay network that facilitates efficient lookup for RDF-based information in dynamic environments. Peers in this overlay are grouped based on the semantics of their data which are extracted according to a set of schemas, and self-organized as a semantic overlay network. To reduce overheads incurred by peer joining, leaving and content changes in a high-dimensional overlay network, peers are constructed as a one-dimensional semantic space that facilitates efficient routing for both pull and push requests. A search or a subscription request is only routed to the appropriate cluster that holds related data, thus reducing unnecessary search cost and increasing the efficiency of locating information. Through a comprehensive simulation study, we demonstrate the effectiveness of our proposed techniques.