A parallel algorithm for the differential maintenance of a transitively closed relation

Abstract

A parallel algorithm to propagate the insertion or deletion of a set of tuples in a binary relation into a transitively closed concrete relation without complete recomputation of the transitive closure is presented. The parallel external closure operator is used to determine the tuples which have to be added or deleted from the concrete relation. A performance analysis for the parallel external closure algorithm, the parallel algorithm for the differential maintenance of a transitively closed relation, is presented. The analytical model for the performance analysis is based on the work by P. Valduriez and S. Khoshafian (1988). The performance analysis outlines the improvement in response time for the differential maintenance of a transitively closed relation in contrast to the recomputation of the transitive closure.<>