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)
Incoming Non-self Citations Over Time
Authors
- 1. Amélie Gheerbrant (University of Edinburgh)
- 2. Leonid Libkin (University of Edinburgh)
- 3. Cristina Sirangelo (CNRS; INRIA; École Normale Supérieure)
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,663 | Partial Results in Database Systems | 2014 | SIGMOD | 8.2818137e-05 |
| 5,271 | Incomplete Data: What Went Wrong, and How to Fix It | 2014 | PODS | 6.2907571e-05 |
| 5,971 | Lenses: An On-Demand Approach to ETL | 2015 | VLDB | 6.0243066e-05 |
| 12,098 | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | 2015 | PODS | 5.093636e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 22 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00056204792 |
| 377 | Data Exchange: Getting to the Core | 2003 | PODS | 0.00019643793 |
| 874 | On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases | 2003 | PODS | 0.00013481551 |
| 2,671 | On The Integrity Of Databases With Incomplete Information | 1986 | PODS | 8.2736086e-05 |
| 4,184 | On Preservation under Homomorphisms and Unions of Conjunctive Queries | 2004 | PODS | 6.8464183e-05 |
| 4,432 | Data Exchange beyond Complete Data | 2011 | PODS | 6.7087209e-05 |
| 7,462 | Incomplete Information and Certain Answers in General Data Models | 2011 | PODS | 5.61159e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,380 | Null Values in Data Base Management: A Denotational Semantics Approach | 1979 | SIGMOD |
| 2 | 3,730 | Safety and Correct Translation of Relational Calculus Formulas | 1987 | PODS |
| 3 | 2,671 | On The Integrity Of Databases With Incomplete Information | 1986 | PODS |
| 4 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 5 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 6 | 3,512 | Query Processing in Deductive Databases with Incomplete Information | 1986 | SIGMOD |
| 7 | 2,934 | Data Exchange and Incomplete Information | 2006 | PODS |
| 8 | 12,404 | Completeness of Queries over Incomplete Databases | 2011 | VLDB |
| 9 | 7,462 | Incomplete Information and Certain Answers in General Data Models | 2011 | PODS |
| 10 | 4,495 | Queries with Incomplete Answers over Semistructured Data | 1999 | PODS |