๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for processing multi-relation queries in relational databases

โœ Scribed by Weiyi Liu

Book ID
112948322
Publisher
Springer
Year
1990
Tongue
English
Weight
255 KB
Volume
5
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for Handling Many Relationa
An Algorithm for Handling Many Relational Calculus Queries Efficiently
โœ Dan E. Willard ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 390 KB

This article classifies a group of complicated relational calculus queries whose search algorithms run in time OรฐI Log d I รพ Uรž and space OรฐIรž, where I and U are the sizes of the input and output, and d is a constant depending on the query (which is usually, but not always, equal to zero or one). Ou

A Fast Algorithm for Query Optimization
A Fast Algorithm for Query Optimization in Universal-Relation Databases
โœ Francesco Mario Malvestuto; Marina Moscarini ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 640 KB

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 tab