Comparative analysis of Relational and Graph databases

The relational model has dominated the computer industry since the 1980s mainly for storing and retrieving data. Lately, however, relational database has been losing its importance due to its reliance on a strict schema which makes it difficult to add new relationships between the objects. Another important reason of its failure is that as the available data is growing manifolds, it is becoming complicated to work with relational model as joining a large number of tables is not working efficiently. One of the proposed solutions is to transfer to the Graph databases as they aspire to overcome such type of problems. This paper provides a comparative analysis of a graph database Neo4j with the most widespread relational database MySQL.

[1]  Josep-Lluís Larriba-Pey,et al.  Survey of Graph Database Performance on the HPC Scalable Graph Analysis Benchmark , 2010, WAIM Workshops.

[2]  L. Williams,et al.  Contents , 2020, Ophthalmology (Rochester, Minn.).

[3]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.

[4]  Renzo Angles,et al.  A Comparison of Current Graph Database Models , 2012, 2012 IEEE 28th International Conference on Data Engineering Workshops.

[5]  Yixin Chen,et al.  A comparison of a graph database and a relational database: a data provenance perspective , 2010, ACM SE '10.

[6]  Peter T. Wood.  Graph Database , 2009, Encyclopedia of Database Systems.

[7]  Charu C. Aggarwal,et al.  Managing and Mining Graph Data , 2010, Managing and Mining Graph Data.

[8]  Mike Buerli.  The Current State of Graph Databases , 2012 .

[9]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .