Data partition: a practical parallel evaluation of datalog programs

Abstract

The authors analyse previous parallel evaluation strategies based on the partition of rule instantiations. They present a parallel evaluation strategy for general Datalog programs that is based on the partition of data and is more practical. A key issue is to determine a criterion of data transmission that reduces the amount of data transmitted and is tested efficiently. A notion of potential usefulness is given as such a criterion. The problem of designing appropriate partition schemes and processing schemes is addressed. Heuristics and algorithms are proposed for making decisions in the design process.<>