Title :
Representing transitive relationships with parallel node sets
Author :
Lee, Eunice ; Geller, James
Author_Institution :
Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA
fDate :
10/6/1993 12:00:00 AM
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
Keywords :
database theory; parallel algorithms; query processing; jumping arcs; link insert operation; massively parallel representation; parallel node sets; transitive relationships; Concurrent computing; Contracts; Databases; Encoding; Knowledge representation; Tree graphs;
Conference_Titel :
Advances in Parallel and Distributed Systems, 1993., Proceedings of the IEEE Workshop on
Conference_Location :
Princeton, NJ
Print_ISBN :
0-8186-5250-0
DOI :
10.1109/APADS.1993.588919
