Skip to main content
SpringerLink
Log in

Logical transactions and serializability

  • Conference paper
  • First Online:
Transactions and Change in Logic Databases (DYNAMICS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1472))

Abstract

The concept of logic databases can serve as a clear and expressive foundation of various kinds of information systems. However, classical logic languages refer to a single database state, whereas in modern information systems it is necessary to take dynamic behaviour into account. For this purpose, several update languages have been proposed, among them [1,5,6,9,16,17,18,23], which allow to specify complex transitions from one database state to another. From the evaluation point of view, a complex state transition can and should be considered as a transaction. Up to now, the isolation property of transactions has been poorly addressed in the context of logic update languages, although it is an important problem even for classical, sequential transactions (see

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufmann Publishers, San Mateo, CA, 1988.

    Google Scholar 

  3. C. Beeri, P. A. Bernstein, and N. Goodman. A model for concurrency in nested transaction systems. Journal of the ACM, 36(2):230–269, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Company, 1987.

    Google Scholar 

  5. A. J. Bonner and M. Kifer. An overview of Transaction Logic. Theoretical Computer Science, 133:205–265, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. J. Bonner and M. Kifer. Concurrency and communication in Transaction Logic. In Proc. Joint Int. Conf. and Symp. on Logic Programming (JICSLP '96), Bonn, Germany, pages 142–156, 1996.

    Google Scholar 

  7. A. J. Bonner and M. Kifer. The state of change: A survey. In B. Freitag, H. Decker, M. Kifer, and A. Voronkov, editors, Transactions and Change in Logic Databases, volume 1472 of LNCS, pages 1–36. Springer-Verlag, Berlin, Germany, 1998.

    Google Scholar 

  8. W. Chen. Declarative updates of relational databases. ACM Transactions on Database Systems, 20(1):42–70, 1995.

    Article  Google Scholar 

  9. W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587–599, 1997.

    Article  Google Scholar 

  10. C. Elkan. Independence of logic database queries and updates. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 154–160, 1990.

    Google Scholar 

  11. S. Ghandeharizadeh, R. Hull, and D. Jacobs. Heraclitus: Elevating deltas to be first-class citizens in a database programming language. ACM Transactions on Database Systems, 21(3):370–426, 1996.

    Article  Google Scholar 

  12. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers, San Mateo, CA, 1993.

    MATH  Google Scholar 

  13. U. Halici and A. Dogac. An optimistic locking technique for concurrency control in distributed databases. IEEE Transactions on Software Engineering, 17(7):712–724, 1991.

    Article  Google Scholar 

  14. A. Lefebvre. Towards an efficient evaluation of recursive aggregates in deductive databases. New Generation Computing, 12(2):131–160, 1994.

    Article  MATH  Google Scholar 

  15. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, Germany, 2nd edition, 1987.

    MATH  Google Scholar 

  16. B. Ludäscher, U. Hamann, and G. Lausen. A logical framework for active rules. In Proc. 7th Int. Conf. on Management of Data (COMAD '95), Pune, India, 1995.

    Google Scholar 

  17. 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 Publishers, San Mateo, CA, 1988.

    Google Scholar 

  18. D. Montesi, E. Bertino, and M. Martelli. Transactions and updates in deductive databases. IEEE Transactions on Knowledge and Data Engineering, 9(5):784–797, 1997.

    Article  Google Scholar 

  19. J. E. B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. MIT Press, 1985.

    Google Scholar 

  20. K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 442–453, 1994.

    Google Scholar 

  21. A. van Gelder. The well-founded semantics of aggregation. In Proc. 11th ACM Symp. on Principles of Database Systems, pages 127–138, 1992.

    Google Scholar 

  22. A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(2):620–650, 1991.

    MATH  Google Scholar 

  23. C. A. Wichert and B. Freitag. Capturing database dynamics by deferred updates. In Proc. Int. Conf. on Logic Programming (ICLP '97), Leuven, Belgium, pages 226–240, 1997.

    Google Scholar 

  24. C. A. Wichert and B. Freitag. Capturing database dynamics by deferred updates. Technical Report MIP-9704, Universität Passau (FMI), 1997. Available in the WWW:http://www.fmi.uni-passau.de/~freitag/papers/.

    Google Scholar 

  25. C. A. Wichert, B. Freitag, and A. Fent. Logical transactions and serializability. Technical Report MIP-9807, Universität Passau (FMI), 1998. Available in the WWW:http://www.fmi.uni-passau.de/~freitag/papers/.

    Google Scholar 

  26. U. Zukowski and B. Freitag. The deductive database system LOLA. In Proc. 4th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR '97), Dagstuhl, Germany, pages 375–386, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik, Universität Passau, D-94030, Passau, Germany

    Carl-Alexander Wichert, Burkhard Freitag & Alfred Fent

Authors
  1. Carl-Alexander Wichert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Burkhard Freitag
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alfred Fent
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Burkhard Freitag Hendrik Decker Michael Kifer Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wichert, CA., Freitag, B., Fent, A. (1998). Logical transactions and serializability. In: Freitag, B., Decker, H., Kifer, M., Voronkov, A. (eds) Transactions and Change in Logic Databases. DYNAMICS 1997. Lecture Notes in Computer Science, vol 1472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055498

Download citation

  • DOI: https://doi.org/10.1007/BFb0055498

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65305-9

  • Online ISBN: 978-3-540-49449-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation