A new fragmentation scheme for recursive query processing

摘要

Data fragmentation is a well-known technique used in distributed database design to support efficient query processing. In deductive databases and knowledge bases, one distinct operation is the computation of transitive closures. In this paper, we employ a fragmentation approach to deductive databases. Fragmentation techniques are investigated in distributed database environments for parallel recursive query processing. Based on the novel fragmentation scheme, a new parallel transitive closure algorithm is proposed. Compared with previous algorithms, our algorithm can explore a much higher level of parallelism with very little communication overhead increase.