Uniform Operational Consistent Query Answering

Summary: Introduces uniform operational CQA: a probabilistic operational-repair framework that assigns uniform distributions over repairs, operation sequences, or step-wise choices to compute consistent-answer probabilities via randomized iterative repairs. Performs a fine-grained data-complexity study for conjunctive queries under functional dependencies, giving exact/approximate complexity results and showing existence of efficient approximation schemes beyond classical primary-key limits. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: hbd00f87c7a986792
Venue: PODS
Year: 2022
Pagerank: 5.4364271e-05
Overall Rank: 7,869 | 47.10%
DOI: 10.1145/3517804.3526230

Incoming Non-self Citations Over Time

Authors

1. Marco Calautti (University of Trento)
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_pods22,
        address = {New York, NY, USA},
        series = {{PODS} '22},
        title = {{Uniform Operational Consistent Query Answering}},
        url = {https://dl.acm.org/doi/10.1145/3517804.3526230},
        doi = {10.1145/3517804.3526230},
        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 = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,104	Combined Approximations for Uniform Operational Consistent Query Answering	2024	PODS	5.0789354e-05
10,529	Minimum Change ≠ Best Cleaning: Parallel and Incremental Error Detection under Integrity Constraints	2026	SIGMOD	4.9793485e-05
11,469	Consistent Query Answering for Primary Keys on Rooted Tree Queries	2024	PODS	4.9793485e-05
11,494	Computing Range Consistent Answers to Aggregation Queries via Rewriting	2024	PODS	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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
587	Management of Probabilistic Data: Foundations and Challenges	2007	PODS	0.00015933201
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
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
8,407	Counting Database Repairs Entailing a Query: The Case of Functional Dependencies	2022	PODS	5.3368401e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,501	Certain Query Answering in Partially Consistent Databases	2014	VLDB
2	8,407	Counting Database Repairs Entailing a Query: The Case of Functional Dependencies	2022	PODS
3	1,735	The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints	2015	PODS
4	11,833	A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys	2022	PODS
5	11,469	Consistent Query Answering for Primary Keys on Rooted Tree Queries	2024	PODS
6	7,705	Consistent Query Answering for Primary Keys on Path Queries	2021	PODS
7	5,779	Consistent Query Answers in Inconsistent Probabilistic Databases	2010	SIGMOD
8	6,808	Benchmarking Approximate Consistent Query Answering	2021	PODS
9	10,104	Combined Approximations for Uniform Operational Consistent Query Answering	2024	PODS
10	5,742	An Operational Approach to Consistent Query Answering	2018	PODS