An Overview of Parallel Strategies for Transitive Closure on Algebraic Machines

  title={An Overview of Parallel Strategies for Transitive Closure on Algebraic Machines},
  author={Filippo Cacace and Stefano Ceri and Maurice A. W. Houtsma},
  booktitle={PRISMA Workshop},
An important feature of database technology of the nineties is the use of distributed computation for speeding up the execution of complex queries. Today, the use of parallelism is tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors, in multi-processor architectures without shared memory, in order to… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 30 references

On the computation of the transitive closure of relational operators

  • Proc. 12th Int. Conf. on Very Large Data Bases…
  • 1986
Highly Influential
5 Excerpts

AND TANOA L . " Optimization of systems of algebraic equations for evaluating Datalog queries , " in Proc

  • S. CEItI
  • Logic Programming and Databases
  • 1990

Gottlob G., and Tanca L

  • S. CEKI
  • Logic Programming and Databases, Springer-Verlag,
  • 1990
3 Excerpts

TANCA L., AND ZICARI R. "Integrating object oriented data modeling with a rule-based programming language

  • Proc. ACM-Sigrnod Conference, Atlantic City,
  • 1990
2 Excerpts

Similar Papers

Loading similar papers…