Consistent Query Answering for Primary Keys on Rooted Tree Queries
Abstract
References
Index Terms
- Consistent Query Answering for Primary Keys on Rooted Tree Queries
Recommendations
Consistent query answering under primary keys: a characterization of tractable queries
ICDT '09: Proceedings of the 12th International Conference on Database TheoryThis article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a maximum number of tuples from db without ever selecting two tuples that agree ...
Consistent Query Answering for Primary Keys on Path Queries
PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe 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. For a Boolean query q, the problem CERTAINTY(q) takes a database as ...
Comments
Information & Contributors
Information
Published In
![cover image Proceedings of the ACM on Management of Data](/cms/asset/30dabdbd-2e1a-4b6f-9af6-ce59e94608d6/3665155.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Funding Sources
- Anthony C. Klug NCR Fellowshi
- National Science Foundation
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 65Total Downloads
- Downloads (Last 12 months)65
- Downloads (Last 6 weeks)18
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in