Links are awesome in a small dataset, but on a larger cluster, the probability that each link walk means both an extra seek and a network roundtrip makes them less attractive.
Local graph databases avoid the extra seeks by keeping extra copies of the destination vertex immediately next to the source vertex on disk, but I don't think Riak is doing this, or that it is actually practical in an eventually consistent system.
Local graph databases avoid the extra seeks by keeping extra copies of the destination vertex immediately next to the source vertex on disk, but I don't think Riak is doing this, or that it is actually practical in an eventually consistent system.