Compact and Efficient Representation of General Graph Databases1.0

Abstract

In this paper, we propose a compact data structure to store labeled at-tributed graphs based on thek2-tree, which is a very compact data structure designedto represent a simple directed graph. The idea we propose can be seen as an extension ofthek2-tree to support property graphs. In addition to the static approach, we also pro-pose a dynamic version of the storage representation, which allows flexible schemas andinsertion or deletion of data. We provide an implementation of a basic set of operations,which can be combined to form complex queries over these graphs with attributes. Weevaluate the performance of our proposal with existing graph database systems andprove that our compact attributed graph representation obtains also competitive timeresults.