2020 · 16 citations · 18 references
ComputingComputer ScienceAlgorithmsFormal MethodsKnowledge RepresentationData ConfidentialityData PrivacyData ProtectionDescription LogicsDifferential PrivacyQuery ProcessingComplexityConfidentialityOntologiesPrivacy-preserving Query ProcessingPrivacy-preserving QueryingQuery AnsweringQuery EvaluationQuery Privacy
We study privacy-preserving query answering in Description Logics (DLs). Specifically, we consider the approach of controlled query evaluation (CQE) based on the notion of instance indistinguishability. We derive data complexity results for query answering over DL-LiteR ontologies, through a comparison with an alternative, existing confidentiality-preserving approach to CQE. Finally, we identify a semantically well-founded notion of approximated query answering for CQE, and prove that, for DL-LiteR ontologies, this form of CQE is tractable with respect to data complexity and is first-order rewritable, i.e., it is always reducible to the evaluation of a first-order query over the data instance.
18
The Description Logic Handbook – Theory, Implementation and Applications
C.J.H. Mann · Kybernetes · 2003 · 2.2K citations
2009 · 495 citations
Ontology-Based Data Access: A Survey
Guohui Xiao, Diego Calvanese, Roman Kontchakov et al. · 2018 · 315 citations · Full text