Representation of graphs for storing in relational databases

• Main Authors: Urubkin Mikhail, Galushka Vasiliy, Fathi Vladimir, Fathi Denis, Gerasimenko Alla
• Format: Article
• Language: English
• Published: EDP Sciences 2020-01-01
• Series: E3S Web of Conferences
• Online Access: https://www.e3s-conferences.org/articles/e3sconf/pdf/2020/24/e3sconf_tpacee2020_09014.pdf

The article is devoted to the problem of representing graphs in the form that is most suitable for their recording in relational databases and for subsequent efficient extracting and processing. The article analyzes various ways to describe graphs, such as adjacency and, incidence matrices, and adjacency lists. Each of them is reviewed from the point of view of their compliance with normal forms to assess the possibility of using a particular method when developing databases for storing graphs. It is shown that for such a task, each of these methods has a large number of disadvantages that lead to low efficiency of both data storing and processing. The article suggests the way to represent graphs in the form of a relational list of edges corresponding to the third normal form and allowing to eliminate the disadvantages of other methods.