Role of Graph Databases in Big Data

Computer Application

One of the most recent advances in the area of computer science and engineering is the application of graph based analytics on big data. Big data is the term used to describe the vast amount of structured, semi structured and unstructured data which is growing rapidly in rate beyond Petabytes and Exabyte’s. Graph Databases are best well known data structures for storing highly related and connected data in the form of nodes and relationships. One of the distinguished entries in this area is Neo4j Graph Database. The Evaluation status hence will show that Hashing is proficient when there will be more records state in billions though B-tree turns out great for restricted records in appropriated (sharded) and unsharded databases. It will be indicated that utilizing shard methods for information containing a huge volume like dataset 2 and dataset 3, productive retrieval utilizing MapReduce programming will be utilizing java performs quicker on a normal 20.8 % with the utilization of shard keys. It will be demonstrated that the search query computing time utilizing the proposed Hash-indexed dataset will perform on a normal of 44% quicker than non-indexed dataset and 20% quicker than worldwide indexed dataset in Hadoop and in MongoDB 48% quicker than non-indexed dataset and 29% quicker than worldwide indexed dataset for local indexed information with differing number of computing nodes in a cluster. In this paper, we present a Role of Graph Databases in Big Data.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.