The Class of Cartesian Product Problems in Deductive Databases and Its Algorithm

摘要

ew define a new problem class of detective databases, called the Cartesian product problem class (abbreviated to the CP class). The CP class is a subclass of the datalog problem class, and includes the right-linear problem, the same generation problem and others. To solve the CP class efficiently, we propose the Cartesian product method (abbreviated to the CP method). Although all the existing methods generate ground atoms as intermediate data, the CP method generates Cartesian products, each of which compactly expresses a set of ground atoms.