Package org.neo4j.graphdb

Examples of org.neo4j.graphdb.Transaction.finish()

171
172
173
174
175
176
177
178
179
180
181
          }         
        }     
      }
      tx.success();
    }finally{
      tx.finish();
    }
  } 
 
 
  public void calculateTopKLikesToCiteAuthors(int transactionThreshhold, int k){
View Full Code Here
219
220
221
222
223
224
225
226
227
228
229
          }
          if (topkCnt>=k)break;         
        } 
        if (++transactionCount % transactionThreshhold == 0){
          tx.success();
          tx.finish();
          tx = graphDB.beginTx();
          IOHelper.log(transactionCount + " nodes have been equipped with citedAuthor relations so far"); 
        }         
      }
      tx.success();
View Full Code Here
226
227
228
229
230
231
232
233
234
235
          IOHelper.log(transactionCount + " nodes have been equipped with citedAuthor relations so far"); 
        }         
      }
      tx.success();
    }finally{
      tx.finish();
    }
  } 
 
}
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
        if ( nodeCounter++ % 10000 == 9999){
          // New transactioon and print statistics
          IOHelper.log((nodeCounter-1) + " nodes added to search index.");
          transaction.success();
          transaction.finish();
          transaction = graphDB.beginTx();
          // REMOVE THIS
          // break;
        }
      }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
      System.out.println("ERROR ABORTING");
      System.out.println(e.getMessage());
      transaction.failure();
     
    } finally {
      transaction.finish();
      System.out.println("Finished indexing.");
    }

    return searchIndex;
  }
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
    if (graphDB.index().existsForNodes(idxName)) {
      System.out.println("Deleting index:" + idxName);
      Transaction tx = graphDB.beginTx();
      graphDB.index().forNodes(idxName).delete();
      tx.success();
      tx.finish();
    }
  }

 
  public Index<Node> buildAutoCompleteIndex(String indexName){
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
            Integer cut = coCitationCount.get(coCitation);
            Double tanimotoScore = (cut*1.0) / (citationCount + citationCount1 - cut);
            coRel.setProperty(DBRelationshipProperties.CO_CITATION_SCORE, tanimotoScore);
            if (++transactionCount % transactionThreshhold == 0){
              tx.success();
              tx.finish();
              tx = graphDB.beginTx();
              IOHelper.log(transactionCount + " weighted coCitation relations have been inserted so far");
              System.out.println("current relations similartiy score is " +tanimotoScore);     
            }
          }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
          }
        }
      }
      tx.success();
    }finally{
      tx.finish();
    }
    return true;
  }
 
 
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
              coRel.setProperty(DBRelationshipProperties.CO_CITATION_SCORE, tanimotoScore);
            }
          }
          if (++transactionCount % transactionThreshhold == 0){
            tx.success();
            tx.finish();
            tx = graphDB.beginTx();
            IOHelper.log(transactionCount + " papers have been equiped with coCitation relations so far");
          }

        }
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
        }
      }
      tx.success();
    }finally{
      tx.finish();
    }
    return true;
  }
 
  private boolean calculateBackLinks(int transactionThreshhold){
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.