RDF Query Answering in the Presence of Access Restrictions

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this work, we explore algorithms for answering conjunctive RDF queries in the presence of RDFS ontologies and access control. We consider an access control setting where by default all users have access to the complete graph, and a restriction can forbid user a user’s access to specific IRIs. Here, restricting for user u the access to an IRI i entails that: no answer to a query by u may contain the IRI i; no triple containing i can be used to compute an answer for a query by i, nor to entail such a triple via reasoning with the ontology. We present a set of query answering algorithms for this novel context, and prove that five among them are correct, i.e., sound and complete, with respect to both the ontology and the access restrictions in place. We have implemented all our algorithms and present experiments comparing their performance.

Original languageEnglish
Title of host publicationCooperative Information Systems - 31st International Conference, CoopIS 2025, Proceedings
EditorsCinzia Cappiello, Olaf Hartig, Mohamed Sellami, Ali Ouni
PublisherSpringer Science and Business Media Deutschland GmbH
Pages312-330
Number of pages19
ISBN (Print)9783032155375
DOIs
Publication statusPublished - 1 Jan 2026
Event31st International Conference on Cooperative Information Systems, CoopIS 2025 - Marbella, Spain
Duration: 20 Oct 202522 Oct 2025

Publication series

NameLecture Notes in Computer Science
Volume15535 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference31st International Conference on Cooperative Information Systems, CoopIS 2025
Country/TerritorySpain
CityMarbella
Period20/10/2522/10/25

Keywords

  • Access Control
  • Query Answering
  • Semantic Web

Fingerprint

Dive into the research topics of 'RDF Query Answering in the Presence of Access Restrictions'. Together they form a unique fingerprint.

Cite this