7 ms·

I'm the author. Ask me anything.

• ronnier 14y ago
  Why the name?
• willvarfar 14y ago
  (Get the website spell checked and grammar checked by a native English speaker)
• currywurst 14y ago
  Great work, lvca ! I'm especially happy about the the 'edge label -> subclass' optimisation, as it is a fairly common use case of mine. Wish you all success.
• saosebastiao 14y ago
  Have you tried benchmarking against the competition? I would be interested in seeing the performance advantages and disadvantages.
  • alok-g 14y ago
    +1. I recall seeing older benchmarks with have not been updated since benchmarks are often controversial. It would still help a lot to have them.
• thyrsus 14y ago
  I want a graph that keeps an order on the edges, e.g., (A, B, C) being nodes, the graph {(A,B), (A,C), (A,C)} differs from the graph {(A,C), (A,B), (A,C)}. In other words, the outgoing edges are a list, not a set. Where can I find discussion of how to do that efficiently?
  • espeed 14y ago
    Store a property on the edges for the order and use Gremlin to sort/filter by the order property. See the Gremlin docs: https://github.com/tinkerpop/gremlin/wiki https://github.com/tinkerpop/gremlin/wiki