Authorization Conflict Problems in Combining RIF Rules with RDF Data

Jaehoon KIM  

IEICE TRANSACTIONS on Information and Systems   Vol.E98-D   No.4   pp.863-871
Publication Date: 2015/04/01
Publicized: 2014/09/05
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2014EDP7218
Type of Manuscript: PAPER
Category: Data Engineering, Web Information Systems
access control,  RDF,  RIF,  authorization conflict,  inference,  

Full Text: PDF>>
Buy this Article

Resource Description Framework (RDF) access control suffers from an authorization conflict problem caused by RDF inference. When an access authorization is specified, it can lie in conflict with other access authorizations that have the opposite security sign as a result of RDF inference. In our former study, we analyzed the authorization conflict problem caused by subsumption inference, which is the key inference in RDF. The Rule Interchange Format (RIF) is a Web standard rule language recommended by W3C, and can be combined with RDF data. Therefore, as in RDF inference, an authorization conflict can be caused by RIF inference. In addition, this authorization conflict can arise as a result of the interaction of RIF inference and RDF inference rather than of RIF inference alone. In this paper, we analyze the authorization conflict problem caused by RIF inference and suggest an efficient authorization conflict detection algorithm. The algorithm exploits the graph labeling-based algorithm proposed in our earlier paper. Through experiments, we show that the performance of the graph labeling-based algorithm is outstanding for large RDF data.