When the relationships are the data
A query must find people connected to a given person through up to six degrees of "worked with". In SQL this is six self-joins, and it gets slower with each level.
Why does a graph database handle this better?
A query must find people connected to a given person through up to six degrees of "worked with". In SQL this is six self-joins, and it gets slower with each level.
Why does a graph database handle this better?