A Survey of the Data Complexity of Consistent Query Answering under Key Constraints

2014 ◽  
pp. 62-78 ◽  
Author(s):  
Jef Wijsen
Keyword(s):  
Query Answering ◽  
Data Complexity ◽  
Consistent Query Answering

scholarly journals Revisiting Controlled Query Evaluation in Description Logics

2019 ◽  
Author(s):  
Domenico Lembo ◽  
Riccardo Rosati ◽  
Domenico Fabio Savo
Keyword(s):  
Private Information ◽  
Description Logics ◽  
Study Data ◽  
Query Answering ◽  
Query Evaluation ◽  
Data Complexity ◽  
Complexity Results ◽  
Controlled Query Evaluation ◽  
Consistent Query Answering ◽  
The Relationship

Controlled Query Evaluation (CQE) is a confidentiality-preserving framework in which private information is protected through a policy, and a (optimal) censor guarantees that answers to queries are maximized without violating the policy. CQE has been recently studied in the context of ontologies, where the focus has been mainly on the problem of the existence of an optimal censor. In this paper we instead consider query answering over all possible optimal censors. We study data complexity of this problem for ontologies specified in the Description Logics DL-LiteR and EL_bottom and for variants of the censor language, which is the language used by the censor to enforce the policy. In our investigation we also analyze the relationship between CQE and the problem of Consistent Query Answering (CQA). Some of the complexity results we provide are indeed obtained through mutual reduction between CQE and CQA.

On the Data Complexity of Consistent Query Answering

2014 ◽  
Vol 57 (4) ◽  
pp. 843-891 ◽  
Author(s):  
Balder ten Cate ◽  
Gaëlle Fontaine ◽  
Phokion G. Kolaitis
Keyword(s):  
Query Answering ◽  
Data Complexity ◽  
Consistent Query Answering
Sign in / Sign up

Export Citation Format

Share Document