Databases Reference
In-Depth Information
there are connections in the data. For example, consider the social network shown in
Figure 2-5
.
Figure 2-5. Easily modeling friends, colleagues, workers, and (unrequited) lovers in a
graph
In this social network, as in so many real-world cases of connected data, the connections
between entities don't exhibit uniformity across the domain—the domain is semi-
structured. A social network is a popular example of a densely connected, semi-
structured network, one that resists being captured by a one-size-fits-all schema or
conveniently split across disconnected aggregates. Our simple network of friends has
grown in size (there are now potential friends up to six degrees away) and expressive
richness. The flexibility of the graph model has allowed us to add new
nodes
and new
relationships
without compromising the existing network or migrating data—the orig‐
inal data and its intent remain intact.
The graph offers a much richer picture of the network. We can see who
LOVES
whom
(and whether that love is requited). We can see who is a
COLLEAGUE_OF
of whom, and
