A Fast Algorithm for Query Optimization in Universal-Relation Databases

✍ Scribed by Francesco Mario Malvestuto; Marina Moscarini

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 640 KB
• Volume: 56
• Category: Article
• ISSN: 0022-0000
• DOI: 10.1006/jcss.1998.1570

✦ Synopsis

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 algorithm we obtain a join plan which succeeds in controlling the nonmonotonicity of cyclic canonical connections.