News for hackers. Stuff that matters.
Re:"How hard can it be to implement?" by nawroth on Friday September 10, 2010 @03:59AM (#1678216)
Doesn't need to be a strict child when using a graph (not to confuse with hierarchical) database. Not sure what you mean by dangling edges, at least the Neo4j graphdb guarantees that edges are always connected at both ends. It's also ACID compliant so rollbacks are supported. Sure, tanstaafl, but when dealing with data in a graph structure there's much better tools than RDBMS nowadays!

There are no comments on this comment yet.