Advertisement

Acta Informatica

, Volume 31, Issue 6, pp 573–600 | Cite as

Update operations in deductive databases with functional dependencies

  • Riccardo Torlone
Article

Abstract

We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions ofrepresentability, consistency anddeterminism are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S.: Updates, a new frontier. In: ICDT'88, Second International Conference on Data Base Theory, Bruges. (Lect. Notes Comput. Sci., vol. 326, pp. 1–18) Berlin Heidelberg New York: Springer 1988Google Scholar
  2. 2.
    Atzeni, P., Torlone, R.: Solving ambiguities in updating deductive databases. In: MFDBS'91, Mathematical Fundamentals of Data Base Systems, Rostock, Germany. (Lect. Notes Comput. Sci., vol. 495, pp. 104–118) Berlin Heidelberg New York: Springer 1991Google Scholar
  3. 3.
    Atzeni, P., Torlone, R.: Updating intensional predicates in Datalog. Data Knowl. Eng.7(8):1–17 (1992)Google Scholar
  4. 4.
    Atzeni, P., Torlone, R.: Updating relational databases through weak instance interfaces. ACM Trans. Database Syst.17(4):718–746 (Dec. 1992)Google Scholar
  5. 5.
    Bancilhon, F., Spyratos, N.: Update semantics of relational views. ACM Trans. Database Syst.6(4):557–575 (1981)Google Scholar
  6. 6.
    Biskup, J., Convent, B.: Relational chase procedures interpreted as resolution with paramodulation. Fundam. Inf.15(8):123–138 (1991)Google Scholar
  7. 7.
    Bry, F.: Intensional updates: abduction via deduction. In: 7th International Conference on Logic Programming, pp. 561–575, 1990Google Scholar
  8. 8.
    Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Data Bases. Berlin Heidelberg New York: Springer 1989Google Scholar
  9. 9.
    Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.: Decidable optimization problems for database logic programs. In: Twentieth ACM SIGACT Symposium on Theory of Computing pp. 477–490, 1988.Google Scholar
  10. 10.
    Cosmadakis, S.S., Papadimitriou, C.H.: Updates of relational views. J. ACM31(4):742–760 (1984)Google Scholar
  11. 11.
    Dayal, U., Bernstein, P.A.: On the correct translation of update relations on relational views. ACM Trans. Database Syst.8(3):381–416 (1982)Google Scholar
  12. 12.
    Decker, H.: Drawing updates from derivations. In: ICDT'90, Third International Conference on Data Base Theory, Paris. (Lect. Notes Comput. Sci., vol. 470, pp. 437–451) Berlin Heidelberg New York: Springer 1990Google Scholar
  13. 13.
    Fagin, R., Kuper, G.M., Ullman, J.D., Vardi, M.Y.: Updating logical databases. In: Kanellakis, P.C., Preparata, F.P. (eds.) Advances in computing research, vol. 3, pp. 1–18. London: JAI Press 1986Google Scholar
  14. 14.
    Fagin, R., Ullman, J.D., Vardi, M.Y.: On the semantics of updates in databases. In: Second ACM SIGACT SIGMOD Symposium on Principles of Database Systems, pp. 352–365, 1983Google Scholar
  15. 15.
    Gottlob, G., Paolini, P., Zicari, R.: Properties and update semantics of consistent views. ACM Trans. Database Syst.13(4):486–524 (1988)Google Scholar
  16. 16.
    Guessoum, A., Lloyd, J.W.: Updating knowledge bases. New Generation Comput.8(1):71–89 (1990)Google Scholar
  17. 17.
    Guessoum, A., Lloyd, J.W.: Updating knowledge bases II. New Generation Comput.10(1):73–100 (1991)Google Scholar
  18. 18.
    Honeyman, P.: Testing satisfaction of functional dependencies. J. ACM29(3):668–677 (1982)Google Scholar
  19. 19.
    Kakas, A.C., Mancarella, P.: Database updates through abduction. In: Sixteenth International Conference on Very Large Data Bases, Brisbane, pp. 650–661, 1990Google Scholar
  20. 20.
    Keller, A.M.: Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In: Fourth ACM SIGACT SIGMOD Symposium on Principles of Database Systems, pp. 154–163, 1985Google Scholar
  21. 21.
    Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Berlin Heidelberg New York: Springer 1987Google Scholar
  22. 22.
    Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst.4(4):455–468 (1979)Google Scholar
  23. 23.
    Manchanda, S., Warren, D.S.: A logic-based language for database updates. In: Minker, I. (eds.) Foundations of deductive databases and logic programming. pp. 363–394,. Los Altos: Morgan Kaufman 1988Google Scholar
  24. 24.
    Mendelzon, A.O., Woods, P.T.: Functional dependencies in horn clause queries. ACM Trans. Database Syst.16(4):31–55 (1991)Google Scholar
  25. 25.
    Naqvi, S., Krishnamurthy, R.: Database updates in logic programming. In: Seventh ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems, pp. 251–262, 1988Google Scholar
  26. 26.
    Naughton, J.: Data independent recursion in deductive databases. In: Fifth ACM SIGACT SIGMOD Symposium on Principles of Database Systems, pp. 267–279, 1986Google Scholar
  27. 27.
    Naughton, J..: Minimizing function-free recursive inference rules. J. ACM36(1).:69–91 (1989)Google Scholar
  28. 28.
    Peirce, C.S.: Collected papers of Charles Sanders Peirce, vol. 2, Cambridge: Harvard University Press 1958Google Scholar
  29. 29.
    Rossi, F., Naqvi, S.: Contributions to the view update problem. In: 6th International Conference on Logic Programming, pp. 398–415, 1989Google Scholar
  30. 30.
    Sadri, F., Kowalski, R.: A theorem-proving approach to database integrity. In: Minker, J. (eds.) Foundations of deductive databases and logic programming, pp. 313–362. Los Altos: Morgan Kaufman 1988Google Scholar
  31. 31.
    Sagiv, Y.: Optimizing Datalog programs. In: Minker, J. (eds.) Foundations of deductive databases and logic programming, pp. 627–658. Los Altos: Morgan Kaufman 1988Google Scholar
  32. 32.
    Tomasic, A.: View update translation via deduction and annotation. In: ICDT'88, Second International Conference on Data Base Theory, Bruges. (Lect. Notes Comput. Sci., vol. 326, pp. 338–352) Berlin Heidelberg New York: Springer 1988Google Scholar
  33. 33.
    Torlone, R., Atzeni, P.: Updating deductive databases with functional dependencies. In: DOOD'91, Second International Conference on Deductive and Object-Oriented Databases, Munich. (Lect. Notes Comput. Sci vol. 566, pp. 278–291) Berlin Heidelberg New York: Springer 1991Google Scholar
  34. 34.
    Ullman, J.D.: Principles of database and knowledge base systems, volume 1 & 2. Potomac, Maryland: Computer Science Press 1988Google Scholar
  35. 35.
    Vardi, M.Y.: Decidability and undecidability results for boundedness of linear recursive queries. In: Seventh ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems, pp. 341–351, 1988Google Scholar
  36. 36.
    Wilkins, M.W.: A model-theoretic approach to updating logical databases. In: Fifth ACM SIGACT SIGMOD Symposium on Principles of Database Systems, pp. 224–234, 1986Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Riccardo Torlone
    • 1
  1. 1.IASI-CNRRomaItaly

Personalised recommendations