Database Paper Browser

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
1597
Venue
PODS
Year
2013
Pagerank
4.9060157e-05
Overall Rank
6,858 | 52.30%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
3,051 Partial Results in Database Systems 2014 SIGMOD 7.6512591e-05
5,494 Incomplete Data: What Went Wrong, and How to Fix It 2014 PODS 5.4759469e-05
5,779 Lenses: An On-Demand Approach to ETL 2015 VLDB 5.3307398e-05
11,899 Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? 2015 PODS 4.1945683e-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