IJIRST –International Journal for Innovative Research in Science & Technology| Volume 3 | Issue 12 | May 2017

ISSN (online): 2349-6010

Graph Database: A Complete GDBMS Survey

Deepak Singh Rawat Navneet Kumar Kashyap
Research Scholar Research Scholar
Department of Information Technology Department of Information Technology
College of Technology Govind Ballabh Pant University of College of Technology Govind Ballabh Pant University of
Agriculture & Technology, Pantnagar-263145, Uttarakhand, Agriculture & Technology, Pantnagar-263145, Uttarakhand,
India India

Abstract
In the time of enormous information, information examination, business knowledge database administration assumes an
imperative part from specialized business administration and exploration perspective. Over numerous decades, database
administration has been a subject of dynamic examination. There are distinctive kind of database administration framework have
been proposed over a time frame yet Relational Database Management System (RDBMS) is the one which has been most
prevalently utilized as a part of scholastic examination and technical setup. As of late, Graphs databases recovered enthusiasm
among the analysts for certain conspicuous reasons. A standout amongst the most critical explanations behind such an
enthusiasm for a graph database is a result of the inalienable property of charts as a Graphs structure. Charts are available all
around in the information structure, which speaks to the solid availability inside the information. The vast majority of the Graph
database models are characterized in which information structure for graph and occasions are displayed as graph or speculation
of a graph. In such graph database models, information controls are communicated by chart arranged operations and sort
constructors. Presently days, the vast majority of this present reality applications can be demonstrated as a graph and one of the
best genuine illustrations is social or organic system. This paper gives an outline of the diverse sort of graph databases,
applications, and correlation between their models in view of a few properties.
Keywords: Big data analytics, Graph database, RDBMS, Graph database modals
_______________________________________________________________________________________________________

I. INTRODUCTION

As of late, there has been produced a substantial number of frameworks for taking care of graph like information. In the present
time, the significance of graph like information is high in systems like; social, organic, and different systems. Graphs have been
utilized for quite a while to show diverse sorts of areas. In science, graphs are utilized to display hereditary controls and in
informal community graphs are utilized for demonstrating connections between clients. On the premise of work done as of late
we can arrange graph information administration framework into two classes – graph databases and disseminated graph handling
structures.
The primary point of conveyed graph handling is to give the arrangements in the event of mining monstrous graphs that is
impractical on single machine because of some asset imperatives. Then again graph databases actualize property graph
information model [1]. In property graph information model, graph structure's components can have some client characterized
qualities. With the ascent of enormous information there has been a tremendous interest to plan information models and
apparatuses.
These information models ought to be fit for taking care of an assortment of information structures. Examination of graph
properties is profoundly considered by information mining group [25]. To empower multi-graph administration multi-graph
databases are outlined by the database group.
As of late, most prominence picked up by relationship-arranged graph databases. In IT people group the expression
"information model" is broadly utilized. A database model [8], [18] is an accumulation of calculated apparatuses to model
representation of entities and relationships. The expression "database model" was initially presented in 1976. A database model
has three principle segments: an arrangement of information structure sort, standards, and set of operations. A graph database
model is imperative for comprehend and deal with the graph information. Since the rise of the database in the most recent couple
of years, it has been an incredible progressing discuss about database models among analysts. As appeared in Figure 1[8], there
is a great deal of assorted qualities in the current database models and there are numerous elements which impact their
improvement. Figure 1 indicates assessment of graph database models. In this rectangle indicate the database models, circles
mean the hypothetical models, and bolts signify the impacts. On the left hand side course of events in years is demonstrated.
Every database model depends on some hypothetical central and these principals assume an imperative part in the improvement
of the models. It is obviously appeared in the assume that before the relational database models; the primary center was on the
real record framework. In 1976 the system model [20] was presented where the data was in the types of records.

All rights reserved by www.ijirst.org 217

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

Fig. 1: Evolution of database models

Relational database model was exhibited by Codd [18], [19]. The center thought behind acquainting was with make a division
amongst sensible and physical level. It depends on the idea of sets and relations. Since expansion fame picked up by relational
database models in some business applications, Peckham and maryanski [8] presented objects and their relations in a
characteristic and clear way. The object- oriented model was proficient to catch space semantics. Kim presented object-situated
models [21] in 1990 however these had been already showed up when the greater part of the analysts were worried with
propelling frameworks for new applications.
The principle thought behind these object- oriented models is to speak to information as accumulations of items. Database
models made their nearness close by with the the object-oriented models.
We can characterize a Graph database model such that in which the occasions are demonstrated as graphs. These models were
extremely popular in mid-1990 with article arranged models yet their impact is kicked the bucket because of the rise of other
graph database models. These new graph database models were topographical, XML, and semi-organized. In the present time we
require the data with graph like information so this field has recovered prominence. In this paper, the work done in the field
graph database-displaying, inquiry dialects, and some components of graph databases is characterized in view of information
structures. These models are acquainted with defeat the constraint forced by customary database models to catch the innate graph
structure like information showed up in the applications.

All rights reserved by www.ijirst.org 218

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

Reno heavenly attendants and Gutierrz [8] present a study of various graph database models. In this review the data about the
assessment of database models. This examination gives us chronicled information and extremely inside and out learning of
database models furthermore some learning about graph databases.
Semi-organized database models [22] were embraced in 1997 by Buneman. These models are planned to show the information
with an adaptable information structure like pages or records. XML (extensible Mark-up Language) model is received in 1998 by
Bray. The center centers of this model depend on a tree like structure. In 2004, a group of models for speaking to metaphysics' on
the web [23] was presented by McGuinness. Reno Angels [24] present the graph database models about comprise of current
diagram databases and their backing for question languages..
In late advancements in the zone of graph databases, four fundamental diagram databases are presented taking into account
these models named RDF, cell based, property graph and hypergraph. In RDF model, the chief center is to handle the semi-
organized information. In cell based models, commonly handle the information which is a diagram like structures.
In 2007 Neo4j [3] is presented, in view of property graph model. Vast graph is entered in 2009. Titan is embraced in 2012,
which depends on property graph model. As of late presented in graph databases models comprise their own particular graph
inquiry languages. To complete different operations.
The point of this review is to give the present graph databases, their models, furthermore exhibits a correlation in light of a few
properties.

II. GRAPH

In late couple of years the way Internet and versatile correspondence has been utilized for various and fluctuated needs and
applications by a typical client, academicians, specialists have been begun reexamining as how to store the immense information
which is being created each day, consistently and consistently. This reevaluating for the capacity and recovery of information
and data brought back the ideas of graph and graph models.
Graphs are utilized to display entangled structures. Graph is an accumulation of nodes, edges, and the connections between
them. In graph NODEs are called elements and there are numerous routes in which these elements are co-related in various sort
of uses. The association between these substances is called as relationship. In graph information term "Traits" related with
elements and connections are called names. In a chart like structure information is put away into NODEs and these NODEs have
a few properties. In graphs, connections comprise of properties and interface one NODE to the next NODE.

III. GRAPH DATABASE

In the contemporary time innovation is quickly changing and we are encouraging the advantages of associated information.
Graph database is the best to deal with complex, semi-structure, and thickly associated information. It is quick as far as inquiries
and gives a reaction in milliseconds. Graph databases are very helpful in big business level like: - correspondence, human
services, retail, money related, informal community on-line business arrangement, on-line media and so on.
Graph database framework takes after CRUD (make, read, overhaul, erase) strategies that are utilized as a part of a Graph
information model and it likewise utilizes list free nearness [2]. Record free nearness is vital so as to elite traversal. In the event
that any Graph database uses this then every node keeps up direct reference to the nearby nodes. It is alluded to as a small scale
record for different nodes and less expensive than utilizing worldwide files. It implies question time is free for aggregate size of
the Graph and just specifically relative to the length of the Graph looked. It basically implies that the associated nodes in the
database dependably indicate each other. Graph database produce comes about quick regarding inquiry time furthermore stores
huge measure of information.
Graph databases [3] don't keep information into tables. There is a solitary information structure in a Graph database – the
Graph and there is no join operation so every vertex or edge is specifically associated with other vertex. Graph stores the
information into hubs which have a couple of connections. Graph databases take after property Graph model. Graph databases
are under development with the end goal of exchanges OLTP frameworks [1]. These are intended for exchange respectability
and operational accessibility. At present known Graph databases go under NoSQL databases. An effective Graph database model
is essential for better administration of Graphs.
Graph databases give such models which are all the more nearly to the client's issue. These models are straightforward in
nature; however more costly when contrasted with social databases and other NoSQL databases. In the present time, Graph
database recovered its prominence because of handle Graph like structure in current applications and these are known as the
eventual fate of database administration frameworks.

IV. CURRENT GRAPH DATABASES

Graph databases bolster quick traversal and this is the primary reason that we don't utilize a plain database like HBase and
Cassandra to store the information in some web applications. In this area there is a depiction about some present Graph
databases, in view of current database models. In the present time, there are numerous Graph databases which are profiting our
business particularly in IT. Depiction of these databases is given underneath:-

All rights reserved by www.ijirst.org 219

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

Neo4j (Neo Technology)

Neo4j is a circle based value-based Graph database and named as "World driving Graph database". Its first discharge date is in
2007. Neo4j additionally bolsters other dialect like Python aside from Java for Graph operations. Neo4j is an open source
venture [4] accessible in a GPLv3 Community release, with Advanced and Enterprise versions accessible under both the
AGPLv3 and a business permit. Neo4j is best Graph database for big business arrangement. It scales to billions of nodes and
connections in a system.
Neo4j deals with every one of the operations that change information in an exchange. In Neo4j both nodes and relationship
can contain properties. Neo4j is a Graph database that oversees Graph and is enhanced for Graph structure rather than tables. It is
more expressive kind of Graph database is like other Graph databases. Neo4j is most prevalent Graph databases today [26].
Neo4j's working is based Graph model called the "property Graph model [4]". It is a model as appeared in Figure 2 that
declines some scientific bits of Graph hypothesis for simple comprehension and outline. The property Graph comprises of nodes
that are associated by connections. Each relationship comprise of two key components together a name and course. These two
give semantic setting to the nodes associated by the relationship. There are numerous approaches to question in Neo4j, for
instance local traverse API or figure inquiry dialect [1]. It underpins full ACID exchanges by having in memory exchange logs
and bolt director. It doesn't strengthen shading

.
Fig. 2: Graph Model Neo4j

DEX
DEX [12] is said to be exceptionally productive and bitmaps-based Graph database and written in C++. It was initially
discharged in 2008. It makes Graph questioning conceivable in various systems like interpersonal organization examination and
example acknowledgment. It is otherwise called elite Graph database on account of expansive Graph and helpful for the majority
of the NoSQL applications. Most recent rendition of DEX backings both java and .NET programming. It's compact and requires
just a solitary JAR record for execution.
DEX is known as the fourth most mainstream Graph database today [25]. DEX comprises of good trustworthiness model for
impermanent Graphs. Because of its usefulness it gives great results in the applications like IMDB. It is being utilized as a part of
different long range interpersonal communication applications, giving better result his java API. It can bolster up to 1 million
nodes. As appeared in Figure 3[27] that C++ DEX Core is the key and just a solitary JAR is required. It has two fundamental
layers called java API layer and DEX center layer.
We utilize a Graph information model in DEX called the "Marked and coordinated ascribed multigraph" in light of the fact
that edges can be coordinated or undirected. There exists more than one edge between two edges. DEX utilizes its bitmap based
capacity because of its light and autonomous information structures [12]. Information structure utilized as a part of DEX is
"Connection" which is a blend of guide and number of bitmaps that is helpful for quick transformation between an item identifier
and its worth.

All rights reserved by www.ijirst.org 220

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

The principle structure behind the guide is B+ tree. The qualities are put away as UTF-8 strings and the component identifiers.
These identifiers are 37 bit unsigned numbers. These identifiers are packed keeping in mind the end goal to diminish the extent
of the structure. DEX offers fractional ACID exchange support since atomicity and detachment can't be constantly ensured.

Fig. 3: Architecture of DEX

Infinite Graph (Objectivity)

Infinite Graph is created by an association called Objectivity. It is a kind of organization that attempts to creates database
advancements supporting extensive scale, object industriousness and relationship investigation.
Infinite graph database is a disseminated diagram database in java and it depends on a chart like structure. We can call
boundless diagram as a cloud empowered chart database. It is intended for to handle high throughput [13], [14], [15]. It is a
solitary diagram database dispersed over numerous machines. There is a lock server which handles lock demands from database
applications.
It is skilled to manage complex relationship requiring different bounces. It gives diagram shrewd lists on different key fields
furthermore gives elite as far as inquiry.
It locally perfect with the ideas of vertices and edges furthermore gives quick traversal result utilizing their API. It is
additionally called adaptable chart perception device and perform route questions. The REST interface is required for intelligent
access to a database from a program.

Fig.4. Architecture of Infinite Graph

All rights reserved by www.ijirst.org 221

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

Infogrid
Infogrid [8] is known as a web diagram database with numerous extra programming segments, whose capacities are confined for
web applications. It is produced in java. It is utilized as a part of standalone chart database as contrast with all other infogrid
ventures. It is clear from Figure 5 that GraphDB is not the significant part in infogrid structure. InfoGrid [8] comprise a few
applications in OpenID venture.
The primary shortcoming of InfoGrid is that its new application which is composed in java is inadequate. It gives a unique
interface to store innovation like SQL. Extend additionally executes a library of MeshWorld illustrations.

Fig. 5: Architecture of InfoGrid

HyperGraphDB
It is an open-source database essentially bolsters hypegraphs. Hypergraph [5] is not the same as the typical diagram in light of
the fact that in this edge is focuses to alternate edges. In different fields, it is utilized as a part of the demonstrating of the
diagram information. It underpins internet questioning with an API written in java.
It depends on the HyperGraphDB model. It is widespread information demonstrate exceedingly unpredictable and expansive
scale learning application. It has chart situated capacity and adjustable indexing. In this chart database, a hyperedge is anything
but difficult to change over into tuple. It is a dispersed and diagram arranged database. In this V (hubs) + E (edges) = An (iotas).
It is developed by Dr. Ben Goertzel for an AGI framework.
The fundamental advantage utilizing hypergraphDB is its high request rationale. In these models of relations are more reduced
and actually spoken to. It is utilized as a part of numerous fields like computational science and social variable based math. In
this chart database numerous terms are utilized like iota, quality, sort, targetset (set of molecule that a particle focuses to), arity
(size of target set), connect (an iota with arity>0), and occurrence set (the arrangement of molecule indicating a molecule).
HypergraphDB is utilized as a part of counterfeit consciousness furthermore in the field of bioinformatics. It demonstrates more
all inclusive statement than some other diagram database. It demonstrates more consensus than whatever other chart database. In
this design there are different layers like applications, model layer, primitive stockpiling layer and a key quality store.
HypergraphDB is utilized as a part of counterfeit consciousness furthermore in the field of bioinformatics.

All rights reserved by www.ijirst.org 222

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

Fig. 6: Architecture of HyperGraphDB

Trinity
Trinity is a conveyed chart framework [6] over a memory cloud. Memory cloud is all around addressable in memory key worth
store over a group of machine. It gives quick information access power when we have huge datasets. It is a huge diagram
preparing machine. It gives quick diagram investigation and parallel processing for bigger datasets. It additionally gives high
throughput on expansive diagrams which have billion hubs. It is clear from Figure 7 that trinity is an expensive framework
administration and advancement instruments. It has different revelatory diagram demonstrating utilities and in memory the
information is very minimal. Trinity gives C# API's to the client for different chart operations in different parts. Outside of
Microsoft, its bundle is not open and takes after hypergraph as the information model.

Fig. 7: Architecture of Trinity

Titan
Titan [17] was received in 2012. It is composed in java and an open source venture. The fundamental advantage to utilizing titan
is its scaling highlight. It additionally gives backing to extensive diagrams and scales with the quantity of machines in a bunch. It
is additionally exceedingly versatile diagram database regarding simultaneous clients and size of chart. It gives a bunch chart
handling with Hadoop system furthermore gives answers for complex questions in milliseconds. It comprises of three principle
parts:

All rights reserved by www.ijirst.org 223

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

 Native Blueprints Implementation

 Gremlin Query dialect
 Rexster Server
It takes after property chart model and backings Gremlin: a diagram traversal inquiry dialect. It additionally offers an
advanced circle representation for productive utilization of capacity and rate of getting to information. Applications can connect
with titan with essentially two ways:
 First Method is that calls Java-dialect API's identified with titan which incorporates its local API usage.
 TinkerPop stack utilities, for example, Gremlin inquiry dialect worked on Blueprints.
 In table I the expression "Ease of use" means comparable like capacity of chart database and term "Reachability" intends to
handle expansive number of vertices in true diagrams to expand inquiry time.

Fig. 8: Architecture of Titan

V. CONCLUSION

In this paper, our correlation depends on information displaying elements of different current chart databases. As appeared in
table I, a large portion of the diagram databases there are distinctive sorts of information structures, inquiry APIs, accessible
models, and a few conventions which they take after. In this paper, a fine correlation is done as far as diagram database question
dialects.
We exhibited GDB, an extensible instrument to analyze distinctive Blueprints-consistent chart databases. We utilized GDB to
com-pare four chart databases: Neo4j, DEX, Titan (BerkeleyDB and Cassandra) and OrientDB (neighborhood) on various sorts
of workloads, every time distinguishing which database was the best and the less adjusted.
In view of our measure, the database that acquired the best results with traversal workloads is definitely Neo4j: it beats the
various competitors, in any case the work-load or the parameters utilized. Concerning read-just inten-sive workloads, Neo4j,
DEX, Titan-BerkeleyDB and Orient accomplished comparable exhibitions.
Be that as it may, for read-compose work-loads, Neo4j, Titan-BerkeleyDB and OrientDB's exhibitions debase forcefully. This
time DEX and Titan-Cassandra bring their diversion with a great deal more intriguing results than alternate databases.

All rights reserved by www.ijirst.org 224

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

Table 1: Graph Databases Comparisons

REFERENCES
[1] Yan X, Han J. gSpan: graph-based substructure pattern mining. In: Technical report UIUCDCS-R-2002-2296. Champaign: Department of Computer
Science, University of Illinois at Urbana; 2002.
[2] Yan X, Yu PS, Han J. Graph indexing: frequent structure-based approach. In: ACM SIGMOD international conference on management of data
(SIGMOD’04) ACM, 2004. New York, pp. 335–46.
[3] Eichinger F, Böhm K, Huber M. Improved software fault detection with graph mining. In: Appearing in the 6th international workshop on mining and
learning with graphs, Helsinki, Finland, 2008.
[4] Sequeda J, Arenas M, Miranker DP. On directly mapping relational databases to RDF and OWL. In WWW, pp. 49-58, 2012.
[5] Angles, Renzo, and Claudio Gutierrez., 2008. "Survey of graph database models."ACM Computing Surveys (CSUR) 40.1
[6] Angles, Renzo. 2012 "A comparison of current graph database models." Data Engineering Workshops (ICDEW), IEEE 28th International Conference on.
IEEE.
[7] Buneman, Peter. 1997 “Semistructured data." Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database
systems, ACM.
[8] A. Inokuchi, T. Washio, H. Motoda, 1998 “An Apriori-based Algorithm for Mining Frequent substructures from Graph Data. In proc. 2000 European
Symp. Principle of Data mining and knowledge Discovery (PKDD’00), pp. 13-23.
[9] T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamota, and S. Arikawa, 2002, “Efficient substructure discovery from large semi-structured data.” In
proc. 2002 SIAM Int. conf. Data mining(SDM’02), pp. 158-174.
[10] J. Huan, W. Wang and J. Prins, 2003, “Efficient mining of frequent Subgraph in the Presence of Isomorphism.” In Proc. 2003 int. conf. Data mining
(ICDM’03), pp. 549-552.
[11] X. Yan, J. Han and R. Afshar, 2003, “CloSpan: Mining Closed Sequential patterns in Large Datasets.” In Proc. 2003 SIAM Int. conf. Data mining
(SDM’03), pp. 166-177.
[12] J. K. Wegner, H. Frohlich, H. M. Mielenz, A. Zell, 2006, “ Data and graph mining in chemical space for ADME and activity data sets.” Wiley-VCH,
25(3), 205-206.
[13] T. Karunaratne, H. Bostrom, 2008, “Using background knowledge for graph based learning: a case study in chemoinformatics.” Springer, Artificial
Inteligence, (6), pp. 151-153.
[14] C. R. Dias, and L. S. Ochi, 2003 "Efficient Evolutionary Algorithms for the Clustering Problem in Directed Graphs", Proceedings of the 2003 IEEE
Congress on Evolutionary Computation, v.l, pp. 983-988
[15] P. Zhao and 1. X. Yu, , 2007 "Mining Closed Frequent Free Trees in Graph Databases", Proceeding of Database Systems for Advance Application
2007, pp. 91-102
[16] Y. Chen and F. Fonseca, 2004 “A Bipartite Graph Co-Clustering Approach to Ontology Mapping" pp. 10-22
[17] T. Ozaki and T. Ohkawa , 2008 "Mining Correlated Subgraphs in Graph Databases", PAKDD 2008,pp 272-283
[18] G.D. Fatat and M.R. Berthold ,2005 "High Performance Subgraph Mining in Molecular Compounds", HPCC 2005, pp 866-877
[19] H. Motoda ,2006 "What Can We Do with Graph-Structured Data A Data Mining Perspective", Springer 2006, pp 1-2
[20] Kashyap N.K., “Evaluation of Proposed Algorithm with Preceding GMT for Fraudulence Diagnosis”. Oriental Journal of Computer Science and
technology, ISSN(P): 0974-6471; ISSN(E): 2320-8481Vol. 9, Issue 2, August 2016, 1-9. Impact factor: 4, Naas rating : 3.48 (Published online )
[21] Navneet Kumar Kashyap, Binay Kumar Pandey, H. L. Mandoria & Ashok Kumar,“A Comprehensive Study Of Various Kinds Of Frauds & It’s Impact”,
International Journal of Computer Science Engineering and Information Technology Research (IJCSEITR) ISSN(P): 2249-6831; ISSN(E): 2249-7943 Vol.
6, Issue 3, Jun 2016, 47-58,
[22] Navneet Kumar Kashyap, Binay Kumar Pandey, H. L. Mandoria & Ashok Kumar, “A Review Of Leading Database: Relational & Non-Relational
Database”, I-Manager's Journal On Information Technology (JIT) ISSN (P): 2277-5110; ISSN (E): 2277-5250, (Accepted On May 31, 2016)
[23] Navneet Kumar Kashyap, Binay Kumar Pandey, H. L. Mandoria & Ashok Kumar, “Comprehensive Study of Different Pattern Recognition Techniques”, i-
manager's Journal on Pattern Recognition (JPR)ISSN(P): 2349-7912; ISSN(E): 2350-112X, vol. 2, No. 4, 42-49 ( Accepted on JUNE 9, 2016)

All rights reserved by www.ijirst.org 225

 Graph Database: A Complete GDBMS Survey
(IJIRST/ Volume 3 / Issue 12/ 034)

[24] Navneet Kumar Kashyap, Binay Kumar Pandey, H. L. Mandoria & Ashok Kumar, “GRAPH MINING USING gSpan: GRAPH BASED SUBSTRUTURE
PATTERN MINING", International Journal of Applied Research on Information Technology and Computing (IJARITAC), ISSN(P):0975-8070; ISSN(E):
0975-8089, Vol. 7, No. 2, August 2016 ,( Accepted on JUNE 13, 2016)
[25] Kashyap N.K ., Pandey B. K., Mandoria H. L.,“Analysis of Pattern Identification Using Graph Database For Fraud Detection”. Oriental Journal of
Computer Science and technology, ISSN(P): 0974-6471; ISSN(E): 2320-8481Vol. 9, Issue 2, August 2016,. Impact factor: 4, Naas rating : 3.48

All rights reserved by www.ijirst.org 226