A communication network for distributed database systems

A graph traversal algorithm and its application to a dynamically partitionable bus network for a distributed database system are presented. The approach can be summarized as follows: (1) transform database operations into a graph where vertices represent database operations and edges denote the conflicts of using system resources among database operations, (2) color the constructed graph so that the vertices corresponding to the nonconflicting database operations are assigned the same color, and (3) allow the nonconflicting database operations to proceed in parallel. The graph traversal algorithm, used to color the vertices of a graph is described. The dynamic bus partitioning technique for a distributed database system is delineated.<
>