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

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE Annual Phoenix Conference on Computers and Communications, 11th, 1992 pp. 751 - 758
Main Authors Hameurlain, A., Morvan, F., Huguet, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1992
Subjects
Algorithm design and analysis
Batteries
Concrete
Costs
Deductive databases
Delay
Parallel algorithms
Performance analysis
Physics computing
Query processing
Online AccessGet full text
ISBN9780780306059
0780306058
DOI10.1109/PCCC.1992.200516

Cover

More Information
Summary: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.< >
ISBN:9780780306059
0780306058
DOI:10.1109/PCCC.1992.200516