Abstract
In this paper, we study the problem to compute certain answers in case when view definitions are expressed as non-recursive datalog programs with negation and queries are expressed as semi-positive non-recursive datalog programs with negation. Two situations are analyzed: the open world assumption (OWA) and the close world assumption (CWA). Associated to a view, and an extension of the view, a tree is constructed, which is useful to specify a method to compute certain answers.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: PODS, pp. 254–263 (1998)
Afrati, F., Li, C., Mitra, P.: Rewriting queries using views in the presence of arithmetic comparisons. Theoretical Computer Science 368, 88–123 (2006)
Arenas, M., Bertossi, L., Chomicki, J.: Answer set for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming 3, 394–424 (2003)
Call, A., Lembro, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: IJCAI 2003, pp. 16–21 (2003)
Call, A., Lembro, D., Rosati, R.: On the Decodability and Complexity of Query Answering over Inconsistent and Incomplete Databases. In: PODS, pp. 260–271 (2003)
Calvanese, D., Giacomo, G. De., Lenzerini, M., Vardi, M.Y.: View-based query processing. On the relationship between rewriting, answering and losslessness. Theoretical Computer Science 371, 169–182 (2007)
Calvanese, D.,Giacomo, G. De., Lenzerini, M., Vardi, M.Y.: Answering Regular Path Queries Views. In: Proc. of the 16th IEEE Int. Conf. on Data Engineering, ICDE, pp. 389–398 (2000)
Caniupan, M., Bertossi, L.: The consistency extractor system: Answer set programs for consistent query answering in databases. Data and Knowledge Engineering 69, 545–572 (2010)
Chomicki, J.: Consistent Query Answering, Recent Developments and Future Directions, http://cse.buffalo.edu/~chomicki/papers-iicis0
Duschka, O.M., Genesereth, M.R., Levy, A.: Recursive Query Plans for Data Integration. Journal of Logic Programming 43(1), 49–73 (2000)
Fagin, R., Kolaitis, P.G., Popa, L., Miller, R.J.: Data Exchange: Semantics and Query Answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)
Flesca, S., Greco, S.: Rewriting queries using views. IEEE Trans. Knowledge Data Engineering 13(6), 980–995 (2001)
Millstein, T., Halevy, A., Friedman, M.: Query containment for data integration systems. JCSS 66, 20–39 (2003)
Nash, A., Segoufin, L., Vianu, V.: Views and Queries. Determinacy and Rewriting. ACM TODS 35(3) (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Felea, V. (2011). Certain Answers for Views and Queries Expressed as Non-recursive Datalog Programs with Negation. In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20039-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-20039-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20038-0
Online ISBN: 978-3-642-20039-7
eBook Packages: Computer ScienceComputer Science (R0)