论文信息 - Subsumption-Free Bottom-up Evaluation of Logic Programs with Partially Instantiated Data Structures

Subsumption-Free Bottom-up Evaluation of Logic Programs with Partially Instantiated Data Structures

Most deductive databases impose restrictions on the terms that can be used in them: they require that generated tuples be fully ground, i.e. contain no variables. Without this restriction, query evaluation of general programs needs subsumption tests in order to terminate correctly, and subsumption tests are expensive.

[1] Divesh Srivastava,et al. CORAL - A Database Programming Language , 1990, Workshop on Deductive Databases.

[2] Justin Zobel,et al. Nu-prolog reference manual , 1990 .

[3] John W. Lloyd,et al. The Godel Report , 1991 .

[4] Alan Mycroft,et al. A Polymorphic Type System for Prolog , 1984, Logic Programming Workshop.

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

[6] Zoltan Somogyi. A System of Precise Models for Logic Programs , 1987, ICLP.

[7] Robin Milner,et al. A proposal for standard ML , 1984, LFP '84.

[8] Kotagiri Ramamohanarao,et al. Right-, left- and multi-linear rule transformations that maintain context information , 1990, VLDB.

[9] Kotagiri Ramamohanarao,et al. Design overview of the Aditi deductive database system , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.