Estimating recursive query costs for various parallel environments

A recursive query evaluation method is introduced whose main goal is to obtain a recursive query cost estimate without performing the query. In particular, it is shown that the execution estimate of the parallel processing of recursive queries can be done by exploiting the characteristics of the database profile during the evaluation process for request optimization. As many recursive queries involve computation of a transitive closure, the method estimates both transitive closure sizes and transitive closure execution costs.<
>