On the Computational Complexity of Consistent Query Answers
Jan Chomicki, Jerzy Marcinkowski
Abstract
We consider here the problem of obtaining reliable, consistent information from inconsistent databases -- databases that do not have to satisfy given integrity constraints. We use the notion of consistent query answer -- a query answer which is true in every (minimal) repair of the database. We provide a complete classification of the computational complexity of consistent answers to first-order queries w.r.t. functional dependencies and denial constraints. We show how the complexity depends on the type of the constraints considered, their number, and the size of the query. We obtain several new PTIME cases, using new algorithms.
Create a lesson
Related papers
Knowledge Graph Lakehouse: A Cloud-Native Architecture for Managing Enterprise Knowledge Graphs at Scale
Bashar Ahmad, Christoph G. Schuetz, Loris Bozzato
ZeroGR: Filtering-First Constrained Decoding for Generative Recommendation
Xiangrui Yang, Jiawei Yang, Liang Zeng et al.
Order-Dependent Complexity of Enumeration and Direct Access for Conjunctive Queries on Dynamic Data
Antoine Amarilli, Nofar Carmeli, Clémence Dumoulin
Text-to-SQL Models Make Choices Without Saying So
Yichen Xu, Shipei Lin, Chenhao Ma
Navigating Runtime Dynamism in Semantic Query Serving
Hengrui Zhang, Xupeng Miao
SQLoom: Set-Contrastive Learning of Syntactic, Semantic, and Logical Dependencies for Text-to-SQL
Hao Fu, Degang Sun, Wan Wei et al.