I know this is a somewhat subjective question but I want to throw it out there anyway because if there is some insight that I’ve missed, asking this question will save me (and hopefully others) a great deal of searching 🙂
Basically, what is the best type of database for when you have a number of items interlinked. For example:
A->B->C->D->E->F->G->H->I
And you want to be able to quickly find the shortest path (or the number of paths ideally) between A and I?
I would normally just use a relational database for this, but I’m not sure a MapReduce style database is any better and then I wondered if there was a type of database I hadn’t considered altogether…
As always, all help gratefully received 🙂
This is exactly the sort of thing neo4j is designed for. It’s a graph database that provides operations for doing graph traversal and other common operations.