Abstract
This paper introduces and studies a declarative framework for updating views over indefinite databases. An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant. The paper formalizes views over such databases as indefinite deductive databases, and defines for them several classes of database repairs that realize view-update requests. Most notable is the class of constrained repairs. Constrained repairs change the database “minimally” and avoid making arbitrary commitments. They narrow down the space of alternative ways to fulfill the view-update request to those that are grounded, in a certain strong sense, in the database, the view and the view-update request.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bry, F.: Intensional updates: Abduction via deduction. In: Proceedings of ICLP 1990, pp. 561–575. MIT Press, Cambridge (1990)
Console, L., Sapino, M.L., Dupré, D.T.: The role of abduction in database view updating. J. Intell. Inf. Syst. 4(3), 261–280 (1995)
Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: Semantics and complexity. Theor. Comput. Sci. 189(1-2), 129–177 (1997)
Eshghi, K., Kowalski, R.A.: Abduction compared with negation by failure. In: Proceedings of ICLP 1989, pp. 234–254. MIT Press, Cambridge (1989)
Farré, C., Teniente, E., Urpí, T.: Handling Existential Derived Predicates in View Updating. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 148–162. Springer, Heidelberg (2003)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP/SLP 1988, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput. 9(3/4), 365–386 (1991)
Greco, S., Spezzano, F., Trubitsyna, I.: Stratification criteria and rewriting techniques for checking chase termination. PVLDB 4(11), 1158–1168 (2011)
Kakas, A.C., Mancarella, P.: Database updates through abduction. In: Proceedings of the Sixteenth International Conference on Very Large Databases, pp. 650–661. Morgan Kaufmann Publishers Inc., San Francisco (1990)
Libkin, L.: A Semantics-Based Approach to Design of Query Languages for Partial Information. In: Thalheim, B. (ed.) Semantics in Databases 1995. LNCS, vol. 1358, pp. 170–208. Springer, Heidelberg (1998)
Mayol, E., Teniente, E.: Consistency preserving updates in deductive databases. IEEE TDKE 47(1), 61–103 (2003)
Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 55–76. Plenum Press (1978)
Teniente, E., Olivé, A.: Updating knowledge bases while maintaining their consistency. VLDB J. 4(2), 193–241 (1995)
Todd, S.: Automatic constraint maintenance and updating defined relations. In: IFIP Congress, pp. 145–148 (1977)
Türker, C., Gertz, M.: Semantic integrity support in sql: 1999 and commercial (object-)relational database management systems. VLDB J. 10(4), 241–269 (2001)
Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caroprese, L., Trubitsyna, I., Truszczyński, M., Zumpano, E. (2012). The View-Update Problem for Indefinite Databases. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33353-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33352-1
Online ISBN: 978-3-642-33353-8
eBook Packages: Computer ScienceComputer Science (R0)