
Improving Performance using Relational and Graph Database
Author(s) -
Harsha R. Vyawahare,
Dr Pravin P. Karde,
Dr Vilas M. Thakare
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b1862.078219
Subject(s) - graph database , computer science , nosql , relational database , database design , sql , database schema , database model , database , view , relational model , wait for graph , graph , information retrieval , theoretical computer science , scalability
Paper Relational database model (also called SQL databases) are one of the prevalent databases that are used with structured data. Currently news demands are arising owing to the magnitude with which the internet and social networks are getting used which brought importance to graph-structured data. Graph database (a nosql database) deal more naturally with highly connected data and are thus becoming popular and efficient choice. Due to limitations faced by relational databases in handling relationships (highly connected data), enterprise information systems find graph database as a promising alternative. According to the form of queries and property of data both relational and graph databases have vitality and flaws. Since most of the data is available in relational schema in this context, the conversion of an application from a relational to a graph format is very beneficial. Thus, this paper develops a dual database system through migration, which unifies the strengths of both relational databases and graph databases. Experimental results have shown that, this hybrid system has efficient performance.