PERFORMANCE ANALYSIS OF GRAPH DATABASE AND RELATIONAL DATABASE

Abstract

There were many database methods for managing data. They were widespread industries that had a huge success. The method used in this study was the relational database method and the graph database. The relational database method was considered as the standard for over thirty years. The graph database consisted of several components e.g., nodes, edges, and properties that represented the data storage. The graph database provided index-free adjacency, which meant that each element contained a direct pointer which was adjacent to the elements and no longer required an index lookup. These databases can be more scaled to the larger datasets as they generally did not require a "joint" operation. Therefore, they were more suited to manage the fluctuating ad-hoc data with changing schemas

Keywords:Relational Databases, Database Graph, Nodes, Edges, and Properties