𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristics for syntactical optimization of relational queries

✍ Scribed by Robert Demolombe; Arantza Illarramendi

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
338 KB
Volume
32
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A comparison of optimization heuristics
A comparison of optimization heuristics for the data mapping problem
✍ Chrisochoides, Nikos; Mansour, Nashat; Fox, Geoffrey πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 421 KB πŸ‘ 2 views

In the paper we compare the performance of six heuristics with suboptimal solutions for the data distribution of two dimensional meshes that are used for the numerical solution of partial differential equations (PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to seven