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

Querying fragmented relations in a distributed database

โœ Scribed by C. Meghini; C. Thanos


Publisher
Springer-Verlag
Year
1985
Tongue
English
Weight
760 KB
Volume
22
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Fast Algorithm for Query Optimization
โœ 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