Abstract: “Businesses face the problem of processing extremely large amount of data every day. Finding and analyzing relationships between enormous set of connected data will be the key to successful business. Thus, our work discusses graph databases which are designed for dealing with densely connected data. The paper is focused on comparing Neo4j graph database and traditional Oracle relational database for querying data warehouses. The first results show that Neo4j graph database better deals with more complex questions when amount of data increases, which is very important for multidimensional analysis. Moreover, the query performance does not depend on graph dimensionality but only on size of subgraph covered by query.”

Keywords: big data; data warehouse; graph database; query performance; multidimensional analysis