Skip to main content

Computing Rules for Detecting Contradictory Transaction Termination Dependencies

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 1999)

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

  • 250 Accesses

Abstract

Complex applications consist of a large set of interrelated transactions. Often, it is very difficult for the application/transaction designer to get a grasp of the transitive relationships among the transactions of a complex application. In this paper, we discuss transitive termination dependencies under consideration of transaction compensation and present an algorithm to derive a set of rules for reasoning about transitive dependencies. These rules may help the designer in understanding the entire semantics of a complex application and detecting contradictory dependency specifications.

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

Access this chapter

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. P. C. Attie, M. P. Singh, E. A. Emerson, A. Sheth, M. Rusinkiewicz. Scheduling Workflows by Enforcing Intertask Dependencies. Distributed Systems Engineering, 3(4):222–238, 1996.

    Article  Google Scholar 

  2. A. Buchmann, M. T. Özsu, M. Hornick, D. Georgakopoulos, F. Manola. A Transaction Model for Active Distributed Object Systems. In A. K. Elmagarmid, ed., Database Transaction Models for Advanced Applications, pp. 123–151, Morgan Kaufmann, 1992.

    Google Scholar 

  3. P. K. Chrysanthis, K. Ramamritham. Synthesis of Extended Transaction Models Using ACTA. ACM Transaction on Database Systems, 19(3):450–491, 1994.

    Article  Google Scholar 

  4. U. Dayal, M. Hsu, R. Ladin. A Transaction Model for Long-Running Activities. In G. M. Lohmann, A. Sernadas, and R. Camps, eds., Proc. of the 17th Int. Conf. on Very Large Data Bases, VLDB’91, pp. 113–122. Morgan Kaufmann, 1991.

    Google Scholar 

  5. H. Garcia-Molina. Using Semantic Knowledge for Transaction Processing in a Distributed Database. ACM TODS, 8(2):186–213, 1983.

    Article  Google Scholar 

  6. D. Georgakopoulos, M. Hornick, P. Krychniak. An Environment for the Specification and Management of Extended Transactions in DOMS. In H.-J. Schek, A. P. Sheth, and B. D. Czejdo, eds., RIDE-IMS’93, Proc. of the 3rd Int. Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems, pp. 253–257. IEEE CS, 1993.

    Google Scholar 

  7. R. Günthör. The Dependency Manager: A Base Service for Transactional Workflow Management. In RIDE’96, Proc. of the 6th Int. Workshop on Research Issues in Data Engineering: Interoperability in Nontraditional Database Systems, pp. 86–95. IEEE CS, 1996.

    Google Scholar 

  8. K. Schwarz, C. Türker, G. Saake. Derived Transaction Termination Dependencies: An Algorithm for Computing Transitivity Rules. Preprint 7, Fakultät für Informatik, Universität Magdeburg, 1998.

    Google Scholar 

  9. K. Schwarz, C. Türker, G. Saake. Transitive Dependencies in Transaction Closures. In B. Eaglestone, B. C. Desai, J. Shao, eds., Proc. of the 1998 Int. Database Engineering and Applications Symposium (IDEAS’98), pp. 34–43. IEEE CS, 1998.

    Google Scholar 

  10. M. P. Singh. Synthesizing Distributed Constrained Events from Transactional Workflow. In S. Y. W. Su, ed., Proc. of the 12th IEEE Int. Conf. on Data Engineering, ICDE’96, pp. 616–623. IEEE CS, 1996.

    Google Scholar 

  11. D. Worah, A. Sheth. Transactions in Transactional Workflows. In S. Jajodia, L. Kerschberg, eds., Advanced Transaction Models and Architectures, chapter 1, pp. 3–34, Kluwer, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schwarz, K., Türker, C., Saake, G. (1999). Computing Rules for Detecting Contradictory Transaction Termination Dependencies. In: Eder, J., Rozman, I., Welzer, T. (eds) Advances in Databases and Information Systems. ADBIS 1999. Lecture Notes in Computer Science, vol 1691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48252-0_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-48252-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66485-7

  • Online ISBN: 978-3-540-48252-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics