A communication network for distributed database systems

Author

Woo, Tai-Kuo

Author_Institution

Dept. of Comput. & Inf. Sci., Jacksonville Univ., FL, USA

fYear

1990

fDate

1-4 Apr 1990

Firstpage

1021

Abstract

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

Keywords

database theory; distributed databases; graph colouring; communication network; distributed database systems; dynamic bus partitioning; dynamically partitionable bus network; graph colouring; graph traversal algorithm; Centralized control; Communication channels; Communication networks; Communication switching; Communication system control; Database systems; Distributed computing; Partitioning algorithms; Query processing; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Southeastcon '90. Proceedings., IEEE

Conference_Location

New Orleans, LA

Type

conf

DOI

10.1109/SECON.1990.117975

Filename

117975