Metagraph Storage Implementation Using Relational Database Based on Mutability/Temporality Approach

In this paper, the metagraph storage implementation based on mutability/temporality approach is proposed. Currently, there is a clear gap between the development of the theory of complex graphs (a kind of which is the metagraph model) and the practical means of their effective storage. The aim of the study is the efficient storage of data presented in the form of a metagraph model in the PostgreSQL DBMS. To provide a connection between vertices, metavertices, edges, and metaedges the concept of linkpoint is used; vertices, metavertices, edges, metaedges, and linkpoints are immutable metagraph model elements, while attributes are metagraph model mutable elements, and their value can change over time using temporality mechanism. At present, the performance of the developed storage prototype does not look very high: about 2000 basic metagraph model elements are selected in about a minute, and inserted in about 2-2.5 minutes, while the speed of processing attributes looks somewhat better. Therefore, in order to further increase performance, it is necessary to fine-tune the built-in PostgreSQL mechanisms.