An efficient transitive closure algorithm for distributed databases

Toroslu İ. H., Henschen L.

5th International Conference on Computing and Information, ICCI 1993, Sudbury, Kanada, 27 - 29 Mayıs 1993, ss.185-189 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/icci.1993.315381
  • Basıldığı Şehir: Sudbury
  • Basıldığı Ülke: Kanada
  • Sayfa Sayıları: ss.185-189
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

© 1993 IEEE.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.