𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimizing universal queries in relational databases

✍ Scribed by Minoru Ito; Tadao Kasami

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
969 KB
Volume
22
Category
Article
ISSN
0882-1666

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

Querying relational databases through XS
Querying relational databases through XSLT
✍ Jixue Liu; Millist Vincent πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 448 KB

XML has been accepted as a universal format for data interchange and publication. It can be applied in the applications in which the data of a database needs to be viewed in XML format so that the data being viewed takes more semantics and is easily understood. In these applications, the user of the

Relaxing the universal quantifier of the
Relaxing the universal quantifier of the division in fuzzy relational databases
✍ JosΓ© Galindo; Juan M. Medina; Juan C. Cubero; M. Teresa GarcΓ­a πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 207 KB

## Ín a previous paper, we presented an approach to calculate relational division in fuzzy databases, starting with the GEFRED model. This work centered on dealing with fuzzy attributes and fuzzy values and only the universal quantifier was taken into account since it is the inherent quantifier in