DBScholar

Back to papers

Consistent Query Answers in Inconsistent Databases

Summary: Defines consistent answers as query results invariant across all minimal repairs of an inconsistent relational database. Presents an iterative algorithm, with soundness/completeness for some constraint/query classes and termination proofs for several constraint types. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1161
Venue
PODS
Year
1999
Pagerank
0.00049907763
Overall Rank
33 | 99.78%
DOI
10.1145/303976.303983

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{arenas_pods99,
        address = {New York, NY, USA},
        series = {{PODS} '99},
        title = {{Consistent Query Answers in Inconsistent Databases}},
        url = {https://dl.acm.org/doi/10.1145/303976.303983},
        doi = {10.1145/303976.303983},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Arenas, Marcelo and Bertossi, Leopoldo and Chomicki, Jan},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 108 citing papers.

Previous Page 3 / 3 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers