A Fast Algorithm for Query Optimization in Universal Relation Databases

Abstract

The method of the canonical connection introduced by Maier and Ullman provides an optimal procedure for query processing in universal-relation databases. We 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… (More)
DOI: 10.1006/jcss.1998.1570

Topics

10 Figures and Tables

Slides referencing similar topics