A fast algorithm for query optimization in universal-relation databases
The method of the canonical connection introduced by D. Maier and J. D. Ullman in 1984 provides an optimal procedure for query processing in universal-relation databases. The authors present an algorithm for computing canonical connections in a database scheme which is more efficient than the Classical algorithm based on tableau reduction. Moreover, with a slight modification of the algorithm the authors obtain a join plan which succeeds in controlling the nonmonotonicity of cyclic canonical connections.
scientific article; zbMATH DE number 1221098