Consistent query answering for primary keys on rooted tree queries

P Koutris, X Ouyang, J Wijsen - Proceedings of the ACM on Management …, 2024 - dl.acm.org
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 …

Consistent query answering for primary keys and conjunctive queries with counting

AAE Khalfioui, J Wijsen - arXiv preprint arXiv:2211.04134, 2022 - arxiv.org
The problem of consistent query answering for primary keys and self-join-free conjunctive
queries has been intensively studied in recent years and is by now well understood. In this …

Computing Range Consistent Answers to Aggregation Queries via Rewriting

AAE Khalfioui, J Wijsen - arXiv preprint arXiv:2409.01648, 2024 - arxiv.org
We consider the problem of answering conjunctive queries with aggregation on database
instances that may violate primary key constraints. In SQL, these queries follow the SELECT …

[图书][B] Building Datalog Systems for Scalable and Efficient Data Analytics

Z Fan - 2022 - search.proquest.com
The ability to perform advanced data analytics efficiently is becoming increasingly important
for a wide spectrum of data-driven applications in the big data era. The efficiency of data …

Naive Bayes Classifiers over Missing Data: Decision and Poisoning

S Bian, X Ouyang, Z Fan, P Koutris - Forty-first International Conference on … - openreview.net
We study the certifiable robustness of ML classifiers on dirty datasets that could contain
missing values. A test point is certifiably robust for an ML classifier if the classifier returns the …

[图书][B] Finding Consistent Answers From Inconsistent Data: Systems, Algorithms, and Complexity

X Ouyang - 2023 - search.proquest.com
Most data analytical pipelines often encounter the problem of querying inconsistent data that
could violate pre-determined integrity constraints. Data cleaning is an extensively studied …