ABSTRACT
The term naive evaluation refers to evaluating queries over incomplete databases as if nulls were usual data values, i.e., 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 naive evaluation computes them: i.e., 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 naive 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, naive evaluation makes perfect sense under assumptions different from open-world. Our key observations are: (1) naive evaluation is equivalent to monotonicity of queries with respect to a semantics-induced ordering, and (2) for most reasonable semantics, such monotonicity is captured by preservation under various types of homomorphisms. Using these results we find classes of queries for which naive evaluation works, e.g., 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 naive evaluation works under such semantics.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- S. Abiteboul, P Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. Theoretical Computer Science, 78(1):158--187, 1991. Google Scholar
Digital Library
- S. Abiteboul, L. Segoufin, and V. Vianu. Representing and querying XML with incomplete information. ACM Transactions on Database Systems, 31(1):208--254, 2006. Google Scholar
Digital Library
- M. Ajtai, Y. Gurevich. Monotone versus positive. J. ACM 34(4):1004--1015 (1987). Google Scholar
Digital Library
- M. Arenas, P. Barceló, L. Libkin, F. Murlak. Relational and XML Data Exchange. Morgan & Claypool, 2010. Google Scholar
Digital Library
- M. Arenas, J. Pérez, J. Reutter. Data exchange beyond complete data. In PODS'11, pages 83--94. Google Scholar
Digital Library
- A. Atserias, A. Dawar, P. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2):208--237 (2006). Google Scholar
Digital Library
- P. Barceló, L. Libkin, A. Poggi, and C. Sirangelo. XML with incomplete information. J. ACM 58(1): 1--62 (2010). Google Scholar
Digital Library
- P. Buneman, A. Jung, A. Ohori. Using powerdomains to generalize relational databases. Theoretical Computer Science 91(1991), 23--55. Google Scholar
Digital Library
- A. Calì, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In PODS'03, pages 260--271. Google Scholar
Digital Library
- C.C. Chang and H.J. Keisler. Model Theory. North Holland, 1990.Google Scholar
- K. Compton. Some useful preservation theorems. J. Symb. Logic 48 (1983), 427--440.Google Scholar
Cross Ref
- C. Date and H. Darwin. A Guide to the SQL Standard. Addison-Wesley, 1996.Google Scholar
Digital Library
- R. Fagin, P. Kolaitis, L. Popa. Data exchange: getting to the core. ACM TODS 30(1):174--210 (2005). Google Scholar
Digital Library
- A. Gheerbrant, L. Libkin, T. Tan. On the complexity of query answering over incomplete XMLdocuments. ICDT'12, pages 169--181. Google Scholar
Digital Library
- C. Gunter. Semantics of Programming Languages. The MIT Press, 1992. Google Scholar
Digital Library
- P. Hell and J. Ne\vset\vril. phGraphs and Homomorphisms. Oxford University Press, 2004.Google Scholar
- A. Hernich. Answering non-monotonic queries in relational dataexchange. Logical Methods in Computer Science 7(3) (2011).Google Scholar
- T. Imieliński and W. Lipski. Incomplete information in relational databases. J. ACM, 31(4):761--791, 1984. Google Scholar
Digital Library
- H. J. Keisler. Finite approximations of infinitely long formulas. In Symposium on the Theory of Models, 1965, pages 158--169.Google Scholar
- H. J. Keisler. Some applications of infinitely long formulas. Journal of Symbolic Logic, 1965, pages 339--349.Google Scholar
Cross Ref
- M. Lenzerini. Data integration: a theoretical perspective. In phProc. 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 233--246, 2002. Google Scholar
Digital Library
- L. Libkin. A semantics-based approach to design of query languages forpartial information. In Semantics in Databases, LNCS 1358, 1998, pages170--208. Google Scholar
Digital Library
- L. Libkin. Incomplete information and certain answers in general datamodels. PODS'11, pages 59--70. Google Scholar
Digital Library
- J. Minker. On indefinite databases and the closed world assumption. In CAD'82, pages 292--308. Google Scholar
Digital Library
- A. Ohori. Semantics of types for database objects. Theoretical Computer Science 76 (1990), 53--91. Google Scholar
Digital Library
- R. Reiter. On closed world data bases. In Logic and Data Bases, 1977, pages 55--76.Google Scholar
- R. Reiter. Equality and domain closure in first-order databases. J. ACM 27(2): 235--249 (1980). Google Scholar
Digital Library
- R. Reiter. Towards a logical reconstruction of relational databasetheory. In On Conceptual Modelling, 1982, pages 191--233.Google Scholar
- B. Rossman. Homomorphism preservation theorems. J. ACM 55(3): (2008). Google Scholar
Digital Library
- B. Rounds. Situation-theoretic aspects of databases. In Proceedings of Conference on Situation Theory andApplications, CSLI vol. 26, 1991, pages 229--256.Google Scholar
- A. Stolboushkin. Finitely monotone properties. In LICS'95, pages 324--330. Google Scholar
Digital Library
- M. Vardi. On the integrity of databases with incomplete information. In Proc. 5th ACM Symp. on Principles of Database Systems (1986), 252--266. Google Scholar
Digital Library
Index Terms
When is naive evaluation possible?
Recommendations
Naïve Evaluation of Queries over Incomplete Databases
Invited Articles Issue, SIGMOD 2013, PODS 2013 and ICDT 2013The 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 ...
Incomplete information and certain answers in general data models
PODS '11: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsWhile incomplete information is ubiquitous in all data models - especially in applications involving data translation or integration - our understanding of it is still not completely satisfactory. For example, even such a basic notion as certain answers ...
View-based query answering in Description Logics: Semantics and complexity
View-based query answering is the problem of answering a query based only on the precomputed answers to a set of views. While this problem has been widely investigated in databases, it is largely unexplored in the context of Description Logic ...






Comments