Representing transitive relationships with parallel node sets

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.