Paper Info
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.
Year
DOI
Venue
2013
10.1007/s13740-013-0018-0
J. Data Semantics
Keywords
DocType
Volume
RDFS reasoning, DHT, Forward chaining, Backward chaining, Magic sets, Datalog
Journal
2
Issue
ISSN
Citations 
4
1861-2040
1
PageRank 
References 
Authors
0.35
55
2
Name
Order
Citations
PageRank
Zoi Kaoudi121518.55
Manolis Koubarakis22790322.32