Combined Approximations for Uniform Operational Consistent Query Answering
Summary: Uniform approximation for operational CQA via revised repairs; combined-complexity for self-join-free, bounded-HTW conjunctive queries. Introduces SpanTL, and uses tree-automata results for efficient approximations; hardness if self-join or HTW bound is relaxed. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marco Calautti (University of Milan)
- 2. Ester Livshits (University of Edinburgh)
- 3. Andreas Pieris (University of Cyprus; University of Edinburgh)
- 4. Markus Schneider (University of Edinburgh)
BibTeX Citation
@inproceedings{calautti_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Combined Approximations for Uniform Operational Consistent Query Answering}},
url = {https://dl.acm.org/doi/10.1145/3651600},
doi = {10.1145/3651600},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Calautti, Marco and Livshits, Ester and Pieris, Andreas and Schneider, Markus},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,529 | Minimum Change ≠ Best Cleaning: Parallel and Incremental Error Detection under Integrity Constraints | 2026 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00049349003 |
| 595 | ConQuer: Efficient Management of Inconsistent Databases | 2005 | SIGMOD | 0.00015798582 |
| 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.7545681e-05 |
| 3,538 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS | 7.2214371e-05 |
| 5,374 | Counting Database Repairs under Primary Keys Revisited | 2019 | PODS | 6.156895e-05 |
| 5,742 | An Operational Approach to Consistent Query Answering | 2018 | PODS | 6.0108123e-05 |
| 6,808 | Benchmarking Approximate Consistent Query Answering | 2021 | PODS | 5.6763412e-05 |
| 7,466 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 5.5199634e-05 |
| 7,869 | Uniform Operational Consistent Query Answering | 2022 | PODS | 5.4364271e-05 |
| 8,407 | Counting Database Repairs Entailing a Query: The Case of Functional Dependencies | 2022 | PODS | 5.3368401e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,779 | Consistent Query Answers in Inconsistent Probabilistic Databases | 2010 | SIGMOD |
| 2 | 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 3 | 5,374 | Counting Database Repairs under Primary Keys Revisited | 2019 | PODS |
| 4 | 8,407 | Counting Database Repairs Entailing a Query: The Case of Functional Dependencies | 2022 | PODS |
| 5 | 7,705 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS |
| 6 | 11,469 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS |
| 7 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 8 | 6,808 | Benchmarking Approximate Consistent Query Answering | 2021 | PODS |
| 9 | 5,742 | An Operational Approach to Consistent Query Answering | 2018 | PODS |
| 10 | 7,869 | Uniform Operational Consistent Query Answering | 2022 | PODS |