论文信息 - Static Filtering on Stratified Programs

Static Filtering on Stratified Programs

Abstract We extend static filtering in [8], a query optimization strategy based on seminaive evaluation on system graphs , so that it can efficiently handle stratified programs without extra overhead. The computation of static filters is formalized as a transformation so that the least fixed point of the transformation can be the static filters. The static filtering on stratified programs is shown to be complete with respect to the iterated fixed point semantics .

[1] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[2] T. Moto-Oka,et al. Fifth Generation Computer Systems , 1982 .

[3] Vladimir Lifschitz,et al. On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[4] Jean-Marc Pugin,et al. Efficient Query Answering on Stratified Databases , 1988, FGCS.

[5] Kotagiri Ramamohanarao,et al. A Query Independent Method for Magic Set Computation on Stratified Databases , 1988, FGCS.

[6] Michael Kifer,et al. On compile-time query optimization in deductive databases by means of static filtering , 1990, TODS.

[7] John C. Shepherdson,et al. Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..

[8] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .