3 citations · 3 across the 1 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2023★ 1 cited
Consistent Query Answering for Primary Keys on Rooted Tree Queries
Paraschos Koutris, Xiating Ouyang, Jef Wijsen
We study the data complexity of consistent query answering (CQA) on databases that may violate the primary key constraints. A repair is a maximal subset of the database satisfying…
cs.DB2023
Consistent Query Answering for Primary Keys on Path Queries
Paraschos Koutris, Xiating Ouyang, Jef Wijsen
We study the data complexity of consistent query answering (CQA) on databases that may violate the primary key constraints. A repair is a maximal consistent subset of the database.…
cs.DB2015★ 3 cited
A Trichotomy in the Data Complexity of Certain Query Answering for Conjunctive Queries
Paraschos Koutris, Jef Wijsen
A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a…