title: performance tuning creating OrientDB (deBruijn Graph)
body: <p>i have searched the Internet and also the manual for some performance tuning abilities to decrease the building time of my deBruijn Graph with OrientDB.
  All following is dione in Java.</p>
  
  <p>In OrientDB:
  <strong>Kmers</strong> are indexed.
  <strong>Edges</strong> are property based.</p>
  
  <p>What i want to do is:</p>
  
  <ol>
  <li>read in a <strong>multiple sequence</strong> file</li>
  <li>split sequence in kmers</li>
  <li>add Kmers to Database and create Edges between adjacent kmers</li>
  </ol>
  
  <p>One and two are done already.
  So when I add a kmer to OrientDB, i have to check if this kmer exist and if so i need the vertx to add a nwe edge.
  Is there any fast way to do so?
  I already created a local hash with kmer as key and OrientDB RID as value. But getting the vertex seems to need much time.</p>
  
  <p>I already tried with:</p>
  
  <pre><code>OGlobalConfiguration.USE_WAL.setValue(false);
  OGlobalConfiguration.TX_USE_LOG.setValue(false);
  declareIntent(new OIntentMassiveInsert());
  </code></pre>
  
  <p>I need nearly 3 hours to add 256 kmers and 40.000.000 edges.
  Also the size of the created DB is 9GB, the start file was 40 MB.
  Any suggestions how to improve it?</p>
  
  <p>Feel free to ask if something is not understandable.</p>
  
  <p>Thanks a lot.</p>
  
  <p>Michael</p>
  
  <p>Edit:</p>
  
  <p>do you have any experience with Record Grow factor?
  I think the Node record have some in and out edge information by default in it. Could i increase the runtime with the RECORD_GROW_FACTOR? DO you have any experince with that?</p>