DBScholar

Back to papers

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
1898
Venue
PODS
Year
2022
Pagerank
5.5612056e-05
Overall Rank
7,712 | 47.09%
DOI
10.1145/3517804.3526230

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers