a) Graph databases seem to be tailor-made for networking applications. The
prototypical example is a social network, where nodes represent users who have various kinds of relationships to each other. Modeling this kind of data using any of the other styles is often a tough fit, but a graph database would accept it with relish.
b) They are also perfect matches for an object-oriented system.
a) Because of the high degree of interconnectedness between nodes, graph
databases are generally not suitable for network partitioning.
b) Graph databases don’t scale out well.
Asked In: Many Interviews |