A Peer-to-Peer Information Sharing Method for RDF Triples Based on RDF Schema

Authors:
Kohichi Kohigashi;Kentaro Takahashi;Kaname Harumoto;Shojiro Nishio
Affiliations:
Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 565-0871;Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 565-0871;Graduate School of Engineering, Osaka University, Osaka, Japan 565-0871;Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 565-0871
Venue:
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Year:
2009

Citing 4
Cited 1

Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network

Proceedings of the 13th international conference on World Wide Web
Skip graphs

ACM Transactions on Algorithms (TALG)
PIAX: toward a framework for sensor overlay network

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference

P2P-Based publication and sharing of axioms in OWL ontologies for SPARQL query processing in distributed environment

APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Managing and sharing RDF triples in a distributed environment is one of the important issues for realizing semantic information retrieval in the Internet. Especially, the notion of RDF classes plays an important role in semantic information retrieval. In this paper, we propose a peer-to-peer information sharing method for RDF triples based on RDF class hierarchy. In the proposed method, a class ID is assigned to each RDF class so that it can represent inclusion relations of the class hierarchy. Then, each RDF triple is given a two-dimensional key that represents the classes of the subject and the object. By using Z-order of those two-dimensional keys, peers join an overlay network based on the Multi-Key Skip Graphs. Class-based retrieval of RDF triples is then realized by a range search on the overlay network. We show that the proposed method can process class-based RDF queries efficiently.