Efficient Query Processing for a Subset of Linear Recursive Binary Rules
IEEE Transactions on Knowledge and Data Engineering
Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
This paper deals with parallel transitive closure computations. The sort-based approachs introduced in this paper sorts the tuples of the relation into topological order, and the sorted relation is then horizontally partitioned and distributed across several processing nodes of a messge passing multiprocessor system. This data partitioning strategy allows the transitive closure computation of the local data fragments to be computed in parallel with no interprocessor communication. the construction of the final result then requires only a small number of joins.Extensive analytical results are included in the paper as well. They show that the proposed techniques leads to a speedup that is essentially linear with the number of processors. Its performance is significantly better than the recently published Hashless Parallel Algorithm