Name
Abstract | ||
|---|---|---|
Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the context of large database systems has recently attracted a large amount of research efforts. However, the parallelization of the computation of TC is still a new issue and there are only a few and recent parallel TC algorithms. Most of these parallel algorithms mere developed for shared-nothing architectures. We present a new efficient algorithm for full TC problem for shared-nothing architecture. Using simulation, we also study and examine the performance of the algorithm |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/ICCI.1993.315381 | Sudbury, Ont. |
Keywords | Field | DocType |
deductive databases,distributed databases,parallel algorithms,parallel architectures,TC problems,deductive databases,distributed databases,efficient transitive closure algorithm,large database system,parallel TC algorithms,parallelization,recognizable queries,shared-nothing architectures,simulation,transitive-closure problem | Architecture,Parallel algorithm,Computer science,Algorithm,Theoretical computer science,Distributed database,Database theory,Transitive closure,Computation | Conference |
ISBN | Citations | PageRank |
0-8186-4212-2 | 1 | 0.41 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ismail Hakki Toroslu | 1 | 456 | 102.80 |
| Lawrence J. Henschen | 2 | 478 | 280.94 |