• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Hao Zhongxiao, Xiong Zhongmin. An Efficient Algorithm for Computing an Irreducible Rule Set in Active Database[J]. Journal of Computer Research and Development, 2006, 43(2): 281-287.
Citation: Hao Zhongxiao, Xiong Zhongmin. An Efficient Algorithm for Computing an Irreducible Rule Set in Active Database[J]. Journal of Computer Research and Development, 2006, 43(2): 281-287.

An Efficient Algorithm for Computing an Irreducible Rule Set in Active Database

More Information
  • Published Date: February 14, 2006
  • Termination decision in active database is an important problem and becomes a focus for many researchers. Several works suggest proving termination by using triggering and activation graphs at compile-time, and computing an irreducible rule set is the key technique. But due to the various conservativeness of the existing approaches, the irreducible rule set computed by them can be reduced again. This defect impairs not only the correctness of termination decision at compile-time but also the efficiency of run-time rule analysis. In this paper, the characteristic of nontermination for an activation rule is analyzed in detail and such concepts as activation path, inhibited activation cycle and inhibited activation rule are proposed. Based on these concepts, an efficient algorithm for computing an irreducible rule set is presented, which can make the irreducible rule set, computed by the existing approaches, to be reduced again.
  • Related Articles

    [1]Wu Jianhui, Zhang Jing, Li Renfa, Liu Zhaohua. A Multi-Subpopulation PSO Immune Algorithm and Its Application on Function Optimization[J]. Journal of Computer Research and Development, 2012, 49(9): 1883-1898.
    [2]Wang Bin. A Discrete Particle Swarm Optimization-based Algorithm for Polygonal Approximation of Digital Curves[J]. Journal of Computer Research and Development, 2010, 47(11): 1886-1892.
    [3]Jie Jing, Zeng Jianchao, Han Chongzhao. Self-Organized Particle Swarm Optimization Based on Feedback Control of Diversity[J]. Journal of Computer Research and Development, 2008, 45(3): 464-471.
    [4]Hu Jianxiu and Zeng Jianchao. A Two-Order Particle Swarm Optimization Model[J]. Journal of Computer Research and Development, 2007, 44(11): 1825-1831.
    [5]Ma Ming, Zhou Chunguang, Zhang Libiao, Ma Jie. Fuzzy Neural Network Optimization by a Multi-Objective Particle Swarm Optimization Algorithm[J]. Journal of Computer Research and Development, 2006, 43(12): 2104-2109.
    [6]Cui Zhihua and Zeng Jianchao. Modified Particle Swarm Optimization Based on Differential Model[J]. Journal of Computer Research and Development, 2006, 43(4): 646-653.
    [7]Zeng Jianchao and Cui Zhihua. A New Unified Model of Particle Swarm Optimization and Its Theoretical Analysis[J]. Journal of Computer Research and Development, 2006, 43(1): 96-100.
    [8]Dou Quansheng, Zhou Chunguang, Xu Zhongyu, Pan Guanyu. Swarm-Core Evolutionary Particle Swarm Optimization in Dynamic Optimization Environments[J]. Journal of Computer Research and Development, 2006, 43(1): 89-95.
    [9]Liu Anfeng, Chen Zhigang, Long Guoping, and Zeng Zhiwen. A Resource Optimizing Scheduling Algorithm of Differentiated Service of Double Minimum Balance in Web Clusters[J]. Journal of Computer Research and Development, 2005, 42(11): 1969-1976.
    [10]Chen Hongzhou, Gu Guochang, and Kang Wangxing. A Sentient Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2005, 42(8): 1299-1305.

Catalog

    Article views (747) PDF downloads (640) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return