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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.