[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

RE: [igraph] persisting graphs

From: venura.2.mendis
Subject: RE: [igraph] persisting graphs
Date: Mon, 22 Sep 2008 09:13:49 +0100

Thanks for you comments guys. Since I will only be querying on node ids
the easiest option for me would be to store uniqueID and node list in a
mysql and then use a python shelf. I might even store a pickled format
string in the my sql table.
Thanks again,

-----Original Message-----
From: address@hidden
[mailto:address@hidden On Behalf
Of Csardi Gabor
Sent: 18 September 2008 19:32
To: Help for igraph users
Subject: Re: [igraph] persisting graphs

Another possibility would be to pre-compute the properties
and store them in a seperate database/file/whatever. If 
you can precompute them.


On Thu, Sep 18, 2008 at 07:24:26PM +0100, Tamas Nepusz wrote:
> >Hence I was thinking by storing it as XML I
> >could query the graphs and select the ones I want.
> You can store a GraphML representation as part of an XML document, but

> the problem is that when you actually try to retrieve the graph and  
> select the ones you need using an appropriate XPath query, you will  
> have to copy the XML representation of the graph subtree to a separate

> temporary file before you load it into memory, since the Python  
> interface can only read GraphML graphs from files. I don't know if  
> it's appropriate for you or not.
> Or maintain a Python shelve.Shelf object and an XML database  
> simultaneously: you query your XML database, grab some unique IDs of  
> the graphs you need and then quickly deserialise them from your Shelf

> that uses the same unique IDs as the XML database. I think that's the

> best solution if storage space does not matter.
> -- 
> Tamas
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Csardi Gabor <address@hidden>    MTA RMKI, ELTE TTK

igraph-help mailing list

reply via email to

[Prev in Thread] Current Thread [Next in Thread]