论文信息 - Incremental Processing of Logic Database Relations

Incremental Processing of Logic Database Relations

In this paper, we study a new evaluation technique for incrementally maintaining derived facts whenever updates occur on base facts. Our method is based upon the semi-naive evaluation so it is easy to implement; it is set-oriented, multiple updates may be dealt with in a single manipulation; and insertion and deletion are treated uniformly.

[1] Jiawei Han,et al. Fact Updates in Logic Databases , 1995, Int. J. Softw. Eng. Knowl. Eng..

[2] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.

[3] Yan-Nong Huang,et al. Efficient Maintenance of Explicit Transitive Closures with Set-Oriented Update Propagation and Parallel Processing , 1994, Data Knowl. Eng..

[4] Jeffrey D. Ullman,et al. Principles Of Database And Knowledge-Base Systems , 1979 .

[5] David Maier,et al. Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[6] François Bry,et al. Query Evaluation in Deductive Databases: Bottom-Up and Top-Down Reconciled , 1990, Data Knowl. Eng..

[7] Yan-Nong Huang,et al. Set-Oriented Propagation of Updates into Transitively Closed Relations , 1991, DOOD.

[8] V. S. Subrahmanian,et al. Maintaining views incrementally , 1993, SIGMOD Conference.

[9] Ling Liu,et al. Efficient Evaluation of Multiple Linear Recursions , 1991, IEEE Trans. Software Eng..