To search, Click below search items.


All Published Papers Search Service


Relational Algebraic Graph Algorithms


Hyu Chan Park


Vol. 17  No. 1  pp. 25-29


This paper formalizes new graph representation and graph algorithms based on the well-developed relational database theory. In this formalization, graphs are represented in the form of relations which can be visualized as relational tables. Each vertex and edge of a graph is represented as a tuple in the tables. Graph algorithms are also defined in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language, SQL. This database implementation has many advantages compared with traditional approaches. Very large amount of graphs, for example, can be efficiently managed and concurrently shared among users by virtue of the capability of databases.


Graph algorithm, Relational Algebra, Database