RDFS Reasoning and Query Answering on Top of DHTs

  • Authors:

  • Zoi Kaoudi;Iris Miliaraki;Manolis Koubarakis

  • Affiliations:

  • Dept. of Informatics and Telecommunications, National and Kapodistrian University of Athens, Greece;Dept. of Informatics and Telecommunications, National and Kapodistrian University of Athens, Greece;Dept. of Informatics and Telecommunications, National and Kapodistrian University of Athens, Greece

  • Venue:
  • ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. Scalable, distributed RDFS reasoning is an essential functionality for providing the scalability and performance that large-scale Semantic Web applications require. Our goal in this paper is to compare and evaluate two well-known approaches to RDFS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness. We also study the time-space trade-off exhibited by the algorithms analytically, and experimentally by evaluating our algorithms on PlanetLab.