Abstract
Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be obtained with respect to given update patterns by exploiting query optimization techniques. By reducing the problem to query containment, we show that no procedure exists that always returns the best incremental test (aka simplification of integrity constraints), and this according to any reasonable criterion measuring the checking effort. In spite of this theoretical limitation, we develop an effective procedure allowing general parametric updates that, for given database classes, returns ideal simplifications and also applies to recursive databases. Finally, we point out the improvements with respect to previous methods based on an experimental evaluation.
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, San Francisco (1988)
Ceri, S., Widom, J.: Deriving production rules for constraint maintainance. In: Proceedings of VLDB 1990, pp. 566–577. Morgan Kaufmann, San Francisco (1990)
Chakravarthy, U.S., Grant, J., Minker, J.: Logic-based approach to semantic query optimization. ACM Trans. on Database Syst (TODS) 15(2), 162–207 (1990)
Decker, H.: Translating advanced integrity checking technology to sql. In: Database integrity: challenges and solutions, pp. 203–249. Idea Group Publishing, USA (2002)
Decker, H., Celma, M.: A slick procedure for integrity checking in deductive databases. In: ICLP 1994, pp. 456–469. MIT Press, Cambridge (1994)
Gupta, A., Mumick, I.S. (eds.): Materialized views: techniques, implementations, and applications. MIT Press, Cambridge (1999)
Kapur, D., Narendran, P.: Np-completeness of the set unification and matching problems. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 489–495. Springer, Heidelberg (1986)
Lee, S.Y., Ling, T.W.: Further improvements on integrity constraint checking for stratifiable deductive databases. In: VLDB 1996, pp. 495–505. Kaufmann, San Francisco (1996)
Leuschel, M., de Schreye, D.: Creating specialised integrity checks through partial evaluation of meta-interpreters. JLP 36(2), 149–193 (1998)
Lloyd, J.W., Sonenberg, L., Topor, R.W.: Integrity constraint checking in stratified databases. JLP 4(4), 331–343 (1987)
Martinenghi, D.: (2005), http://www.dat.ruc.dk/~dm/spic/index.html
Martinenghi, D.: Advanced Techniques for Efficient Data Integrity Checking. PhD thesis, Roskilde University, Denmark, in Datalogiske Skrifter, 105 (2005), http://www.ruc.dk/dat/forskning/skrifter/DS105.pdf
Martinenghi, D., Christiansen, H.: Efficient integrity checking for databases with recursive views. In: Eder, J., Haav, H.-M., Kalja, A., Penjam, J. (eds.) ADBIS 2005. LNCS, vol. 3631, pp. 109–124. Springer, Heidelberg (2005)
Naughton, J.F., Ramakrishnan, R., Sagiv, Y., Ullman, J.D.: Efficient evaluation of right-, left-, and mult-linear rules. In: SIGMOD 1989, pp. 235–242. ACM Press, New York (1989)
Nicolas, J.-M.: Logic for improving integrity checking in relational data bases. Acta Informatica 18, 227–253 (1982)
Qian, X.: An effective method for integrity constraint simplification. In: ICDE 1988, pp. 338–345. IEEE Computer Society Press, Los Alamitos (1988)
Sadri, F., Kowalski, R.: A theorem-proving approach to database integrity. In: Foundations of Deductive Databases and Logic Programming, pp. 313–362. Kaufmann, Los Altos (1988)
Seljée, R.: A new method for integrity constraint checking in deductive databases. Data Knowl. Eng. 15(1), 63–102 (1995)
Seljée, R., de Swart, H.C.M.: Three types of redundancy in integrity checking: An optimal solution. Data Knowl. Eng. 30(2), 135–151 (1999)
Shmueli, O.: Decidability and expressiveness aspects of logic queries. In: Proceedings of the sixth ACM PODS symposium, pp. 237–249. ACM Press, New York (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christiansen, H., Martinenghi, D. (2005). Incremental Integrity Checking: Limitations and Possibilities. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_49
Download citation
DOI: https://doi.org/10.1007/11591191_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30553-8
Online ISBN: 978-3-540-31650-3
eBook Packages: Computer ScienceComputer Science (R0)