Distributed RDFS Reasoning Over Structured Overlay Networks

Zoi Kaoudi, Manolis Koubarakis

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume2
Issue number4
DOIs
Publication statusPublished - 1 Dec 2013
Externally publishedYes

Fingerprint

Overlay networks
Bamboo
Semantic Web

Keywords

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

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Distributed RDFS Reasoning Over Structured Overlay Networks. / Kaoudi, Zoi; Koubarakis, Manolis.

In: Journal on Data Semantics, Vol. 2, No. 4, 01.12.2013, p. 189-227.

Research output: Contribution to journalArticle

Kaoudi, Zoi ; Koubarakis, Manolis. / Distributed RDFS Reasoning Over Structured Overlay Networks. In: Journal on Data Semantics. 2013 ; Vol. 2, No. 4. pp. 189-227.
@article{0e969b93f5e34c9198d60389fdfbef58,
title = "Distributed RDFS Reasoning Over Structured Overlay Networks",
abstract = "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.",
keywords = "Backward chaining, Datalog, DHT, Forward chaining, Magic sets, RDFS reasoning",
author = "Zoi Kaoudi and Manolis Koubarakis",
year = "2013",
month = "12",
day = "1",
doi = "10.1007/s13740-013-0018-0",
language = "English",
volume = "2",
pages = "189--227",
journal = "Journal on Data Semantics",
issn = "1861-2032",
publisher = "Springer International Publishing AG",
number = "4",

}

TY - JOUR

T1 - Distributed RDFS Reasoning Over Structured Overlay Networks

AU - Kaoudi, Zoi

AU - Koubarakis, Manolis

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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.

AB - 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.

KW - Backward chaining

KW - Datalog

KW - DHT

KW - Forward chaining

KW - Magic sets

KW - RDFS reasoning

UR - http://www.scopus.com/inward/record.url?scp=84975229445&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84975229445&partnerID=8YFLogxK

U2 - 10.1007/s13740-013-0018-0

DO - 10.1007/s13740-013-0018-0

M3 - Article

VL - 2

SP - 189

EP - 227

JO - Journal on Data Semantics

JF - Journal on Data Semantics

SN - 1861-2032

IS - 4

ER -