DBScholar

Back to papers

When is Naive Evaluation Possible?

Summary: Shows naive evaluation yields certain answers iff queries are monotone under a semantics-induced ordering (equivalently preserved by appropriate homomorphisms). Presents a relation-based framework for many incompleteness semantics (incl. CWA) and identifies FO classes beyond UCQs that admit naive evaluation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
ha7317cc12ddb1ba6
Venue
PODS
Year
2013
Pagerank
5.6250062e-05
Overall Rank
7,001 | 52.93%
DOI
10.1145/2463664.2463674

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gheerbrant_pods13,
        address = {New York, NY, USA},
        series = {{PODS} '13},
        title = {{When is Naive Evaluation Possible?}},
        url = {https://dl.acm.org/doi/10.1145/2463664.2463674},
        doi = {10.1145/2463664.2463674},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gheerbrant, Amélie and Libkin, Leonid and Sirangelo, Cristina},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
2,717 Partial Results in Database Systems 2014 SIGMOD 8.0980367e-05
5,392 Incomplete Data: What Went Wrong, and How to Fix It 2014 PODS 6.1502284e-05
6,089 Lenses: An On-Demand Approach to ETL 2015 VLDB 5.8908642e-05
12,391 Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? 2015 PODS 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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