𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algorithm for table division in relational databases

✍ Scribed by G. Moreno; P. González; J.A. Gámez

Publisher
Elsevier Science
Year
1993
Weight
243 KB
Volume
39
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel join for IBGF partitioned relat
Parallel join for IBGF partitioned relational databases
✍ Bozyigit, M.; Mohammed, S. A.; Al-Tayyeb, M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

This study is concerned with a parallel join operation where the subject relations are partitioned according to an interpolation based grid file (IBGF) scheme. The partitioned relations and directories are distributed over a set of independently accessible external storage units, together with the p

Fuzzy identification in fuzzy databases:
Fuzzy identification in fuzzy databases: The nuanced relational division
✍ Noureddine Mouaddib 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 600 KB

In the present article we review the main research works in fuzzy databases; propose an extension of relation division operator to fuzzy databases; provide a model for fuzzy information and resolve the identification problem in fuzzy databases. For this, three notions are relevant: (a) the concept o

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

An analytical tool for predicting the pe
An analytical tool for predicting the performance of parallel relational databases
✍ Williams, M. H.; Dempster, E. W.; Tomov, N. T.; Pua, C. S.; Taylor, H.; Burger, 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 2 views

The uptake of parallel DBMSs is being hampered by uncertainty about the impact on performance of porting database applications from sequential to parallel systems. The development of tools which aid the system manager or machine vendor could help to reduce this problem. This paper describes an analy

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