If only there were! There's a few different implementations of graph databases, of which Neo4J is probably the leader, but every one I've seen is hard to use and has some substantial scalability limitations.
I think Postgres & WITH RECURSIVE, plus pl/perl or pl/python stored procedures for the decomposition may be your current best bet.
Posted Jul 21, 2011 20:28 UTC (Thu) by jeremiah (subscriber, #1221)
[Link]
Except for the languages listed, that's what I've got. I found Neo4J difficult because of the lack of flexibility in defining relationships, ie they couldn't be dynamic. At times I even toy with the idea of doing something on my own at the file system level, but it's just not worth the effort, esp trying to redo a lot of the features that the Postgres folks have worked so hard over the years to develop. And I'm sure I could never approach their level of scalability on my own. Thanks for the input.