Representing transitive relationships with parallel node sets

Document Type

Conference Proceeding

Publication Date

1-1-1993

Abstract

The authors describe a massively parallel representation of the closure of a transitive relationships, based on a parallelly maintained node set. The link insert operation for this representation is discussed. The main step of such an insert operation is shown, and difficulties due to so called jumping arcs are explained and attacked. Specifically, it is established that candidates for jumping arcs are contained implicitly in the parallel node set representation.

Identifier

77957083910 (Scopus)

ISBN

[0818652500, 9780818652509]

Publication Title

Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems Apads 1993

External Full Text Location

https://doi.org/10.1109/APADS.1993.588919

First Page

140

Last Page

145

Grant

F306002-88-C- 0031

Fund Ref

Defense Advanced Research Projects Agency

This document is currently not available here.

Share

COinS