Naïve Evaluation of Queries over Incomplete Databases

• Published in: ACM transactions on database systems Vol. 39; no. 4; pp. 1 - 42
• Main Authors: Gheerbrant, Amélie, Libkin, Leonid, Sirangelo, Cristina
• Format: Journal Article
• Language: English
• Published: Association for Computing Machinery 01.12.2014
• Subjects: Computer Science; Equivalence; Homomorphisms; Logic in Computer Science; Mathematical analysis; Preservation; Queries; Semantics; Unions; naive tables/evaluation; homomorphisms; Incomplete data; certain answers; orderings
• ISSN: 0362-5915; 1557-4644
• DOI: 10.1145/2691190.2691194

The term naïve evaluation refers to evaluating queries over incomplete databases as if nulls were usual data values, that is, to using the standard database query evaluation engine. Since the semantics of query answering over incomplete databases is that of certain answers, we would like to know when naïve evaluation computes them, that is, when certain answers can be found without inventing new specialized algorithms. For relational databases it is well known that unions of conjunctive queries possess this desirable property, and results on preservation of formulae under homomorphisms tell us that, within relational calculus, this class cannot be extended under the open-world assumption. Our goal here is twofold. First, we develop a general framework that allows us to determine, for a given semantics of incompleteness, classes of queries for which naïve evaluation computes certain answers. Second, we apply this approach to a variety of semantics, showing that for many classes of queries beyond unions of conjunctive queries, naïve evaluation makes perfect sense under assumptions different from open world. Our key observations are: (1) naïve evaluation is equivalent to monotonicity of queries with respect to a semantics-induced ordering, and (2) for most reasonable semantics of incompleteness, such monotonicity is captured by preservation under various types of homomorphisms. Using these results we find classes of queries for which naïve evaluation works, for example, positive first-order formulae for the closed-world semantics. Even more, we introduce a general relation-based framework for defining semantics of incompleteness, show how it can be used to capture many known semantics and to introduce new ones, and describe classes of first-order queries for which naïve evaluation works under such semantics.