Distributed RDFS Reasoning Over Structured Overlay Networks

Zoi Kaoudi, Manolis Koubarakis

Research output: Contribution to journalArticle

2 Citations (Scopus)


In this paper, we study the problem of distributed RDFS reasoning over structured overlay networks. Distributed RDFS reasoning is essential for providing the functionality that Semantic Web and Linked Data applications require. Our goal is to present various inference techniques for RDFS reasoning in a distributed environment, and analyze them both theoretically and experimentally. The reasoning methods we present are based on bottom-up and top-down techniques and have been implemented on top of the distributed hash table Bamboo. Our algorithms range from forward and backward chaining ones to rewriting algorithms based on magic sets. We formally prove the correctness of the algorithms and study the time-space trade-off they exhibit analytically and experimentally in a local cluster.

Original languageEnglish
Pages (from-to)189-227
Number of pages39
JournalJournal on Data Semantics
Issue number4
Publication statusPublished - 1 Dec 2013
Externally publishedYes



  • Backward chaining
  • Datalog
  • DHT
  • Forward chaining
  • Magic sets
  • RDFS reasoning

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this