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

Author

Hameurlain, Abdelkader ; Morvan, Franck ; Huguet, Marie

Author_Institution

Lab. IRIT, Univ. Paul Sabatier, Toulouse, France

fYear

1992

fDate

1-3 April 1992

Firstpage

751

Lastpage

758

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

Keywords

deductive databases; parallel algorithms; analytical model; deductive databases; deletion; differential maintenance; insertion; parallel algorithm; parallel external closure operator; performance analysis; transitively closed relation; Algorithm design and analysis; Batteries; Concrete; Costs; Deductive databases; Delay; Parallel algorithms; Performance analysis; Physics computing; Query processing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on

Conference_Location

Scottsdale, AZ, USA

Print_ISBN

0-7803-0605-8

Type

conf

DOI

10.1109/PCCC.1992.200516

Filename

200516