Representing transitive relationships with parallel node sets

E. Lee, J. Geller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems, APADS 1993
EditorsBharat Bhargava
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages140-145
Number of pages6
ISBN (Electronic)0818652500, 9780818652509
DOIs
StatePublished - 1993
Event1993 IEEE Workshop on Advances in Parallel and Distributed Systems, APADS 1993 - Princeton, United States
Duration: Oct 6 1993 → …

Publication series

NameProceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems, APADS 1993

Conference

Conference1993 IEEE Workshop on Advances in Parallel and Distributed Systems, APADS 1993
CountryUnited States
CityPrinceton
Period10/6/93 → …

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Representing transitive relationships with parallel node sets'. Together they form a unique fingerprint.

Cite this