The Community for Technology Leaders
Green Image
<p>A data structure is used to store materialized generalized transitive closure so that the evaluation of generalized transitive closure queries, deletions, and insertions of tuples can be performed efficiently in centralized and parallel environments. Some techniques to manage materialized transitive closure are presented and generalized to more general recursions. The proposed algorithms and the associated data structures are simple conceptually and in implementation. In a multiprocessor environment, the time complexities for insertion and deletion of the authors schemes are reduced. Only two rounds of communication are needed.</p>
centralised environments; materialized generalized transitive closure; parallel environments; data structure; queries; deletions; insertions; multiprocessor environment; time complexities; computational complexity; data structures; deductive databases; expert systems; parallel processing

K. Guh and C. Yu, "Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments," in IEEE Transactions on Knowledge & Data Engineering, vol. 4, no. , pp. 371-381, 1992.
91 ms
(Ver 3.3 (11022016))