<s>
A	O
graph	B-Application
database	I-Application
(	O
GDB	O
)	O
is	O
a	O
database	O
that	O
uses	O
graph	B-Application
structures	I-Application
for	O
semantic	B-General_Concept
queries	I-General_Concept
with	O
nodes	O
,	O
edges	O
,	O
and	O
properties	O
to	O
represent	O
and	O
store	O
data	O
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
hold	O
the	O
relationships	O
between	O
data	O
as	O
a	O
priority	O
.	O
</s>
<s>
Relationships	O
can	O
be	O
intuitively	O
visualized	O
using	O
graph	B-Application
databases	I-Application
,	O
making	O
them	O
useful	O
for	O
heavily	O
inter-connected	O
data	O
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
are	O
commonly	O
referred	O
to	O
as	O
a	O
NoSQL	B-General_Concept
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
are	O
similar	O
to	O
1970s	O
network	B-General_Concept
model	I-General_Concept
databases	O
in	O
that	O
both	O
represent	O
general	O
graphs	O
,	O
but	O
network-model	O
databases	O
operate	O
at	O
a	O
lower	O
level	O
of	O
abstraction	B-Application
and	O
lack	O
easy	O
traversal	B-Algorithm
over	O
a	O
chain	O
of	O
edges	O
.	O
</s>
<s>
The	O
underlying	O
storage	O
mechanism	O
of	O
graph	B-Application
databases	I-Application
can	O
vary	O
.	O
</s>
<s>
Relationships	O
are	O
a	O
first-class	O
citizen	O
in	O
a	O
graph	B-Application
database	I-Application
and	O
can	O
be	O
labelled	O
,	O
directed	O
,	O
and	O
given	O
properties	O
.	O
</s>
<s>
Some	O
depend	O
on	O
a	O
relational	O
engine	O
and	O
"	O
store	O
"	O
the	O
graph	O
data	O
in	O
a	O
table	B-Application
(	O
although	O
a	O
table	B-Application
is	O
a	O
logical	O
element	O
,	O
therefore	O
this	O
approach	O
imposes	O
another	O
level	O
of	O
abstraction	B-Application
between	O
the	O
graph	B-Application
database	I-Application
,	O
the	O
graph	B-Application
database	I-Application
management	O
system	O
and	O
the	O
physical	O
devices	O
where	O
the	O
data	O
is	O
actually	O
stored	O
)	O
.	O
</s>
<s>
Others	O
use	O
a	O
key	B-Application
–	I-Application
value	I-Application
store	I-Application
or	O
document-oriented	B-General_Concept
database	I-General_Concept
for	O
storage	O
,	O
making	O
them	O
inherently	O
NoSQL	B-General_Concept
structures	O
.	O
</s>
<s>
,	O
no	O
universal	O
graph	B-Language
query	I-Language
language	I-Language
has	O
been	O
adopted	O
in	O
the	O
same	O
way	O
as	O
SQL	B-Language
was	O
for	O
relational	B-Application
databases	I-Application
,	O
and	O
there	O
are	O
a	O
wide	O
variety	O
of	O
systems	O
,	O
most	O
often	O
tightly	O
tied	O
to	O
one	O
product	O
.	O
</s>
<s>
Some	O
early	O
standardization	O
efforts	O
lead	O
to	O
multi-vendor	O
query	B-Language
languages	I-Language
like	O
Gremlin	B-Language
,	O
SPARQL	B-Language
,	O
and	O
Cypher	B-Language
.	O
</s>
<s>
In	O
September	O
2019	O
a	O
proposal	O
for	O
a	O
project	O
to	O
create	O
a	O
new	O
standard	O
graph	B-Language
query	I-Language
language	I-Language
(	O
ISO/IEC	O
39075	O
Information	O
Technology	O
—	O
Database	O
Languages	O
—	O
GQL	B-Language
)	O
was	O
approved	O
by	O
members	O
of	O
ISO/IEC	O
Joint	O
Technical	O
Committee	O
1( 	O
ISO/IEC	O
JTC	O
1	O
)	O
.	O
</s>
<s>
GQL	B-Language
is	O
intended	O
to	O
be	O
a	O
declarative	B-Language
database	B-Language
query	I-Language
language	I-Language
,	O
like	O
SQL	B-Language
.	O
</s>
<s>
In	O
addition	O
to	O
having	O
query	B-Language
language	I-Language
interfaces	O
,	O
some	O
graph	B-Application
databases	I-Application
are	O
accessed	O
through	O
application	B-Application
programming	I-Application
interfaces	I-Application
(	O
APIs	B-General_Concept
)	O
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
differ	O
from	O
graph	O
compute	O
engines	O
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
are	O
technologies	O
that	O
are	O
translations	O
of	O
the	O
relational	O
online	B-General_Concept
transaction	I-General_Concept
processing	I-General_Concept
(	O
OLTP	B-General_Concept
)	O
databases	O
.	O
</s>
<s>
On	O
the	O
other	O
hand	O
,	O
graph	O
compute	O
engines	O
are	O
used	O
in	O
online	B-Application
analytical	I-Application
processing	I-Application
(	O
OLAP	B-Application
)	O
for	O
bulk	O
analysis	O
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
attracted	O
considerable	O
attention	O
in	O
the	O
2000s	O
,	O
due	O
to	O
the	O
successes	O
of	O
major	O
technology	O
corporations	O
in	O
using	O
proprietary	B-Application
graph	B-Application
databases	I-Application
,	O
along	O
with	O
the	O
introduction	O
of	O
open-source	B-Application
graph	B-Application
databases	I-Application
.	O
</s>
<s>
One	O
study	O
concluded	O
that	O
an	O
RDBMS	O
was	O
"	O
comparable	O
"	O
in	O
performance	O
to	O
existing	O
graph	O
analysis	O
engines	O
at	O
executing	O
graph	O
queries	B-Language
.	O
</s>
<s>
In	O
the	O
mid-1960s	O
,	O
navigational	B-General_Concept
databases	I-General_Concept
such	O
as	O
IBM	O
's	O
IMS	B-Application
supported	O
tree-like	O
structures	O
in	O
its	O
hierarchical	B-General_Concept
model	I-General_Concept
,	O
but	O
the	O
strict	O
tree	B-Data_Structure
structure	I-Data_Structure
could	O
be	O
circumvented	O
with	O
virtual	O
records	O
.	O
</s>
<s>
Graph	B-Application
structures	I-Application
could	O
be	O
represented	O
in	O
network	B-General_Concept
model	I-General_Concept
databases	O
from	O
the	O
late	O
1960s	O
.	O
</s>
<s>
CODASYL	B-Language
,	O
which	O
had	O
defined	O
COBOL	B-Application
in	O
1959	O
,	O
defined	O
the	O
Network	B-General_Concept
Database	I-General_Concept
Language	O
in	O
1969	O
.	O
</s>
<s>
Labeled	O
graphs	O
could	O
be	O
represented	O
in	O
graph	B-Application
databases	I-Application
from	O
the	O
mid-1980s	O
,	O
such	O
as	O
the	O
Logical	O
Data	O
Model	O
.	O
</s>
<s>
Commercial	B-Application
object	B-Application
databases	I-Application
(	O
ODBMSs	O
)	O
emerged	O
in	O
the	O
early	O
1990s	O
.	O
</s>
<s>
In	O
2000	O
,	O
the	O
Object	B-Application
Data	I-Application
Management	I-Application
Group	I-Application
published	O
a	O
standard	O
language	O
for	O
defining	O
object	O
and	O
relationship	O
(	O
graph	O
)	O
structures	O
in	O
their	O
ODMG'93	O
publication	O
.	O
</s>
<s>
Several	O
improvements	O
to	O
graph	B-Application
databases	I-Application
appeared	O
in	O
the	O
early	O
1990s	O
,	O
accelerating	O
in	O
the	O
late	O
1990s	O
with	O
endeavors	O
to	O
index	B-Data_Structure
web	O
pages	O
.	O
</s>
<s>
In	O
the	O
mid-to-late	O
2000s	O
,	O
commercial	B-Application
graph	B-Application
databases	I-Application
with	O
ACID	O
guarantees	O
such	O
as	O
Neo4j	B-Language
and	O
Oracle	B-Application
Spatial	I-Application
and	I-Application
Graph	I-Application
became	O
available	O
.	O
</s>
<s>
In	O
the	O
2010s	O
,	O
commercial	B-Application
ACID	O
graph	B-Application
databases	I-Application
that	O
could	O
be	O
scaled	O
horizontally	O
became	O
available	O
.	O
</s>
<s>
Further	O
,	O
SAP	B-Application
HANA	I-Application
brought	O
in-memory	B-General_Concept
and	O
columnar	B-General_Concept
technologies	O
to	O
graph	B-Application
databases	I-Application
.	O
</s>
<s>
Also	O
in	O
the	O
2010s	O
,	O
multi-model	B-Operating_System
databases	I-Operating_System
that	O
supported	O
graph	O
models	O
(	O
and	O
other	O
models	O
such	O
as	O
relational	B-Application
database	I-Application
or	O
document-oriented	B-General_Concept
database	I-General_Concept
)	O
became	O
available	O
,	O
such	O
as	O
OrientDB	B-Operating_System
,	O
ArangoDB	B-Operating_System
,	O
and	O
MarkLogic	O
(	O
starting	O
with	O
its	O
7.0	O
version	O
)	O
.	O
</s>
<s>
During	O
this	O
time	O
,	O
graph	B-Application
databases	I-Application
of	O
various	O
types	O
have	O
become	O
especially	O
popular	O
with	O
social	O
network	O
analysis	O
with	O
the	O
advent	O
of	O
social	O
media	O
companies	O
.	O
</s>
<s>
Also	O
during	O
the	O
decade	O
,	O
cloud-based	B-Architecture
graph	B-Application
databases	I-Application
such	O
as	O
Amazon	B-Application
Neptune	I-Application
and	O
Neo4j	B-Language
AuraDB	O
became	O
available	O
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
portray	O
the	O
data	O
as	O
it	O
is	O
viewed	O
conceptually	O
.	O
</s>
<s>
A	O
graph	B-Application
database	I-Application
is	O
a	O
database	O
that	O
is	O
based	O
on	O
graph	O
theory	O
.	O
</s>
<s>
They	O
are	O
roughly	O
the	O
equivalent	O
of	O
a	O
record	O
,	O
relation	O
,	O
or	O
row	B-Application
in	O
a	O
relational	B-Application
database	I-Application
,	O
or	O
a	O
document	O
in	O
a	O
document-store	O
database	O
.	O
</s>
<s>
Edges	O
are	O
the	O
key	O
concept	O
in	O
graph	B-Application
databases	I-Application
,	O
representing	O
an	O
abstraction	B-Application
that	O
is	O
not	O
directly	O
implemented	O
in	O
a	O
relational	B-Architecture
model	I-Architecture
or	O
a	O
document-store	B-General_Concept
model	I-General_Concept
.	O
</s>
<s>
Both	O
nodes	O
of	O
data	O
and	O
their	O
relationships	O
are	O
named	O
and	O
can	O
store	O
properties	O
represented	O
by	O
key	B-Application
–	I-Application
value	I-Application
pairs	I-Application
.	O
</s>
<s>
Direct	O
storage	O
of	O
relationships	O
allows	O
a	O
constant-time	O
traversal	B-Algorithm
.	O
</s>
<s>
A	O
node	O
may	O
be	O
left	O
blank	O
,	O
a	O
literal	O
and/or	O
be	O
identified	O
by	O
a	O
URI	B-Protocol
.	O
</s>
<s>
An	O
arc	O
may	O
also	O
be	O
identified	O
by	O
a	O
URI	B-Protocol
.	O
</s>
<s>
A	O
typed	O
literal	O
is	O
made	O
up	O
of	O
a	O
string	O
with	O
a	O
URI	B-Protocol
that	O
identifies	O
a	O
particular	O
datatype	O
.	O
</s>
<s>
A	O
blank	O
node	O
may	O
be	O
used	O
to	O
accurately	O
illustrate	O
the	O
state	O
of	O
the	O
data	O
when	O
the	O
data	O
does	O
not	O
have	O
a	O
URI	B-Protocol
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
are	O
a	O
powerful	O
tool	O
for	O
graph-like	O
queries	B-Language
.	O
</s>
<s>
Other	O
graph-like	O
queries	B-Language
can	O
be	O
performed	O
over	O
a	O
graph	B-Application
database	I-Application
in	O
a	O
natural	O
way	O
(	O
for	O
example	O
graph	O
's	O
diameter	O
computations	O
or	O
community	O
detection	O
)	O
.	O
</s>
<s>
The	O
underlying	O
storage	O
mechanism	O
of	O
graph	B-Application
databases	I-Application
can	O
vary	O
.	O
</s>
<s>
Some	O
depend	O
on	O
a	O
relational	O
engine	O
and	O
"	O
store	O
"	O
the	O
graph	O
data	O
in	O
a	O
table	B-Application
(	O
although	O
a	O
table	B-Application
is	O
a	O
logical	O
element	O
,	O
therefore	O
this	O
approach	O
imposes	O
another	O
level	O
of	O
abstraction	B-Application
between	O
the	O
graph	B-Application
database	I-Application
,	O
the	O
graph	B-Application
database	I-Application
management	O
system	O
and	O
the	O
physical	O
devices	O
where	O
the	O
data	O
is	O
actually	O
stored	O
)	O
.	O
</s>
<s>
Others	O
use	O
a	O
key	B-Application
–	I-Application
value	I-Application
store	I-Application
or	O
document-oriented	B-General_Concept
database	I-General_Concept
for	O
storage	O
,	O
making	O
them	O
inherently	O
NoSQL	B-General_Concept
structures	O
.	O
</s>
<s>
A	O
node	O
would	O
be	O
represented	O
as	O
any	O
other	O
document	B-General_Concept
store	I-General_Concept
,	O
but	O
edges	O
that	O
link	O
two	O
different	O
nodes	O
hold	O
special	O
attributes	O
inside	O
its	O
document	O
;	O
a	O
_from	O
and	O
_to	O
attributes	O
.	O
</s>
<s>
Because	O
index-free	O
adjacency	O
enforces	O
the	O
nodes	O
to	O
have	O
direct	O
physical	O
RAM	B-Architecture
addresses	O
and	O
physically	O
point	O
to	O
other	O
adjacent	O
nodes	O
,	O
it	O
results	O
in	O
a	O
fast	O
retrieval	O
.	O
</s>
<s>
A	O
native	O
graph	O
system	O
with	O
index-free	O
adjacency	O
does	O
not	O
have	O
to	O
move	O
through	O
any	O
other	O
type	O
of	O
data	O
structures	O
to	O
find	O
links	O
between	O
the	O
nodes	O
.	O
</s>
<s>
Directly	O
related	O
nodes	O
in	O
a	O
graph	O
are	O
stored	O
in	O
the	O
cache	B-General_Concept
once	O
one	O
of	O
the	O
nodes	O
are	O
retrieved	O
,	O
making	O
the	O
data	O
lookup	O
even	O
faster	O
than	O
the	O
first	O
time	O
a	O
user	O
fetches	O
a	O
node	O
.	O
</s>
<s>
Index-free	O
adjacency	O
sacrifices	O
the	O
efficiency	O
of	O
queries	B-Language
that	O
do	O
not	O
use	O
graph	B-Algorithm
traversals	I-Algorithm
.	O
</s>
<s>
Native	O
graph	B-Application
databases	I-Application
use	O
index-free	O
adjacency	O
to	O
process	O
CRUD	B-General_Concept
operations	O
on	O
the	O
stored	O
data	O
.	O
</s>
<s>
E-commerce	O
companies	O
such	O
as	O
Amazon	B-Application
,	O
eBay	O
and	O
Walmart	O
use	O
consumption	O
graphs	O
to	O
track	O
the	O
consumption	O
of	O
individual	O
customers	O
.	O
</s>
<s>
Mobile	O
data	O
in	O
the	O
future	O
may	O
include	O
data	O
from	O
the	O
web	O
,	O
applications	O
,	O
digital	O
wallets	O
,	O
GPS	O
,	O
and	O
Internet	B-Operating_System
of	I-Operating_System
Things	I-Operating_System
(	O
IoT	B-Operating_System
)	O
devices	O
.	O
</s>
<s>
Since	O
Edgar	O
F	O
.	O
Codd	O
's	O
1970	O
paper	O
on	O
the	O
relational	B-Architecture
model	I-Architecture
,	O
relational	B-Application
databases	I-Application
have	O
been	O
the	O
de	O
facto	O
industry	O
standard	O
for	O
large-scale	O
data	O
storage	O
systems	O
.	O
</s>
<s>
Relational	B-Architecture
models	I-Architecture
require	O
a	O
strict	O
schema	O
and	O
data	O
normalization	O
which	O
separates	O
data	O
into	O
many	O
tables	B-Application
and	O
removes	O
any	O
duplicate	O
data	O
within	O
the	O
database	O
.	O
</s>
<s>
Data	O
is	O
normalized	O
in	O
order	O
to	O
preserve	O
data	B-General_Concept
consistency	I-General_Concept
and	O
support	O
ACID	B-Operating_System
transactions	I-Operating_System
.	O
</s>
<s>
One	O
of	O
the	O
relational	B-Architecture
model	I-Architecture
's	O
design	O
motivations	O
was	O
to	O
achieve	O
a	O
fast	O
row-by-row	O
access	O
.	O
</s>
<s>
Although	O
relationships	O
can	O
be	O
analyzed	O
with	O
the	O
relational	B-Architecture
model	I-Architecture
,	O
complex	O
queries	B-Language
performing	O
many	O
join	B-Language
operations	O
on	O
many	O
different	O
attributes	O
over	O
several	O
tables	B-Application
are	O
required	O
.	O
</s>
<s>
In	O
working	O
with	O
relational	B-Architecture
models	I-Architecture
,	O
foreign	B-Application
key	I-Application
constraints	I-Application
should	O
also	O
be	O
considered	O
when	O
retrieving	O
relationships	O
,	O
causing	O
additional	O
overhead	O
.	O
</s>
<s>
Compared	O
with	O
relational	B-Application
databases	I-Application
,	O
graph	B-Application
databases	I-Application
are	O
often	O
faster	O
for	O
associative	O
data	O
sets	O
and	O
map	O
more	O
directly	O
to	O
the	O
structure	O
of	O
object-oriented	B-Language
applications	O
.	O
</s>
<s>
They	O
can	O
scale	O
more	O
naturally	O
to	O
large	O
datasets	O
as	O
they	O
do	O
not	O
typically	O
need	O
join	B-Language
operations	O
,	O
which	O
can	O
often	O
be	O
expensive	O
.	O
</s>
<s>
Conversely	O
,	O
relational	B-Application
database	I-Application
management	O
systems	O
are	O
typically	O
faster	O
at	O
performing	O
the	O
same	O
operation	O
on	O
large	O
numbers	O
of	O
data	O
elements	O
,	O
permitting	O
the	O
manipulation	O
of	O
the	O
data	O
in	O
its	O
natural	O
structure	O
.	O
</s>
<s>
Despite	O
the	O
graph	B-Application
databases	I-Application
 '	O
advantages	O
and	O
recent	O
popularity	O
over	O
relational	B-Application
databases	I-Application
,	O
it	O
is	O
recommended	O
the	O
graph	O
model	O
itself	O
should	O
not	O
be	O
the	O
sole	O
reason	O
to	O
replace	O
an	O
existing	O
relational	B-Application
database	I-Application
.	O
</s>
<s>
A	O
graph	B-Application
database	I-Application
may	O
become	O
relevant	O
if	O
there	O
is	O
an	O
evidence	O
for	O
performance	O
improvement	O
by	O
orders	O
of	O
magnitude	O
and	O
lower	O
latency	O
.	O
</s>
<s>
The	O
relational	B-Architecture
model	I-Architecture
gathers	O
data	O
together	O
using	O
information	O
in	O
the	O
data	O
.	O
</s>
<s>
This	O
would	O
be	O
done	O
by	O
searching	O
selected	O
datastores	O
,	O
or	O
tables	B-Application
,	O
looking	O
in	O
the	O
selected	O
phone	O
number	O
fields	O
for	O
the	O
string	O
"	O
311	O
"	O
.	O
</s>
<s>
This	O
can	O
be	O
a	O
time-consuming	O
process	O
in	O
large	O
tables	B-Application
,	O
so	O
relational	B-Application
databases	I-Application
offer	O
indexes	O
,	O
which	O
allow	O
data	O
to	O
be	O
stored	O
in	O
a	O
smaller	O
sub-table	O
,	O
containing	O
only	O
the	O
selected	O
data	O
and	O
a	O
unique	B-Application
key	I-Application
(	O
or	O
primary	B-Application
key	I-Application
)	O
of	O
the	O
record	O
.	O
</s>
<s>
If	O
the	O
phone	O
numbers	O
are	O
indexed	O
,	O
the	O
same	O
search	O
would	O
occur	O
in	O
the	O
smaller	O
index	B-Data_Structure
table	B-Application
,	O
gathering	O
the	O
keys	O
of	O
matching	O
records	O
,	O
and	O
then	O
looking	O
in	O
the	O
main	O
data	O
table	B-Application
for	O
the	O
records	O
with	O
those	O
keys	O
.	O
</s>
<s>
Usually	O
,	O
a	O
table	B-Application
is	O
stored	O
in	O
a	O
way	O
that	O
allows	O
a	O
lookup	O
via	O
a	O
key	O
to	O
be	O
very	O
fast	O
.	O
</s>
<s>
Relational	B-Application
databases	I-Application
do	O
not	O
inherently	O
contain	O
the	O
idea	O
of	O
fixed	O
relationships	O
between	O
records	O
.	O
</s>
<s>
Instead	O
,	O
related	O
data	O
is	O
linked	O
to	O
each	O
other	O
by	O
storing	O
one	O
record	O
's	O
unique	B-Application
key	I-Application
in	O
another	O
record	O
's	O
data	O
.	O
</s>
<s>
For	O
example	O
,	O
a	O
table	B-Application
containing	O
email	O
addresses	O
for	O
users	O
might	O
hold	O
a	O
data	O
item	O
called	O
userpk	O
,	O
which	O
contains	O
the	O
primary	B-Application
key	I-Application
of	O
the	O
user	O
record	O
it	O
is	O
associated	O
with	O
.	O
</s>
<s>
In	O
order	O
to	O
link	O
users	O
and	O
their	O
email	O
addresses	O
,	O
the	O
system	O
first	O
looks	O
up	O
the	O
selected	O
user	O
records	O
primary	B-Application
keys	I-Application
,	O
looks	O
for	O
those	O
keys	O
in	O
the	O
userpk	O
column	O
in	O
the	O
email	O
table	B-Application
(	O
or	O
,	O
more	O
likely	O
,	O
an	O
index	B-Data_Structure
of	O
them	O
)	O
,	O
extracts	O
the	O
email	O
data	O
,	O
and	O
then	O
links	O
the	O
user	O
and	O
email	O
records	O
to	O
make	O
composite	O
records	O
containing	O
all	O
the	O
selected	O
data	O
.	O
</s>
<s>
This	O
operation	O
,	O
termed	O
a	O
join	B-Language
,	O
can	O
be	O
computationally	O
expensive	O
.	O
</s>
<s>
Depending	O
on	O
the	O
complexity	O
of	O
the	O
query	B-Language
,	O
the	O
number	O
of	O
joins	O
,	O
and	O
indexing	O
various	O
keys	O
,	O
the	O
system	O
may	O
have	O
to	O
search	O
through	O
multiple	O
tables	B-Application
and	O
indexes	O
and	O
then	O
sort	O
it	O
all	O
to	O
match	O
it	O
together	O
.	O
</s>
<s>
In	O
contrast	O
,	O
graph	B-Application
databases	I-Application
directly	O
store	O
the	O
relationships	O
between	O
records	O
.	O
</s>
<s>
That	O
is	O
,	O
having	O
selected	O
a	O
user	O
,	O
the	O
pointer	O
can	O
be	O
followed	O
directly	O
to	O
the	O
email	O
records	O
,	O
there	O
is	O
no	O
need	O
to	O
search	O
the	O
email	O
table	B-Application
to	O
find	O
the	O
matching	O
records	O
.	O
</s>
<s>
This	O
can	O
eliminate	O
the	O
costly	O
join	B-Language
operations	O
.	O
</s>
<s>
A	O
relational	B-Application
database	I-Application
would	O
first	O
find	O
all	O
the	O
users	O
in	O
"	O
311	O
"	O
,	O
extract	O
a	O
list	O
of	O
the	O
primary	B-Application
keys	I-Application
,	O
perform	O
another	O
search	O
for	O
any	O
records	O
in	O
the	O
email	O
table	B-Application
with	O
those	O
primary	B-Application
keys	I-Application
,	O
and	O
link	O
the	O
matching	O
records	O
together	O
.	O
</s>
<s>
For	O
these	O
types	O
of	O
common	O
operations	O
,	O
graph	B-Application
databases	I-Application
would	O
theoretically	O
be	O
faster	O
.	O
</s>
<s>
For	O
example	O
,	O
consider	O
a	O
search	O
for	O
users	O
who	O
have	O
"	O
subscribers	O
"	O
(	O
a	O
table	B-Application
linking	O
users	O
to	O
other	O
users	O
)	O
in	O
the	O
"	O
311	O
"	O
area	O
code	O
.	O
</s>
<s>
In	O
this	O
case	O
a	O
relational	B-Application
database	I-Application
has	O
to	O
first	O
search	O
for	O
all	O
the	O
users	O
with	O
an	O
area	O
code	O
in	O
"	O
311	O
"	O
,	O
then	O
search	O
the	O
subscribers	O
table	B-Application
for	O
any	O
of	O
those	O
users	O
,	O
and	O
then	O
finally	O
search	O
the	O
users	O
table	B-Application
to	O
retrieve	O
the	O
matching	O
users	O
.	O
</s>
<s>
In	O
contrast	O
,	O
a	O
graph	B-Application
database	I-Application
would	O
search	O
for	O
all	O
the	O
users	O
in	O
"	O
311	O
"	O
,	O
then	O
follow	O
the	O
backlinks	O
through	O
the	O
subscriber	O
relationship	O
to	O
find	O
the	O
subscriber	O
users	O
.	O
</s>
<s>
In	O
terms	O
of	O
big	O
O	O
notation	O
,	O
this	O
query	B-Language
would	O
be	O
time	O
–	O
i.e.	O
,	O
proportional	O
to	O
the	O
logarithm	O
of	O
the	O
size	O
of	O
the	O
data	O
.	O
</s>
<s>
In	O
contrast	O
,	O
the	O
relational	O
version	O
would	O
be	O
multiple	O
lookups	O
,	O
plus	O
the	O
time	O
needed	O
to	O
join	B-Language
all	O
of	O
the	O
data	B-Application
records	I-Application
.	O
</s>
<s>
The	O
relative	O
advantage	O
of	O
graph	O
retrieval	O
grows	O
with	O
the	O
complexity	O
of	O
a	O
query	B-Language
.	O
</s>
<s>
In	O
a	O
relational	B-Application
database	I-Application
,	O
this	O
would	O
require	O
several	O
separate	O
searches	O
through	O
the	O
movies	O
and	O
actors	O
tables	B-Application
,	O
doing	O
another	O
search	O
on	O
submarine	O
movies	O
,	O
finding	O
all	O
the	O
actors	O
in	O
those	O
movies	O
,	O
and	O
then	O
comparing	O
the	O
(	O
large	O
)	O
collected	O
results	O
.	O
</s>
<s>
In	O
contrast	O
,	O
the	O
graph	B-Application
database	I-Application
would	O
walk	O
from	O
Gone	O
With	O
the	O
Wind	O
to	O
Clark	O
Gable	O
,	O
gather	O
the	O
links	O
to	O
the	O
movies	O
he	O
has	O
been	O
in	O
,	O
gather	O
the	O
links	O
out	O
of	O
those	O
movies	O
to	O
other	O
actors	O
,	O
and	O
then	O
follow	O
the	O
links	O
out	O
of	O
those	O
actors	O
back	O
to	O
the	O
list	O
of	O
movies	O
.	O
</s>
<s>
Properties	O
add	O
another	O
layer	O
of	O
abstraction	B-Application
to	O
this	O
structure	O
that	O
also	O
improves	O
many	O
common	O
queries	B-Language
.	O
</s>
<s>
The	O
equivalent	O
SQL	B-Language
query	B-Language
would	O
have	O
to	O
rely	O
on	O
added	O
data	O
in	O
the	O
table	B-Application
linking	O
people	O
and	O
movies	O
,	O
adding	O
more	O
complexity	O
to	O
the	O
query	B-Language
syntax	O
.	O
</s>
<s>
Relational	B-Application
databases	I-Application
are	O
very	O
well	O
suited	O
to	O
flat	O
data	O
layouts	O
,	O
where	O
relationships	O
between	O
data	O
is	O
one	O
or	O
two	O
levels	O
deep	O
.	O
</s>
<s>
For	O
example	O
,	O
an	O
accounting	O
database	O
might	O
need	O
to	O
look	O
up	O
all	O
the	O
line	O
items	O
for	O
all	O
the	O
invoices	O
for	O
a	O
given	O
customer	O
,	O
a	O
three-join	O
query	B-Language
.	O
</s>
<s>
Graph	B-Application
databases	I-Application
are	O
aimed	O
at	O
datasets	O
that	O
contain	O
many	O
more	O
links	O
.	O
</s>
<s>
These	O
properties	O
make	O
graph	B-Application
databases	I-Application
naturally	O
suited	O
to	O
types	O
of	O
searches	O
that	O
are	O
increasingly	O
common	O
in	O
online	O
systems	O
,	O
and	O
in	O
big	B-Application
data	I-Application
environments	O
.	O
</s>
<s>
For	O
this	O
reason	O
,	O
graph	B-Application
databases	I-Application
are	O
becoming	O
very	O
popular	O
for	O
large	O
online	O
systems	O
like	O
Facebook	B-Application
,	O
Google	B-Application
,	O
Twitter	B-Application
,	O
and	O
similar	O
systems	O
with	O
deep	O
links	O
between	O
records	O
.	O
</s>
<s>
To	O
further	O
illustrate	O
,	O
imagine	O
a	O
relational	B-Architecture
model	I-Architecture
with	O
two	O
tables	B-Application
:	O
a	O
people	O
table	B-Application
(	O
which	O
has	O
a	O
person_id	O
and	O
person_name	O
column	O
)	O
and	O
a	O
friend	O
table	B-Application
(	O
with	O
friend_id	O
and	O
person_id	O
,	O
which	O
is	O
a	O
foreign	B-Application
key	I-Application
from	O
the	O
people	O
table	B-Application
)	O
.	O
</s>
<s>
In	O
this	O
case	O
,	O
searching	O
for	O
all	O
of	O
Jack	O
's	O
friends	O
would	O
result	O
in	O
the	O
following	O
SQL	B-Language
query	B-Language
.	O
</s>
<s>
The	O
above	O
examples	O
are	O
a	O
simple	O
illustration	O
of	O
a	O
basic	O
relationship	O
query	B-Language
.	O
</s>
<s>
They	O
condense	O
the	O
idea	O
of	O
relational	B-Architecture
models	I-Architecture
 '	O
query	B-Language
complexity	O
that	O
increases	O
with	O
the	O
total	O
amount	O
of	O
data	O
.	O
</s>
<s>
In	O
comparison	O
,	O
a	O
graph	B-Application
database	I-Application
query	B-Language
is	O
easily	O
able	O
to	O
sort	O
through	O
the	O
relationship	O
graph	O
to	O
present	O
the	O
results	O
.	O
</s>
<s>
There	O
are	O
also	O
results	O
that	O
indicate	O
simple	O
,	O
condensed	O
,	O
and	O
declarative	B-Language
queries	B-Language
of	O
the	O
graph	B-Application
databases	I-Application
do	O
not	O
necessarily	O
provide	O
good	O
performance	O
in	O
comparison	O
to	O
the	O
relational	B-Application
databases	I-Application
.	O
</s>
<s>
While	O
graph	B-Application
databases	I-Application
offer	O
an	O
intuitive	O
representation	O
of	O
data	O
,	O
relational	B-Application
databases	I-Application
offer	O
better	O
results	O
when	O
set	O
operations	O
are	O
needed	O
.	O
</s>
<s>
The	O
following	O
is	O
a	O
list	O
of	O
notable	O
graph	B-Application
databases	I-Application
:	O
</s>
<s>
namecurrentversionlatestreleasedatesoftwarelicenseprogramming	O
languagedescriptionAllegroGraph7.0.02020-04C	O
#	O
,	O
C	B-Language
,	O
Common	B-Language
Lisp	I-Language
,	O
Java	B-Language
,	O
PythonResource	O
Description	O
Framework	O
(	O
RDF	O
)	O
and	O
graph	O
database.AmazonNeptune1.2.1.02023-03-08Not	O
disclosedAmazon	O
Neptune	O
is	O
a	O
fully	O
managed	O
graph	B-Application
database	I-Application
by	O
Amazon.com	B-Application
.	O
</s>
<s>
It	O
is	O
used	O
as	O
a	O
web	O
service	O
,	O
and	O
is	O
part	O
of	O
Amazon	B-Application
Web	I-Application
Services	I-Application
.	O
</s>
<s>
Supports	O
popular	O
graph	O
models	O
property	O
graph	O
and	O
W3C	O
's	O
RDF	O
,	O
and	O
their	O
respective	O
query	B-Language
languages	I-Language
Apache	B-Language
TinkerPop	I-Language
,	O
Gremlin	B-Language
,	O
SPARQL	B-Language
,	O
and	O
openCypher.AnzoGraph	O
DB2.12020-02C	O
,	O
C++AnzoGraph	O
DB	O
is	O
a	O
massively	B-Operating_System
parallel	I-Operating_System
native	O
graph	O
GOLAP	O
(	O
Graph	O
Online	O
Analytics	O
Processing	O
)	O
style	O
database	O
built	O
to	O
support	O
SPARQL	B-Language
and	O
Cypher	B-Language
Query	I-Language
Language	I-Language
to	O
analyze	O
trillions	O
of	O
relationships	O
.	O
</s>
<s>
AnzoGraph	O
DB	O
is	O
designed	O
for	O
interactive	O
analysis	O
of	O
large	O
sets	O
of	O
semantic	O
triple	O
data	O
,	O
but	O
also	O
supports	O
labeled	O
properties	O
under	O
proposed	O
W3C	O
standards.ArangoDB3.9.12022-04C	O
++	O
,	O
JavaScript	B-Language
,	O
.NET	B-Application
,	O
Java	B-Language
,	O
Python	B-Language
,	O
Node.js	B-Language
,	O
PHP	B-Application
,	O
Scala	B-Application
,	O
Go	B-Application
,	O
Ruby	B-Language
,	O
ElixirNoSQL	O
native	O
graph	B-Application
database	I-Application
system	O
developed	O
by	O
ArangoDB	B-Operating_System
Inc	O
,	O
supporting	O
three	O
data	O
models	O
(	O
key/value	B-Application
,	O
documents	B-General_Concept
,	O
graphs	O
)	O
,	O
with	O
one	O
database	O
core	O
and	O
a	O
unified	O
query	B-Language
language	I-Language
called	O
AQL	O
(	O
ArangoDB	B-Operating_System
Query	B-Language
Language	I-Language
)	O
.	O
</s>
<s>
Provides	O
scalability	O
and	O
high	O
availability	O
via	O
datacenter-to-datacenter	O
replication	O
,	O
auto-sharding	O
,	O
automatic	O
failover	O
,	O
and	O
other	O
capabilities.Azure	O
Cosmos	O
DB2017ProprietaryNot	O
disclosedMulti-modal	O
database	O
which	O
supports	O
graph	O
concepts	O
using	O
the	O
Apache	B-Language
Gremlin	I-Language
query	B-Language
languageDataStaxEnterpriseGraphv6.0.12018-06JavaDistributed	O
,	O
real-time	O
,	O
scalable	O
database	O
;	O
supports	O
Tinkerpop	O
,	O
and	O
integrates	O
with	O
CassandraInfiniteGraph2021.22021-05	O
,	O
commercial	B-Application
,	O
free	B-Application
50GB	O
versionJava	O
,	O
C++	B-Language
,	O
REST	B-Protocol
API	I-Protocol
,	O
'	O
DO	O
 '	O
query	B-Language
LanguageA	O
distributed	O
,	O
cloud-enabled	O
and	O
massively	O
scalable	O
graph	B-Application
database	I-Application
for	O
complex	O
,	O
real-time	O
queries	B-Language
and	O
operations	O
.	O
</s>
<s>
It	O
supports	O
batch	O
or	O
streaming	O
updates	O
to	O
the	O
graph	O
alongside	O
concurrent	O
,	O
parallel	O
queries	B-Language
.	O
</s>
<s>
InfiniteGraph	B-Application
's	O
'	O
DO	O
 '	O
query	B-Language
language	I-Language
enables	O
both	O
value	O
based	O
queries	B-Language
,	O
as	O
well	O
as	O
complex	O
graph	O
queries	B-Language
.	O
</s>
<s>
InfiniteGraph	B-Application
is	O
goes	O
beyond	O
graph	B-Application
databases	I-Application
to	O
also	O
support	O
complex	O
object	O
queries.JanusGraph0.6.22022-05-31JavaOpen	O
source	O
,	O
scalable	O
,	O
distributed	O
across	O
a	O
multi-machine	O
cluster	O
graph	B-Application
database	I-Application
under	O
The	B-Operating_System
Linux	I-Operating_System
Foundation	I-Operating_System
;	O
supports	O
various	O
storage	O
backends	O
(	O
Apache	B-Application
Cassandra	I-Application
,	O
Apache	B-Language
HBase	I-Language
,	O
Google	B-Application
Cloud	I-Application
Bigtable	I-Application
,	O
Oracle	B-Language
BerkeleyDB	I-Language
)	O
;	O
supports	O
global	O
graph	O
data	O
analytics	O
,	O
reporting	O
,	O
and	O
extract	O
,	O
transform	O
,	O
load	O
(	O
ETL	O
)	O
through	O
integration	O
with	O
big	B-Application
data	I-Application
platforms	O
(	O
Apache	B-Language
Spark	I-Language
,	O
Apache	B-Language
Giraph	I-Language
,	O
Apache	B-Application
Hadoop	I-Application
)	O
;	O
supports	O
geo	O
,	O
numeric	O
range	O
,	O
and	O
full-text	O
search	O
via	O
external	O
index	B-Data_Structure
storages	O
(	O
Elasticsearch	B-Application
,	O
Apache	B-Language
Solr	I-Language
,	O
Apache	B-Language
Lucene	I-Language
)	O
.MarkLogic8.0.42015	O
,	O
freeware	B-License
developer	O
versionJavaMulti-model	O
NoSQL	B-General_Concept
database	O
that	O
stores	O
documents	B-General_Concept
(	O
JSON	B-General_Concept
and	O
XML	O
)	O
and	O
semantic	O
graph	O
data	O
(	O
RDF	O
triples	O
)	O
;	O
also	O
has	O
a	O
built-in	O
search	O
engine.Microsoft	O
SQL	B-Language
Server	O
2017RC1	O
SQL/T	O
-SQL	O
,	O
R	B-Language
,	O
PythonOffers	O
graph	B-Application
database	I-Application
abilities	O
to	O
model	O
many-to-many	O
relationships	O
.	O
</s>
<s>
The	O
graph	O
relationships	O
are	O
integrated	O
into	O
Transact-SQL	O
,	O
and	O
use	O
SQL	B-Language
Server	O
as	O
the	O
foundational	O
database	O
management	O
system.NebulaGraph3.0.22022-03Apache	O
2.0	O
,	O
open	O
source	O
,	O
Common	O
Clause	O
1.0C	O
++	O
,	O
Go	B-Application
,	O
Java	B-Language
,	O
PythonA	O
scalable	O
open-source	B-Application
distributed	O
graph	B-Application
database	I-Application
for	O
storing	O
and	O
handling	O
billions	O
of	O
vertices	O
and	O
trillions	O
of	O
edges	O
with	O
milliseconds	O
of	O
latency	O
.	O
</s>
<s>
It	O
is	O
designed	O
based	O
on	O
a	O
shared-nothing	O
distributed	O
architecture	O
for	O
linear	O
scalability.Neo4j5.72023-04-20Java	O
,	O
.NET	B-Application
,	O
JavaScript	B-Language
,	O
Python	B-Language
,	O
Go	B-Application
,	O
Ruby	B-Language
,	O
PHP	B-Application
,	O
R	B-Language
,	O
Erlang/Elixir	O
,	O
C/C	O
++	O
,	O
Clojure	B-Language
,	O
Perl	B-Language
,	O
HaskellOpen-source	O
,	O
supports	O
ACID	O
,	O
has	O
high-availability	O
clustering	O
for	O
enterprise	O
deployments	O
,	O
and	O
comes	O
with	O
a	O
web-based	O
administration	O
that	O
includes	O
full	O
transaction	O
support	O
and	O
visual	O
node-link	O
graph	O
explorer	O
;	O
accessible	O
from	O
most	O
programming	O
languages	O
using	O
its	O
built-in	O
REST	B-Protocol
web	B-General_Concept
API	I-General_Concept
interface	O
,	O
and	O
a	O
proprietary	B-Application
Bolt	O
protocol	O
with	O
official	O
drivers.Ontotext	O
GraphDB9.72021-04	O
,	O
Standard	O
and	O
Enterprise	O
Editions	O
are	O
commercial	B-Application
,	O
Free	B-Application
Edition	O
is	O
freewareJavaHighly	O
efficient	O
and	O
robust	O
graph	B-Application
database	I-Application
with	O
RDF	O
and	O
SPARQL	B-Language
support	O
,	O
also	O
available	O
as	O
a	O
high-availability	O
cluster.OpenLinkVirtuoso8.22018-10C	O
,	O
C++	B-Language
Multi-model	O
(	O
Hybrid	O
)	O
relational	B-Application
database	I-Application
management	O
system	O
(	O
RDBMS	O
)	O
that	O
supports	O
both	O
SQL	B-Language
and	O
SPARQL	B-Language
for	O
declarative	B-Language
(	O
Data	O
Definition	O
and	O
Data	O
Manipulation	O
)	O
operations	O
on	O
data	O
modelled	O
as	O
SQL	B-Application
tables	I-Application
and/or	O
RDF	O
Graphs	O
.	O
</s>
<s>
Also	O
supports	O
indexing	O
of	O
RDF-Turtle	O
,	O
RDF-N-Triples	O
,	O
RDF-XML	O
,	O
JSON-LD	B-Protocol
,	O
and	O
mapping	O
and	O
generation	O
of	O
relations	O
(	O
SQL	B-Application
tables	I-Application
or	O
RDF	O
graphs	O
)	O
from	O
numerous	O
document	O
types	O
including	O
CSV	O
,	O
XML	O
,	O
and	O
JSON	B-General_Concept
.	O
</s>
<s>
May	O
be	O
deployed	O
as	O
a	O
local	O
or	O
embedded	O
instance	O
(	O
as	O
used	O
in	O
the	O
NEPOMUK	B-Language
Semantic	O
Desktop	O
)	O
,	O
a	O
one-instance	O
network	O
server	O
,	O
or	O
a	O
shared-nothing	O
elastic-cluster	O
multiple-instance	O
networked	O
serverOracle	O
RDF	O
Graph	O
;	O
part	O
of	O
Oracle	B-General_Concept
Database21c2020SPARQL	O
,	O
SQLRDF	O
Graph	O
capabilities	O
as	O
features	O
in	O
multi-model	O
Oracle	B-General_Concept
Database	I-General_Concept
:	O
RDF	O
Graph	O
:	O
comprehensive	O
W3C	O
RDF	O
graph	O
management	O
in	O
Oracle	B-General_Concept
Database	I-General_Concept
with	O
native	O
reasoning	O
and	O
triple-level	O
label	O
security	O
.	O
</s>
<s>
Includes	O
visualization	O
,	O
RDF4J	O
,	O
and	O
native	O
end	O
Sparql	B-Language
end	O
point.Oracle	O
Property	O
Graph	O
;	O
part	O
of	O
Oracle	B-General_Concept
Database21c2020Proprietary	O
;	O
Open	O
Source	O
language	O
specificationPGQL	O
,	O
Java	B-Language
,	O
PythonProperty	O
Graph	O
;	O
consisting	O
of	O
a	O
set	O
of	O
objects	O
or	O
vertices	O
,	O
and	O
a	O
set	O
of	O
arrows	O
or	O
edges	O
connecting	O
the	O
objects	O
.	O
</s>
<s>
Vertices	O
and	O
edges	O
can	O
have	O
multiple	O
properties	O
,	O
which	O
are	O
represented	O
as	O
key	B-Application
–	I-Application
value	I-Application
pairs	I-Application
.	O
</s>
<s>
Includes	O
PGQL	O
,	O
an	O
SQL-like	O
graph	B-Language
query	I-Language
language	I-Language
and	O
an	O
in-memory	B-General_Concept
analytic	O
engine	O
(	O
PGX	O
)	O
nearly	O
60	O
prebuilt	O
parallel	O
graph	O
algorithms	O
.	O
</s>
<s>
Includes	O
REST	B-Protocol
APIs	I-Protocol
and	O
graph	O
visualization.OrientDB3.0.282020-02JavaSecond-generation	O
distributed	O
graph	B-Application
database	I-Application
with	O
the	O
flexibility	O
of	O
documents	B-General_Concept
in	O
one	O
product	O
(	O
i.e.	O
,	O
it	O
is	O
both	O
a	O
graph	B-Application
database	I-Application
and	O
a	O
document	O
NoSQL	B-General_Concept
database	O
)	O
;	O
licensed	O
under	O
open-source	B-Application
Apache	O
2	O
license	O
;	O
and	O
has	O
full	O
ACID	O
support	O
;	O
it	O
has	O
a	O
multi-master	O
replication	O
and	O
sharding	B-General_Concept
;	O
supports	O
schema-less	O
,	O
-full	O
,	O
and	O
-mixed	O
modes	O
;	O
has	O
security	O
profiling	O
based	O
on	O
user	O
and	O
roles	O
;	O
supports	O
a	O
query	B-Language
language	I-Language
similar	O
to	O
SQL	B-Language
.	O
</s>
<s>
It	O
has	O
HTTP	O
REST	B-Protocol
and	O
JSON	B-General_Concept
API.RedisGraph2.0.202020-09Redis	O
Source	O
Available	O
LicenseCIn-memory	O
,	O
queryable	O
Property	O
Graph	B-Application
database	I-Application
which	O
uses	O
sparse	B-Algorithm
matrices	I-Algorithm
to	O
represent	O
the	O
adjacency	B-Algorithm
matrix	I-Algorithm
in	O
graphs	O
and	O
linear	B-Language
algebra	I-Language
to	O
query	B-Language
the	O
graph.SAP	O
HANA2.0	O
SPS	O
052020-06C	O
,	O
C++	B-Language
,	O
Java	B-Language
,	O
JavaScript	B-Language
and	O
SQL-like	O
languageIn-memory	O
ACID	O
transaction	O
supported	O
property	O
graphSparksee5.2.02015	O
,	O
commercial	B-Application
,	O
freeware	B-License
for	O
evaluation	O
,	O
research	O
,	O
developmentC++	O
High-performance	O
scalable	O
database	O
management	O
system	O
from	O
Sparsity	B-Algorithm
Technologies	O
;	O
main	O
trait	O
is	O
its	O
query	B-Language
performance	O
for	O
retrieving	O
and	O
exploring	O
large	O
networks	O
;	O
has	O
bindings	O
for	O
Java	B-Language
,	O
C++	B-Language
,	O
C#	B-Application
,	O
Python	B-Language
,	O
and	O
Objective-C	B-Language
;	O
version	O
5	O
is	O
the	O
first	O
graph	O
mobile	O
database.SqrrlEnterprise2.02015-02JavaDistributed	O
,	O
real-time	O
graph	B-Application
database	I-Application
featuring	O
cell-level	O
security	O
and	O
mass-scalabilityTeradataAster72016Java	O
,	O
SQL	B-Language
,	O
Python	B-Language
,	O
C++	B-Language
,	O
RMassive	O
parallel	O
processing	O
(	O
MPP	O
)	O
database	O
incorporating	O
patented	O
engines	O
supporting	O
native	O
SQL	B-Language
,	O
MapReduce	B-Operating_System
,	O
and	O
graph	O
data	O
storage	O
and	O
manipulation	O
;	O
provides	O
a	O
set	O
of	O
analytic	O
function	O
libraries	O
and	O
data	O
visualizationTerminusDB10.1.42022-08Prolog	O
,	O
Rust	B-Application
,	O
Python	B-Language
,	O
JSON-LDDocument-oriented	O
knowledge	O
graph	O
;	O
the	O
power	O
of	O
an	O
enterprise	O
knowledge	O
graph	O
with	O
the	O
simplicity	O
of	O
documents.TigerGraph3.8.02022-11C	O
++Massive	O
parallel	O
processing	O
(	O
MPP	O
)	O
native	O
graph	B-Application
database	I-Application
management	O
systemTypeDB2.14.0	O
2022-11	O
,	O
GNU	O
AGPLv3Java	O
,	O
Python	B-Language
,	O
JavaScriptTypeDB	O
is	O
a	O
strongly-typed	O
database	O
with	O
a	O
rich	O
and	O
logical	O
type	O
system	O
.	O
</s>
<s>
TypeDB	B-Language
empowers	O
you	O
to	O
tackle	O
complex	O
problems	O
,	O
and	O
TypeQL	O
is	O
its	O
query	B-Language
language	I-Language
.	O
</s>
<s>
TypeDB	B-Language
allows	O
you	O
to	O
model	O
your	O
domain	O
based	O
on	O
logical	O
and	O
object-oriented	B-Language
principles	O
.	O
</s>
<s>
Composed	O
of	O
entity	B-Architecture
,	I-Architecture
relationship	I-Architecture
,	I-Architecture
and	I-Architecture
attribute	I-Architecture
types	O
,	O
as	O
well	O
as	O
type	O
hierarchies	O
,	O
roles	O
,	O
and	O
rules	O
,	O
TypeDB	B-Language
allows	O
you	O
to	O
think	O
higher-level	O
,	O
as	O
opposed	O
to	O
join-tables	O
,	O
columns	O
,	O
documents	B-General_Concept
,	O
vertices	O
,	O
edges	O
,	O
and	O
properties	O
.	O
</s>
<s>
Cypher	B-Language
Query	I-Language
Language	I-Language
(	O
Cypher	B-Language
)	O
:	O
a	O
graph	O
query	B-Language
declarative	B-Language
language	I-Language
for	O
Neo4j	B-Language
that	O
enables	O
ad	O
hoc	O
and	O
programmatic	O
(	O
SQL-like	O
)	O
access	O
to	O
the	O
graph	O
.	O
</s>
<s>
GraphQL	B-Language
:	O
an	O
open-source	B-Application
data	O
query	B-Language
and	O
manipulation	O
language	O
for	O
APIs	B-General_Concept
.	O
</s>
