DBScholar

Back to papers

Consistent Query Answering for Primary Keys on Path Queries

Summary: Study data complexity of CERTAINTY(q) for Boolean path queries under primary-key violations with repairs as maximal consistent subsets. Show a tetrachotomy (FO, NL-complete, PTIME-complete, coNP-complete) when self-joins are allowed, and give a polynomial-time procedure to decide which case applies from the query. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1861
Venue
PODS
Year
2021
Pagerank
5.5993651e-05
Overall Rank
7,558 | 48.15%
DOI
10.1145/3452021.3458334

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{koutris_pods21,
        address = {New York, NY, USA},
        series = {{PODS} '21},
        title = {{Consistent Query Answering for Primary Keys on Path Queries}},
        url = {https://dl.acm.org/doi/10.1145/3452021.3458334},
        doi = {10.1145/3452021.3458334},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Koutris, Paraschos and Ouyang, Xiating and Wijsen, Jef},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers