Hi Scot, I'm not a member of the OrientDB team but I want to push you in the right direction.
True Graph Databases have a single concept that they all must abide and that is the Index Free Adjacency. This roughly means that you must be able to traverse between records (Vertexes of edges) without having to ever resolve a record by looking it up in an index. This is achieved by storing direct record pointers between records and this allows for the fastest possible processing of graphs. By storing data in any other form you sacrifice this and end up with a graph layer on top of a relational database or a key-value store. Having a graph layer on top of other storage engine is fine but it can never yield the same results as having a true graph storage engine underneath. If you look then you will find several such variants but you will also find a few products that are graph databases by design. Regards, -Stefan On Sunday, 25 October 2015 11:52:45 UTC, scott molinari wrote: > > A polite bump. > > Scott > -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
