On the Composition and Decomposition of Datalog Program Mapping
Find in a Library
The composition and decomposition of datalog program mappings are investigated for the purpose of optimization. Composability is studied using an algebraic axiom system. Also considered are (i) the decomposability of a subclass of linear recursive programs into single-rule programs; (ii) the structure of the class of prime programs; and the factorizability of bounded recursive programs into single-rule primes.
(1988). On the Composition and Decomposition of Datalog Program Mapping. Lecture Notes in Computer Science, 326, 87-101.