Re: [Neo4j] Persisting community information
I did something similar by storing my query as a property withing a new node and connecting the node with the result nodes. I also store additional contextual information in the connecting edges. Akhil On 11/30/2011 3:14 PM, Paul A. Jackson wrote: 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 graph, but is there a way to store it within the graph itself? 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 opportunity(tm) Please consider the environment before printing or forwarding this email. If you do print this email, please recycle the paper. This email message may contain confidential, proprietary and/or privileged information. It is intended only for the use of the intended recipient(s). If you have received it in error, please immediately advise the sender by reply email and then delete this email message. Any disclosure, copying, distribution or use of the information contained in this email message to or by anyone other than the intended recipient is strictly prohibited. Any views expressed in this message are those of the individual sender, except where the sender specifically states them to be the views of the Company. ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo4j] maximum number of nodes
Do you believe that neo4j will be able to store between 20 - 30 billion nodes ? I am talking about genomics data. Akhil ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] Multiple-source lowest-cost path search
On 6/19/2011 7:11 PM, Giacomo Bernardi wrote: I'd like to build a second graph in which each e in (S-E) is connected From what i understood, connecting S-E to an arbitary node A1 and S with another arbitary node A2 and finding the lowest cost shortest path between A1 and A2 should give you the solution ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] REST results pagination
wont dumping a graph database as a tabular format create a huge file even if the number of nodes are few !!! (for a highly interconnected graph) On 4/20/2011 2:41 AM, Tim McNamara wrote: Data export, e.g. dumping everything as CSV, DOT or RDF? On 20 April 2011 18:33, Michael Hungermichael.hun...@neotechnology.comwrote: Hi Javier, what would you need that for? I'm interested in the usecase. Cheers Michael Am 20.04.2011 um 06:17 schrieb Javier de la Rosa: On Tue, Apr 19, 2011 at 10:25, Jim Webberj...@neotechnology.com wrote: I've just checked and that's in our list of stuff we really should do because it annoys us that it's not there. No promises, but we do intend to work through at least some of that list for the 1.4 releases. If this finally is developed, it will possible to request for all nodes and all relationships in some URL? Jim ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Javier de la Rosa http://versae.es ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo4j] Error: Relationship[3130] has been deleted in this tx
I loaded close to 10k and 41k relationships nodes in the database and i
then tried to delete all of the nodes and relationships. This is the
following code below.
public static void main(String[] args) {
graphDb = new EmbeddedGraphDatabase(DB_PATH);
nodeIndex = graphDb.index().forNodes(INDEX_NAME);
GraphDbMethods.registerShutdownHook(graphDb);
Transaction tx = graphDb.beginTx();
IterableNode allNodes = graphDb.getAllNodes();
for (Node node : allNodes) {
if (node.getId() != 0) {
if (node.getId() != 0) {
IterableRelationship rel = node.getRelationships();
for (Relationship relationship : rel) {
relationship.delete(); // error occurs here
}
node.delete();
}
nodeIndex.remove(node);
}
}
tx.success();
tx.finish();
System.out.println(Shutting down database ...);
graphDb.shutdown();
}
I get the illegalStateException:Relationship[3130] has been deleted in
this tx error and this transaction rolls back.
Plz help
Akhillius
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
[Neo4j] node and edge clusters
Hi, Will there be any facility in the future to incorporate node and edge cluster; hyper edges and nodes into your design ? I am currently unaware if neo4j supports this. Akhil ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
