Comparative Analysis of Relational and Graph Databases
Shalini Batra1, Charu Tyagi2

1Shalini Batra, Department of Computer Science And Engineering, Thapar University, Patiala, India,
2Charu Tyagi, Department of Computer Science And Engineering, Thapar University, Patiala, India.

Manuscript received on April 11, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on May 05, 2012. | PP: 509-512 | Volume-2 Issue-2, May 2012 . | Retrieval Number: B0625042212/2012©BEIESP
Open Access | Ethics and Policies | Cite 
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Relational model has been dominating the computer industry since the 1980s mainly for storing and retrieving data. Lately, however, relational database is losing its importance due to its dependence on a rigid 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 difficult to work with relational model as joining large number of tables is not working efficiently. One of the proposed solutions is to shift 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 prevalent relational database MySQL.

Keywords: Flexibility, Maturity, Security, Retrieval.