stephen mallette created TINKERPOP3-957:
-------------------------------------------

             Summary: Improve speed of addV()
                 Key: TINKERPOP3-957
                 URL: https://issues.apache.org/jira/browse/TINKERPOP3-957
             Project: TinkerPop 3
          Issue Type: Improvement
          Components: process
    Affects Versions: 3.0.2-incubating
            Reporter: stephen mallette
            Assignee: Marko A. Rodriguez
             Fix For: 3.1.1-incubating


The performance gap between {{GraphTraversalSource.addV()}} and 
{{Graph.addVertex()}} is fairly wide:

{code}
gremlin> testAddV = { num -> graph = TinkerGraph.open(); g =
graph.traversal(); for (i = 0; i < num; i++) { g.addV(id, i).next() } }
==>groovysh_evaluate$_run_closure1@30b9eadd
gremlin> testAddVertex = { num -> graph = TinkerGraph.open(); for (i = 0; i
< num; i++) { graph.addVertex(id, i) } }
==>groovysh_evaluate$_run_closure1@2e647e59
gremlin> clock {testAddV(100000)}
==>462.04376528
gremlin> clock {testAddVertex(100000)}
==>70.90365949999999
{code}

Try to make some improvements there.  Perhaps this work should also extend to 
{{addE/addEdge}} as well.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

Reply via email to