Issue No. 01 - February (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.204095
<p>The execution of logic queries in a distributed database environment is studied. Conventional optimization strategies, such as the early evaluation of selection conditions and the clustering of processing to manipulate and exchange large sets of tuples, are redefined in view of the additional difficulties due to logic queries, in particular to recursive rules. In order to allow efficient processing of these logic queries, several program transformation techniques that attempt to minimize distribution costs based on the idea of semijoins and generalized semijoins in conventional databases are presented. Although local computation of semijoins is not possible for the general case, classes of programs are indicated for which these transformations succeed in producing set-oriented computation. Processes evaluating the recursive program in a distributed network are described, and an efficient method for testing the termination of the computation is developed. The approach is compared with sequential as well as dataflow-oriented evaluation.</p>
recursive queries evaluation; distributed databases; logic queries; optimization strategies; selection conditions; clustering; program transformation; semijoins; set-oriented computation; distributed network; dataflow-oriented evaluation; distributed databases; query processing
S. Ceri, W. Nejdl and G. Wiederhold, "Evaluating Recursive Queries in Distributed Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 104-121, 1993.