Just started using the batch inserter and I think I am missing a basic concept.
This code snippet using Neo 1.5 returns a zero-length map. I would expect it to
have a single property (MyKey).
String storeDir = "./neodb";
deleteDirectory(new File(storeDir));
BatchInserter batchInserte
This is not a huge deal, since the real problem is that the database cannot be
updated, but I thought I would share in case this can occur in other scenarios.
In my case, I have a database that I created with build 1.5m02 that I am
opening with release 1.5. According to the error message, I must
Suppose I have a graph and I run a community detection algorithm on it. These
algorithms usually return a dendrogram, representing the division of the graph
from whole network to individual nodes. Does anyone have experience persisting
these results? I suppose it could be stored as a separate gr
I have a graph that was created with 1.4.M05 that I am trying to open with
1.5.M02. Is this supported?
I get this exception:
Caused by: org.neo4j.graphdb.TransactionFailureException: Could not create data
source [nioneodb], see nested exception for cause of error
at
org.neo4j.ke
I encounter an error when attempting the support multiple threads.
I have a graph manager singleton that controls access to a graph and handles
the batching of transactions (committing them only after a set number of
operations). Multiple threads can perform read and write operations
"concurren
discussions
Subject: Re: [Neo4j] Unable to upgrade neostore
Paul,
Did you try to upgrade to 1.2, then to 1.3 and then to 1.4 before going from
the 1.1 straight to the 1.4?
Regards
2011/7/5 Paul A. Jackson
> I have a neo4j 1.1 graph that I tried opening with 1.4M5. I had a
> configuration that con
I have a neo4j 1.1 graph that I tried opening with 1.4M5. I had a configuration
that contained allow_store_upgrade=true:
[15] = {java.util.HashMap$Entry@12374} allow_store_upgrade -> true
key: java.lang.String = {java.lang.String@12376}"allow_store_upgrade"
value: java.lang.String = {java.lang
Washington, D.C.
Paul Jackson, Principal Software Engineer
Pitney Bowes Business Insight
4200 Parliament Place | Suite 600 | Lanham, MD 20706-1844 USA
O: 301.918.0850 | M: 703.862.0120 | www.pb.com
paul.jack...@pb.com
Every connection is a new opportunityT
Please consider the environmen
Hi Peter,
I finished my testing. I tried jdbm tree and map, HSQL, and jboss cache as a
wrapper around both HSQL and jdbm. I found that jboss cache doesn't
necessarily persist to disk at the end of a transaction, so it fails the acid
test. HSQL is super fast in memory but was terrible when for
Neo4J Spatial
Paul,
Aim considering JDBM also, should be very similar toj the BDB index
approach ... That ,something you would like to see?
On Tuesday, February 22, 2011, Paul A. Jackson wrote:
> I've been doing some research into alternate storage mechanism for exact
> match indexes.
I've been doing some research into alternate storage mechanism for exact match
indexes. I excluded BDB from my list because it has a commercial license.
I'll share my findings once I have something concrete.
Thanks.
Paul Jackson, Principal Software Engineer
Pitney Bowes Business Insight
4200
Does it go without saying that when this is implemented that a neo instance
would still be able to open a graph from a prior version? Would this be an
automatic one-time conversion, or would there be a utility that would convert
from one format to the other, or something else?
Thanks,
Paul Jac
code could have already called graphdb.shutdown()?
For example a main() that starts a bunch of threads then doesn't wait for
them to finish but instead shuts down the graph database?
Cheers,
Tobias
On Tue, Feb 1, 2011 at 5:09 PM, Paul A. Jackson wrote:
> This happens with a freshly sta
store.
Cheers,
-tobias
On Tue, Feb 1, 2011 at 4:43 PM, Paul A. Jackson wrote:
> I've been doing some performance and scalability testing with large graphs
> (2,000,000 nodes, 5,000,000 edges - actually, the WikiTalk data from the
> Stanford Snap site). I must have shut down my server
I've been doing some performance and scalability testing with large graphs
(2,000,000 nodes, 5,000,000 edges - actually, the WikiTalk data from the
Stanford Snap site). I must have shut down my server improperly because a
number of graphs needed to recover when I started it back up, but this lar
I do not have any direct experience but was wondering if anyone has experience
with Jboss Cache over JDBM and could speculate on it's applicability.
Also, I would like to see this fast exact indexer available with
GraphDatabaseService, not just BatchInserter, as I am not able to use the
BatchIn
al Message-
From: neubauer.pe...@gmail.com [mailto:neubauer.pe...@gmail.com] On Behalf Of
Peter Neubauer
Sent: Wednesday, November 10, 2010 3:11 AM
To: Neo4j user discussions
Cc: Paul A. Jackson
Subject: Re: [Neo4j] Eigenvector Centrality subclasses
Paul, Marko,
could you do a test on if the new Rando
Perhaps if "new Random( System.currentTimeMillis() )" we replaced with "new
Random( 0 )", you would get the benefits of pseudo random behavior but also
deterministic results from run to run.
-Paul
-Original Message-
From: Paul A. Jackson
Sent: Tuesday, November
I'm using:
import org.neo4j.graphalgo.impl.centrality.EigenvectorCentrality;
import org.neo4j.graphalgo.impl.centrality.EigenvectorCentralityArnoldi;
import org.neo4j.graphalgo.impl.centrality.EigenvectorCentralityPower;
The variance I am seeing is far greater than anything that could be explained
---Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Paul A. Jackson
Sent: Monday, November 08, 2010 10:10 AM
To: Neo4j user discussions
Subject: [Neo4j] Eigenvector Centrality subclasses
Anyone know the pros/cons of the Arnoldi eigenvector c
Anyone know the pros/cons of the Arnoldi eigenvector centrality implementation
over the Power implementation? I see that Arnoldi gives a little more
information on number of iterations, but it seems neither is deterministic.
Thanks,
Paul Jackson
Pitney Bowes
re you using?
>
> Have you isolated this so that it is only a "Comment" property being
> indexed, or are there other indexes to factor in as well?
>
> Cheers,
> Tobias
>
> On Tue, Oct 12, 2010 at 12:49 AM, Paul A. Jackson >wrote:
>
> > Using Neo4j 1.1, w
Using Neo4j 1.1, when I create a node that has a "Comment" property, I get the
following exception when I commit the node:
javax.transaction.xa.XAException: Unknown
xid[GlobalId[NEOKERNL|1286836445937|4], BranchId[ 52 49 52 49 52 49 ]]
at
org.neo4j.kernel.impl.transaction.xaframewor
Hi All,
I have experienced the same problem as Andrew but when using Gremlin. I am
working through some missing dependencies (first jta.jar, now
org/apache/lucene/document/Fieldable) and after the initial exception when
trying to open an existing graph, subsequent attempts to open the same gra
I'm looking for an efficient way to find an (the) edge(s) between two nodes.
I have a requirement that when I add an edge between two specific nodes that I
first determine if the edge already exists, which leads to the need for a
method that return such an edge given the subject and object. Sin
I have a program for loading data into a graph and would like to support the
case where later records contain data for nodes that were defined in prior
records. In some cases it is possible that a later record may indicate that a
node's property should be null where earlier it was given a value
All,
I am interested in encapsulating the business of managing transactions inside a
generic graph API. I assume I will have some max count where after that many
write operations, the API will finish the transaction and start a new one. I
have a few questions around this.
1) Can I igno
There is also Jung.
http://jung.sourceforge.net/
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Jeff Klann
Sent: Thursday, August 05, 2010 3:15 PM
To: Neo4j user discussions
Subject: [Neo4j] Best way to visualize?
Hi all, there h
tween node n6::n1 and node n4::n0::n0 inside
graph n6::n0 would be wrong while declaring it in graph G would be correct. A
good policy is to place the edges at the least common ancestor of the nodes in
the hierarchy, or at the top level."
-Paul
____
From: Paul
I may have missed your point. But, FWIW, this model reflects what I would
expect from an immutable object.
For example:
String s = "Test";
s.replace('T', 't'); // s still contains "Test"
BigInteger and Date are the same way.
-Paul
-Original Message-
From: user-boun...@lists.neo4j.org
pattern?
Thanks,
Marko.
On Jul 26, 2010, at 12:52 PM, Paul A. Jackson wrote:
> I am looking into nested graphs and have not found an answer to a specific
> case. Generally, when a node from one level links to a node in a sub graph,
> the edge should be defined in the outer graph. In
I am looking into nested graphs and have not found an answer to a specific
case. Generally, when a node from one level links to a node in a sub graph,
the edge should be defined in the outer graph. In the case where two nodes are
in two different (peer) subgraphs at the same level, should the
I would benefit from such a primer.
-Paul
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
Behalf Of Marko Rodriguez
Sent: Monday, July 26, 2010 9:52 AM
To: Neo4j user discussions
Subject: Re: [Neo4j] Problem-Solving with Graph Traversals (Pr
All,
We are considering leveraging the concept of subgraphs as an approach for
interactively visualizing large quantities of data. The idea is that by
aggregating collections of nodes that share some characteristic into a single
node, we may be able to reduce a graph's complexity to the point
It seems a query optimizer would be of use in this case. If you are looking
for A->Rel1->B->Rel2->C, it would be helpful to know what the frequency of A,
B, C, (and possibly Rel1, and Rel2 if relationships are indexed in the future)
and start your traversal with whichever set of nodes is least
I confess I had not investigated the batch inserter. From the description it
fits my requirements exactly.
With respect to auto-commits, it seems there are two use cases. The first is
every day operations that might run out of memory. In this case it might be
nice for neo4j to swap out memor
Update - I added this and was satisfied with the results:
private void commitIfNecessary()
{
if (transactions++ >= txLimit)
{
tx.success();
System.out.println("Committing " + (transactions - 1) + " records to
graph...");
tx.finish();
tx = databas
I have seen people discuss committing transactions after some microbatch of a
few hundred records, but I thought this was optional. I thought Neo4J would
automatically write out to disk as memory became full. Well, I encountered an
OOM and want to make sure that I understand the reason. Was m
Hi All,
I am wondering if there is an algorithm that can identify nodes that are
similar based upon there relationships to other nodes of a different type. For
example, if I have a graph of people and items purchased, I would like to be
able to identify people with similar buying habits. I th
I am not sure was a per-node relationship index is. I concur that a
relationship index doesn't help if each node has a relationship of the type we
are interested in (like in a graph of employees, each employee would have a
Manager relation). However, in a graph where there are lots of nodes an
Marko - Thank you for all these links. I am still in the process of getting my
head around them, dusting off my linear algebra textbook in the process.
Maybe I should start a new thread for my follow-up question, because it expands
the scope beyond just algorithms. I think, perhaps, there coul
Hi,
I am interested in providing network metrics such as centrality, eigenvector
centrality, degree, etc to graphs that I must assume will contain lots
(millions+) of nodes. I am interested in any suggestions regarding the best way
to approach this:
- Is it reasonable to add these met
;general purpose" solution to map a property graph to a RDF graph.
If what I'm saying doesn't make sense, I can expand on it.
Hope that helps,
Marko.
http://markorodriguez.com
http://tinkerpop.com
On Jun 4, 2010, at 11:37 AM, Paul A. Jackson wrote:
> Thanks so much for the quick repl
k: neubauer.peter
> Skype peter.neubauer
> Phone +46 704 106975
> LinkedIn http://www.linkedin.com/in/neubauer
> Twitter http://twitter.com/peterneubauer
>
> http://www.neo4j.org - Your high performance graph database.
> http://www.thought
Disclaimer: I am new to this (but am committed to working the problem).
I am interested in exporting my neo4j graphs to any of the supported xml
formats (n3, turtle, etc.). I am interested in this because I am assuming that
doing so will increase the interoperability of my graph database. Having
45 matches
Mail list logo
