The efficient computation of strong partial transitive-closures

The development of efficient algorithms to process the different forms of transitive-closure queries within the context of large database systems has attracted a large volume of research efforts. The authors present a new algorithm that is suitable for processing one of these forms, the strong partially instantiated query, in which one of the query's arguments is instantiated to a set of constants. The processing of this algorithm yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. This algorithm avoids the redundant computations and the high storage costs found in a number of similar algorithms.<
>