Skip to main content

Refined Rules Termination Analysis Through Activation Path

  • Conference paper
Advances in Web-Age Information Management (WAIM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3739))

Included in the following conference series:

Abstract

Supporting active rules has become an important characteristic of modern database systems. While active rules termination is an undecidable problem, several recent works have suggested proving termination by using triggering and activation graphs. In this paper, we propose such concepts as activation reachable, activation path, inhibited activation cycle, inhibited activation rule, effective activation path to refine these works. Based on these concepts and the formula constructed for an effective activation path, we show how to determine the termination of active rules set. The analytical results prove that our approach can detect more termination situations than existing works. Moveover, the proposed approach is practical and general with respect to the various rule languages from Event-Condition-Action language for XML to the trigger language in SQL: 1999 standard. As a result, it can be easily applied to modern database systems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Aiken, A., Widom, J., Hellerstein, J.: Behavior of Database Productions Rules: Termination, Confluence, and Observable Determinism. In: Proc. Int’l Conf. On Management of Data (SIGMOD), San Diego, California (1992)

    Google Scholar 

  2. Baralis, E., Ceri, S., et al.: Compile-Time and Runtime Analysis of Active Behaviors. IEEE Transactions on Knowledge and Data Engineering 10(3), 353–370 (1998)

    Article  Google Scholar 

  3. Baralis, E., Ceri, S., et al.: Improved Rule Analysis by Means of Triggering and Activation Graphs. In: Proc. Int’l Second Workshop Rules in Database Systems (RIDS), Athens, Greence (1995)

    Google Scholar 

  4. Bae, J., Bae, H., et al.: Automatic Control of Workflow Processes Using ECA Rules. IEEE Transactions on Knowledge and Data Engineering 16(8), 1010–1018 (2004)

    Article  Google Scholar 

  5. Bonifati, A., Ceri, S., Paraboschi, S.: Active rules for XML. A new paradigm for e-services. VLDB Journal 10(1), 39–47 (2001)

    MATH  Google Scholar 

  6. Bailey, J., Poulovassilis, A., Wood, P.T.: An event-condition-action language for XML. In: Proc. WWW 2002, Hawaii, pp. 486–495 (2002)

    Google Scholar 

  7. Bailey, J., Dong, G., et al.: On the Decidability of the Termination Problem of Active Database System. Theor. Comput. Sci. 311(1-3), 389–437 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Aiken, A., Hellerstein, J., Widom, J.: Static Analysis Techniques for Predicting the Behavior of Database Production Rules. ACM Transactions on Database Systems 20(1), 3–41 (1995)

    Article  Google Scholar 

  9. Karadimce, A.P., Urban, S.D.: Refined Triggering Graph: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database. In: Proc. Int’l Conf. On Data Engineering (ICDE), New-Orlean, Louisiana (1996)

    Google Scholar 

  10. Lee, S.Y., Ling, T.W.: Refined Termination Decision in Active Databases. In: Proc. Int’l Conf. On Database and Expert Systems Applications (DEXA), Toulouse, France (1997)

    Google Scholar 

  11. Lee, S.Y., Ling, T.W.: A path removing technique for detecting trigger termination. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, p. 341. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Baralis, E., Widom, J.: An Algebraic Approach to Static Analysis of Active Database Rules. ACM Transactions on Database Systems 25(3), 269–332 (2000)

    Article  Google Scholar 

  13. Comai, S., Tanca, L.: Termination and Confluence by Rule Prioritization. IEEE Transactions on Knowledge and Data Engineering 15(2), 257–270 (2003)

    Article  Google Scholar 

  14. Bailey, J., Poulovassilis, A.: Abstract interpretation framework for termination analysis in functional active databases. Journal of Intelligent Information Systems 12(2/3), 243–273 (1999)

    Article  Google Scholar 

  15. Paton, N.W., et al.: Active Database System. ACM Computing Surveys 31(1), 63–103 (1999)

    Article  Google Scholar 

  16. Ceri, S., Fraternali, P., et al.: Active Rule Management in Chimera. In: Ceri, S., Widom, J. (eds.) Active Database Systems. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

  17. Leverenz, L., et al.: SQL Reference, Handbook. Oracle Corporation (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiong, Z., Hao, Z. (2005). Refined Rules Termination Analysis Through Activation Path. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_35

Download citation

  • DOI: https://doi.org/10.1007/11563952_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29227-2

  • Online ISBN: 978-3-540-32087-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics