This article introduces a new way of representing arbitrary graph data models in the form of n-ary trees in external memory, which ensure the execution of operations for placing, retrieving and searching data elements for logarithmic time. This approach allows for the shortest possible time to find not only properties and relationships related to objects, but also objects themselves, based on the values ​​of their properties, while providing a linear increase in the complexity from memory.

Keywords: the data model graph, graph view, data base, data structure, indexing

The article discusses the development of graph databases in the rapidly growing volume of generated and processed data. The purpose of this paper is to analyze graph data models, demonstrate their advantages over the others, as well as the formulation of the problem of the development of a new method of representing graphs in computer memory.

Keywords: database, data structure, graph data model, SQL, NoSQL, indexing, data analysis, data scheme, graph representation