Skip to main content
SpringerLink
Log in

Database Programming in Transaction Logic

  • Conference paper
Database Programming Languages (DBPL-4)

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion for the phenomenon of state changes in logic programs and databases. It has a natural model theory and a sound and complete proof theory, but, unlike many other logics, it allows users to program transactions. In addition, the semantics leads naturally to features whose amalgamation in a single logic has proved elusive in the past. Finally, Transaction Logic holds promise as a logical model of hitherto non-logical phenomena, including so-called procedural knowledge in AI, and the behavior of object-oriented databases, especially methods with side effects. This paper focuses on the applications of T r to database systems, including transaction definition and execution, nested transactions, view updates, consistency maintenance, bulk updates, non-determinism, sampling, active databases, dynamic integrity-constraints, hypothetical reasoning, and imperative-style programming.

Work supported in part by an Operating Grant from the Natural Sciences and Engineering Research Council of Canada and by a Connaught Grant from the University of Toronto.

Supported in part by NSF grant CCR-9102159 and a grant from New York Science and Technology Foundation. Work done during sabbatical year at the University of Toronto. Support of Computer Systems Research Institute of University of Toronto is gratefully acknowledged.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and A.J. Bonner. Objects and views. In ACM SIGMOD Conference on Management of Data, pages 238–247, Denver, Colorado, May 29–31 1991.

    Google Scholar 

  2. S. Abiteboul and V. Vianu. Procedural and declarative database update languages. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 240–250, 1988.

    Google Scholar 

  3. R. Agrawal, R. Cochrane, and B. Lindsay. On maintaining priorities in a production rule system. In Intl. Conference on Very Large Data Bases (VLDB), pages 479–487, 1991.

    Google Scholar 

  4. J.F. Allen. Towards a general theory of action and time. Artificial Intelligence, 23: 123–154, July 1984.

    Article  MATH  Google Scholar 

  5. F. Bancilhon. A logic-programming/Object-oriented cocktail. SIGMOD Record, 15 (3): 11–21, September 1986.

    Article  Google Scholar 

  6. T. Barsalou, N. Siambela, A.M. Keller, and G. Wiederhold. Updating relational databases through object-based views. In ACM SIGMOD Conference on Management of Data, pages 248–257, Denver, Colorado, May 29–31 1991.

    Google Scholar 

  7. C. Beeri. New data models and languages The challenge. In ACM SIGACT-SIGMOD-SIGART Symposium, on Principles of Database Systems (PODS), pages 1–15, San Diego, CA, June 1992.

    Google Scholar 

  8. C. Beeri and T. Milo. A model for active object-oriented database. In Intl. Conference on Very Large Data Bases (VLDB), pages 337–349, 1991.

    Google Scholar 

  9. A.J. Bonner. Hypothetical datalog: Complexity and expressibility. Theoretical Computer Science, 76: 3–51, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  10. A.J. Bonner and M. Kifer. Transaction logic programming (or a logic of declarative and procedural knowledge). Technical Report CSRI-270, University of Toronto, April 1992. Revised: August 1993. Available in csri-technical-reports/270/report. ps

    Google Scholar 

  11. A.J. Bonner and M. Kifer. Transaction logic: An (early) exposé. In V.S. Alagar, L.V.S. Lakshmanan, and F. Sadri, editors, Proceedings of the Workshop on Formal Methods in Databases and Software Engineering, Workshops in Computing, pages 1–23. Springer Verlag, 1993. Keynote address. Workshop held 15–16 May, 1992, Montreal, Canada.

    Google Scholar 

  12. A.J. Bonner and M. Kifer. Transaction logic programming. In Intl. Conference on Logic Programming (ICLP), Budapest, Hungary, June 1993.

    Google Scholar 

  13. F. Bry. Intensional updates: Abduction via deduction. In Intl. Conference on Logic Programming (ICLP), Jerusalem, Israel, June 1990.

    Google Scholar 

  14. A.K. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21 (2): 156–178, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  15. A.K. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25 (1): 99–128, 1982.

    Article  MATH  Google Scholar 

  16. W. Chen. Declarative specification and evaluation of database updates. In Intl. Conference on Deductive and Object-Oriented Databases (DOOD), volume 566 of Lecture Notes in Computer Science, pages 147–166. Springer Verlag, December 1991.

    Chapter  Google Scholar 

  17. C. de Maindreville and E. Simon. Non-deterministic queries and updates in deductive databases. In Intl. Conference on Very Large Data Bases (VLDB), 1988.

    Google Scholar 

  18. N. Gehani and V. Jagadish. ODE as an active database: Constraints and triggers. In Intl. Conference on Very Large Data Bases (VLDB), pages 327–336, 1991.

    Google Scholar 

  19. G. Grahne and A.O. Mendelzon. Updates and subjunctive queries. Technical Report KRR-TR-91–4, CSRI, University of Toronto, July 1991.

    Google Scholar 

  20. D. Harel, D. Kozen, and R. Parikh. Process Logic: Expressiveness, decidability, completeness. Journal of Computer and System Sciences, 25 (2): 144–170, October 1982.

    Article  MathSciNet  MATH  Google Scholar 

  21. R. Hull and D. Jacobs. Language constructs for programming active databases. In Intl. Conference on Very Large Data Bases (VLDB), pages 455–467, 1991.

    Google Scholar 

  22. H. Katsuno and A.O. Mendelzon. On the difference between updating a knowledge database and revising it. In Proceedings of the International Conference on Knowledge Representation and Reasoning (KR), pages 387394, Boston, Mass., April 1991.

    Google Scholar 

  23. M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and frame-based languages. Technical Report 93/06, Department of Computer Science, SUNY at Stony Brook, April 1993. To appear in J. of ACM.

    Google Scholar 

  24. R. Krishnamurthy and S. Naqvi. Non-deterministic choice in datalog. In Proceedings of the 3-d Intl. Conference on Data and Knowledge Bases, pages 416–424. Morgan-Kaufmann Publ., 1988.

    Google Scholar 

  25. S. Manchanda and D.S. Warren. A logic-based language for database updates. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 363–394. Morgan-Kaufmann, Los Altos, CA, 1988.

    Google Scholar 

  26. D.R. McCarthy and U. Dayal. The architecture of an active database management system. In ACM SIGMOD Conference on Management of Data, pages 215–224, 1989.

    Google Scholar 

  27. S. Naqvi and R. Krishnamurthy. Database updates in logic programming. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 251–262, March 1988.

    Google Scholar 

  28. G. Phipps, M.A. Derr, and K.A. Ross. Glue-Nail: A deductive database system. In ACM SIGMOD Conference on Management of Data, pages 308–317, 1991.

    Google Scholar 

  29. T.C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, Los Altos, CA, 1988.

    Google Scholar 

  30. D. Sacca and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 205–217, April 1990.

    Chapter  Google Scholar 

  31. M. Stonebraker, A. Jhingran, J. Goh, and S. Potamianos. On rules, procedures, caching and views in data base systems. In ACM SIGMOD Conference on Management of Data, pages 281–290, 1990.

    Google Scholar 

  32. J. Widom. A denotational semantics for the starbust production rule language. ACM SIGMOD Record, 21 (3): 4–9, 1992.

    Article  Google Scholar 

  33. J. Widom, R.J. Cochrane, and B.G. Lindsay. Implementing set-oriented production rules as an extension to starbust. In Intl. Conference on Very Large Data Bases (VLDB), pages 275–285, 1991.

    Google Scholar 

  34. J. Widom and S.J. Finkelstein. Set-oriented production rules in relational database systems. In ACM SIGMOD Conference on Management of Data, pages 259–270, 1990.

    Google Scholar 

  35. M. Winslett. A model based approach to updating databases with incomplete information. ACM Transactions on Database Systems,13(2):167196,1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 1A4, Canada

    Anthony J. Bonner

  2. Department of Computer Science, SUNY at Stony Brook, Stony Brook, NY, 11790, USA

    Michael Kifer

  3. Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 1A4, Canada

    Mariano Consens

Authors
  1. Anthony J. Bonner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kifer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mariano Consens
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, The Hebrew University of Jerusalem, 91904, Givat-Ram, Jerusalem, Israel

    Catriel Beeri PhD

  2. Research Institute for Mathematical Sciences, Kyoto University, Kitashirakawa, Sakyo-ku, 606-01, Kyoto, Japan

    Atsushi Ohori PhD

  3. Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012-1185, New York, NY, USA

    Dennis E. Shasha PhD

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonner, A.J., Kifer, M., Consens, M. (1994). Database Programming in Transaction Logic. In: Beeri, C., Ohori, A., Shasha, D.E. (eds) Database Programming Languages (DBPL-4). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3564-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3564-7_18

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19853-6

  • Online ISBN: 978-1-4471-3564-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation