This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Termination and Confluence by Rule Prioritization
March/April 2003 (vol. 15 no. 2)
pp. 257-270
ASCII Text
x 
 
Sara Comai, Letizia Tanca, "Termination and Confluence by Rule Prioritization," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 2, pp. 257-270, March/April, 2003.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2003.1185831,
author = {Sara Comai and Letizia Tanca},
title = {Termination and Confluence by Rule Prioritization},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {15},
number = {2},
issn = {1041-4347},
year = {2003},
pages = {257-270},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2003.1185831},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - Termination and Confluence by Rule Prioritization
IS - 2
SN - 1041-4347
SP257
EP270
EPD - 257-270
A1 - Sara Comai,
A1 - Letizia Tanca,
PY - 2003
KW - Active databases
KW - database dynamics
KW - deductive databases
KW - termination
KW - determinism.
VL - 15
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 

Abstract—An active database system is a DBMS endowed with active rules, i.e., stored procedures activated by the system when specific events occur. The processing of active rules is characterized by two important properties: termination and confluence. We say that the processing of a set of active rules terminates if, given any initial active database state, the execution of the rules does not continue indefinitely; it is confluent if, for any initial database state, the final state is not influenced by the order of execution of the rules. Finding sufficient conditions for these properties to hold is a nontrivial problem, and the lack of a structured theory for the design of a system of active rules makes the analysis of the two properties more difficult. In this work, we translate a set of rules from any of the existing systems into an internal format; then, we translate the active rules into logical clauses, taking into account the system's execution semantics, and transfer to the active process known simple results about termination and determinism available in the literature for deductive rules.

[1] S. Abiteboul and P.C. Kanellakis,“Object identity as a query language primitive,” Proc. 1989 ACM SIGMOD Int’l Conf. the Management of Data, SIGMOD Record, vol. 18, no. 2, pp. 159-173, June 1989.
[2] S. Abiteboul and E. Simon, “Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog,” Journees Bases de Données Avancés, Geneve, Sept. 1989.
[3] A. Aiken, J. Widom, and J.M. Hellerstein, “Behavior of Database Production Rules: Termination, Confluence, and Observable Determination,” Proc. ACM SIGMOD Int'l Conf. Management of Data, M. Stonebraker, ed., pp. 59-68, May 1992.
[4] E. Baralis, S. Ceri, and S. Paraboschi, “Improved Rule Analysis by Means of Triggering and Activation Graphs,” Proc. First Int'l Workshop Rules in Database Systems, Aug. 1993.
[5] E. Baralis, S. Ceri, and J. Widom, “Better Termination Analysis for Active Databases,” Proc. Third Int'l Workshop Rules in Database Systems (RIDS '97), N.W. Paton and M.H. Williams, eds., pp. 163-175, Aug. 1993.
[6] E. Baralis, S. Ceri, and S. Paraboschi, “Modularization Techniques for Active Rules Design,” Trans. Database Systems, vol. 21, no.1, pp. 1-29, 1996.
[7] E. Baralis and J. Widom, “An Algebraic Approach to Rule Analysis in Expert Database Systems,” Proc. 20th Int'l Conf. Very Large Data Bases, pp. 475-485, Sept. 1994.
[8] L. Cabibbo, “Expressiveness of Semipositive Logic Programs with Value Invention” Proc. Int'l Workshop Logic In Databases (LID '96), pp. 467-484, July 1996.
[9] S. Ceri, G. Gottlob, and L. Tanca, "Logic Programming and Databases," Surveys in Computer Science. Springer-Verlag, 1990.
[10] S. Ceri and R. Manthey, “Consolidated Specification of Chimera,” ESPRIT Report IDEA.DE.2P.006.01, 1993.
[11] S. Comai and L. Tanca, “Using the Properties of Datalog to Prove Termination and Confluence in Active Databases” Proc. Third Int'l Workshop Rules in Database Systems (RIDS '97), pp. 100-117, June 1997.
[12] S. Comai and L. Tanca, “Termination and Confluence by Rule Prioritization,” Technical Report 5, Dip. di Elettronica e Informazione, Politecnico di Milano, downloadable fromhttp://www.elet.polimi.it/upload/comaiActiveDB , 2001.
[13] P. Fraternali and L. Tanca, “A Structured Approach for the Definition of the Semantics of the Active Databases,” ACM Trans. Database Systems, 1995.
[14] G. Gottlob, G Moerkotte, and V.S. Subrahmian, “The PARK Semantics for Active Rules,” Proc. Fifth Int'l Conf. Extending Database Technology, (EDBT '96), 1996.
[15] E.N. Hanson,"Rule condition testing and action execution in Ariel," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 49-58, June 1992.
[16] R. Hull and M. Yoshikawa,“ILOG: Declarative creation and manipulation of object identifiers,” Proc. 16th Int’l Conf. Very Large Data Bases, 1990.
[17] Illustra User's Guide, Release 3.2, October 1995.
[18] A.P. Karadimce and S.D. Urban, “Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database,” Proc. 15th Int'l Conf. Data Eng., pp. 384-391, 1996.
[19] P.G. Kolaitis and C.H. Papadimitriou, "Why Not Negation by Fixpoint?" Proc. Seventh ACM Symp. Principles of Database Systems, pp. 231-239, Mar. 1988.
[20] S.Y. Lee and T.L. Ling, “A Path Removing Technique for Detecting Trigger Termination,” Advances in Database Technology (EDBT '98), Mar. 1998.
[21] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: Springer-Verlag, 1987.
[22] B. Ludäscher, U. Hamann, and G. Lausen, “A Logical Framework for Active Rules” Proc. Seventh Int'l Conf. COMAD, Dec. 1995.
[23] ORACLE8 Server Application Developer's Guide, release 8. 2001.
[24] SQL3 Document X3H2-94-080 e SOU-003, ISO-ANSI Working Draft, Database Language SQL, 1994.
[25] M. Stonebraker,“The integration of rule systems and database systems,” IEEE Trans. Knowledge and Data Eng., vol. 4, no. 4, pp. 415-423, Oct. 1992.
[26] A. Vaduva, S. Gatziu, and K.R. Dittrich, “Investigating Termination in Active Database Systems with Expressive Rule Languages” Third Int'l Workshop Rules in Databases (RIDS '97), pp. 149-164, June 1997.
[27] L. vander Voort and A. Siebes, “Termination and Confluence of Rule Execution,” Proc. Second Int'l Conf. Information and Knowledge Management, Nov. 1993.
[28] X. Wang, J.H. You, and L.Y. Yuan, “On Confluence Property of Active Databases with Meta-Rules” Proc. Third Int'l Workshop Rules in Databases (RIDS '97), pp. 118-132, June 1997.
[29] T. Weik and A. Heuer, “An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS,” Proc. First Int'l Workshop Active and Real-Time Database Systems, (ARTDB '95), pp. 170-189, June 1995.
[30] J. Widom, “A Denotational Semantics for the Starbust Production Rule Language,” SIGMOD Record, vol. 21, no. 3, pp. 4–9, Sept. 1992.
[31] J. Widom and S.J. Finkelstein,"Set-oriented production rules in relational database systems," Proc. 1990 ACM SIGMOD Int'l Conf. Management of Data, pp. 259-270, 1990.
[32] C. Zaniolo, “Active Database Rules with Transaction-Conscious Stable-Model Semantics” Proc. Fourth Int'l Conf. Deductive and Object-Oriented Databases, (DOOD '95), pp. 55-72, 1995.
[33] Y. Zhou and M. Hsu, “A Theory for Rule Triggering Systems,” Advances in Database Technology: (EDBT '90), pp. 407-422, 1990.

Index Terms:
Active databases, database dynamics, deductive databases, termination, determinism.
Citation:
Sara Comai, Letizia Tanca, "Termination and Confluence by Rule Prioritization," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 2, pp. 257-270, March-April 2003, doi:10.1109/TKDE.2003.1185831
Usage of this product signifies your acceptance of the Terms of Use.