On scalable RDFS reasoning using a hybrid approach

Authors

TUĞBA KÜLAHCIOĞLU
HASAN BULUT

DOI

10.3906/elk-1308-45

Abstract

Reasoning is a vital ability for semantic web applications since they aim to understand and interpret the data on the World Wide Web. However, reasoning of large data sets is one of the challenges facing semantic web applications. In this paper, we present new approaches for scalable Resource Description Framework Schema (RDFS) reasoning. Our RDFS specific term-based partitioning algorithm determines required schema elements for each data partition while eliminating the data partitions that will not produce any inferences. With the two-level partitioning approach, we are able to carry out reasoning with limited resources. In our hybrid approach, we integrate two previously mentioned methods to benefit from the advantages of both. In the experimental tests we achieve linear speedups for reasoning times with the proposed hybrid approach. These algorithms and methods presented in the paper enable RDFS-level reasoning of large data sets with limited resources, and they together build up a scalable distributed reasoning approach.

Keywords

RDFS reasoning, distributed reasoning, data partitioning, data elimination, scalability

First Page

1208

Last Page

1222

Recommended Citation

KÜLAHCIOĞLU, TUĞBA and BULUT, HASAN (2016) "On scalable RDFS reasoning using a hybrid approach," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 24: No. 3, Article 37. https://doi.org/10.3906/elk-1308-45
Available at: https://journals.tubitak.gov.tr/elektrik/vol24/iss3/37