Database Paper Browser

Back to papers

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)

Paper ID
1930
Venue
PODS
Year
2024
Pagerank
4.2897489e-05
Overall Rank
9,748 | 32.19%
DOI
10.1145/3651600

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,026 Minimum Change ≠ Best Cleaning: Parallel and Incremental Error Detection under Integrity Constraints 2026 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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