8 citations · 10 across the 5 of their papers we have counts for
6 papers
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…
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
Hangdong Zhao, Austen Z. Fan, Xiating Ouyang +1
In this paper, we study the complexity of evaluating Conjunctive Queries with negation (\cqneg). First, we present an algorithm with linear preprocessing time and constant delay en…
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.…
Naive Bayes Classifiers over Missing Data: Decision and Poisoning
Song Bian, Xiating Ouyang, Zhiwei Fan +1
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…
LinCQA: Faster Consistent Query Answering with Linear Time Guarantees
Zhiwei Fan, Paraschos Koutris, Xiating Ouyang +1
Most data analytical pipelines often encounter the problem of querying inconsistent data that violate pre-determined integrity constraints. Data cleaning is an extensively studied…
Unit Interval Vertex Deletion: Fewer Vertices are Relevant
Yuping Ke, Yixin Cao, Xiating Ouyang +1
The unit interval vertex deletion problem asks for a set of at most vertices whose deletion from an -vertex graph makes it a unit interval graph. We develop an -vert…