الفهرس 
AcknowledgmentOnly 14 pages are availabe for public view
 |  | from | 132 |  |  |
| | | from | 132 | | |
Abstract
Current developments in software and hardware ted in the nested relational model and parallelism, ctively. Combining both developments may result in ful parallel nested relational model.This requires the opment of parallel nested relational algebra.
The algorithms for nested relational algebra are on a data structure namely, join index. It connects father relationtuples and the corresponding
son relationtuples. The performance of the join index is Trucial to the performance of the nested relational algebra, Iin general. Whereas, the parallel nature of the join index, i.e. the degree it supports parallelism , is crucial to the development of parallel-nested relational algebra.In this thesis a novel unified approach, for arison of join indices for nested relations, is osed. This approach reflects the degree of support of llelism by the join indices. The approach is used to Y the complexity of the existing join indices and to ve features for a good join index.