Efficient computation of strong partial transitive-closures

1993-01-01
Toroslu, İsmail Hakkı
Qadah, Ghassan Z.
The development of efficient algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present a new algorithm suitable for processing one of these forms, the so called strong partially-instantiated, in which one of the query's argument is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values form both of the query's instantiated and uninstantiated arguments. This algorithm avoids the redundant computations and the high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithm with those found in literature and shows clearly the superiority of the new algorithm.
Citation Formats
İ. H. Toroslu and G. Z. Qadah, “Efficient computation of strong partial transitive-closures,” Vienna, Austria, 1993, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0027277758&origin=inward.