This Article 
 Bibliographic References 
 Add to: 
Trigger Condition Testing and View Maintenance Using Optimized Discrimination Networks
March/April 2002 (vol. 14 no. 2)
pp. 261-280

This paper presents a structure that can be used both for trigger condition testing and view materialization, along with a study of techniques for optimizing the structure. The structure presented is known as a discrimination network. The type of discrimination network introduced and studied in this paper is a highly general type of discrimination network which we call the Gator network. The structure of several alternative Gator network optimizers is described, along with a discussion of optimizer performance, output quality, and accuracy. The optimizers can choose an efficient Gator network for testing the conditions of a set of triggers or optimizing maintenance of a set of views, given information about the structure of the triggers or views, database size, predicate selectivity, and update frequency distribution. The efficiency of optimized Gator networks relative to alternatives is analyzed. The results indicate that overall, Gator networks can be optimized effectively and can give excellent performance for trigger condition testing and materialization of views.

[1] E.H.L. Aarts and J.H.M. Korst, Simulated Annealing and Boltzmann Machines. John Wiley&Sons, 1989.
[2] P.A. Bernstein, N. Goodman, E. Wong, C. Reeve, and J.B. Rothnie, “Query Processing in a System for Distributed Databases,” ACM Trans. Database Systems, vol. 6, no. 4, pp. 602-625, Dec. 1981.
[3] S. Bodagala, “Optimization of Condition Testing for Multi-Table Triggers in Active Databases,” PhD thesis, Univ. of Florida, Gainesville, 1998.
[4] D.A. Brant and D.P. Miranker,"Index support for rule activation," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 42-48, May 1993.
[5] L. Brownston,R. Farrell,E. Kant, and N. Martin,Programming Expert Systems in OPS5 An Introduction to Rule-Based Programming. Addison Wesley, 1985.
[6] S. Ceri and G. Pelagatti, Distributed Databases: Principles and Systems.New York: McGraw-Hill, 1984.
[7] R. Cochrane, H. Pirahesh, and N. Mattos, “Integrating Triggers and Declarative Constraints in SQL Database Systems,” Proc. 22nd Very Large Database Conf., pp. 567-578, 1996.
[8] F. Fabret, M. Regnier, and E. Simon, “An Adaptive Algorithm for Incremental Evaluation of Production Rules in Databases,” Proc. Very Large Databse Conf., pp. 455-466, 1993.
[9] C.L. Forgy, “Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem,” Artificial Intelligence, vol. 19, pp. 17-37, 1982.
[10] Materialized Views: Techniques, Implementations and Applications, A. GuptaI and I.S. Mumick, eds., MIT Press, 1999.
[11] E. Hanson, “The Design and Implementation of the Ariel Active Database Rule System,” Technical Report CIS-TR-92-018, Univ. of Florida, 1992.
[12] E.N. Hanson,M. Chaabouni,C. Kim, and Y. Wang,"A predicate matching algorithm for database rule systems," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 271-280, May 1990.
[13] E.N. Hanson and T. Johnson, “Selection Predicate Indexing for Active Databases Using Interval Skip Lists,” Information Systems, vol. 21, no. 3, pp. 269-298, 1996.
[14] M. Hasan, “Optimization of Discrimination Networks for Active Databases,” master's thesis, CIS Dept. Univ. of Florida, Nov. 1993.
[15] Y.E. Ioannidis and Y.C. Kang,“Randomized algorithms for optimizing large join queries,” Proc. ACM-SIGMOD Conf., vol. 19, pp. 312-321, 1990.
[16] Y.E. Ioannidis and Y.C. Kang,“Left-deep vs. bushy trees: An analysis of strategy spaces and its implication for query optimization,” Proc. ACM-SIGMOD Conf., vol. 20, pp. 168-177, 1991.
[17] Y.E. Ioannidis and E. Wong,“Query optimization by simulated annealing,” Proc. ACM-SIGMOD Conf., pp. 9-22, 1987.
[18] Y.E. Ioannidis and S. Christodoulakis, “On the Propagation of Errors in the Size of Join Results,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 268-277, 1991.
[19] T. Ishida, “An Optimization Algorithm for Production Systems,” IEEE Trans. Knowledge and Data Eng., vol. 6, no. 4, pp. 549-558, Aug. 1994.
[20] M. Khandil, “Support for Expensive Selection Predicates in Active Database Discrimination Networks,” PhD thesis, Univ. of Florida, Gainesville, 1998.
[21] S. Kirkpatrick, C.C. Gelatt, and M.P. Vecchi, “Optimization by Simulated Annealing,” Science, vol. 220, pp. 671-680, 1983.
[22] D.P. Miranker, “TREAT: A Better Match Algorithm for AI Production Systems,” Proc. AAAI Nat'l Conf. Artificial Intelligence, pp. 42-47, Aug. 1987.
[23] K. Ono and G.M. Lohman, “Measuring the Complexity of Join Enumeration in Query Optimization,” Proc. Very Large Databases Conf., pp. 314-325, June 1990.
[24] J.E. Richardson, M.J. Carey, and D.T. Schuh, “The Design of the E Programming Language,” ACM Trans. Programming Languages and Systems, vol. 15, no. 3, 1993.
[25] K.A. Ross, D. Srivastava, and S. Sudarshan, “Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 447-458, 1996.
[26] P. Selinger,D. Astrahan,D. Chamberlin,R. Lorie,, and T. Price,“Access path selection in a relational database management system,” Proc. 1979 ACM-SIGMOD Int’l Conf. Management of Data, pp. 23-34,Boston, May 1979.
[27] Readings in Database Systems. M. Stonebraker, ed., Morgan Kaufmann, 1994.
[28] A. Swami and A. Gupta,“Optimization of large join queries,” Proc. ACM-SIGMOD Conf., pp. 8-17, 1988.
[29] P.J.M. Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Applications. D. Reidel Publishing, 1987.
[30] Y. Wang and E.N. Hanson,"A performance comparison of the Rete and TREAT algorithms for testing database rule conditions," Proc. IEEE Data Eng. Conf., pp. 88-97, Feb. 1992.

Index Terms:
active database systems, view materialization, view maintenance, discrimination networks, discrimination network optimization, Rete networks, TREAT networks, Gator networks
E.N. Hanson, S. Bodagala, U. Chadaga, "Trigger Condition Testing and View Maintenance Using Optimized Discrimination Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 2, pp. 261-280, March-April 2002, doi:10.1109/69.991716
Usage of this product signifies your acceptance of the Terms of Use.