A storage structure for graph-oriented databases using an array of element types

This paper proposes a storage structure for graph-oriented databases called the flattened separable directory method. In this method, a data representation graph, which is a unit of the represention graph, is primarily represented with an array of edge or node types. As every node or edge can be accessed without navigation, the values of nodes and/or edges can be quickly evaluated. Experimental evaluations support these characteristics, and clarify that the data insertion performance is high, and that less storage overhead is needed for graphs consisting of many node and edge types