Affiliation:
1. LIAFA (Université Paris Diderot - Paris 7 and CNRS), France
2. University of Edinburgh, UK
3. LSV at ENS-Cachan, INRIA and CNRS, France
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference40 articles.
1. S. Abiteboul R. Hull and V. Vianu 1995. Foundations of Databases. Addison-Wesley. S. Abiteboul R. Hull and V. Vianu 1995. Foundations of Databases. Addison-Wesley.
2. On the representation and querying of sets of possible worlds
3. Representing and querying XML with incomplete information
4. Monotone versus positive
5. M. Arenas P. Barcelo L. Libkin and F. Murlak. 2014. Foundations of Data Exchange. Cambridge University Press. M. Arenas P. Barcelo L. Libkin and F. Murlak. 2014. Foundations of Data Exchange. Cambridge University Press.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings;Theory and Practice of Logic Programming;2023-11-28
2. Troubles with nulls, views from the users;Proceedings of the VLDB Endowment;2022-07
3. Queries with Arithmetic on Incomplete Databases;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29
4. Coping with Incomplete Data: Recent Advances;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29
5. Temporal data exchange;Information Systems;2020-01