[TINKERPOP-957] Improve speed of addV()

• Type: Improvement
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Affects Version/s: 3.0.2-incubating
• Fix Version/s: 3.1.1-incubating
• Component/s: process
• Assignee: Ted Wilmes
• Reporter: Stephen Mallette
• Created: 12/Nov/15 18:11
• Updated: 18/Nov/15 16:40
• Resolved: 18/Nov/15 16:39

Description

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

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

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