W3C home > Mailing lists > Public > semantic-web@w3.org > July 2007

Re: Named Graph Serialisation

From: Alan Ruttenberg <alanruttenberg@gmail.com>
Date: Thu, 26 Jul 2007 01:42:37 -0400
Message-Id: <253B47BC-63AD-4B94-A434-AF60B19FD893@gmail.com>
Cc: <semantic-web@w3.org>
To: P.L.Coetzee <P.L.Coetzee@open.ac.uk>

What about serializing to a bunch of separate files, one for each  
graph + manifest describing mapping of file to graph, and then  
bundling them as a zip. This would remain compatible with existing  
standards (unzip, load each file into a separate graph following  
manifest), but allow for a custom loader that read and loaded from  
the zip directly. Don't know which triple store you are using, but  
virtuoso allows for multi-threaded loading of multiple turtle format  
files, which tend to be more compact than ntriples, so that might be  
a format that works well for both readability and speed.


On Jul 25, 2007, at 11:49 AM, P.L.Coetzee wrote:

> Dear all,
> I have a fairly large set of data persisted in a quad-store,  
> consisting of a set of named graphs within a single dataset. Other  
> than TRiX, I've yet to come across any 'accepted' means of  
> seralising the graphs into a single RDF dump (ideally which could  
> be read in without massive memory overhead, such as can be easily  
> done with N-Triples).
> The obvious solution to me would be a sort of 'N-Quadruples',  
> whereby one serialises the Graph URI as the first element per line,  
> followed by the usual S-P-O triple pattern of N-Triples. This seems  
> like the simplest solution (in terms of ease of implementation,  
> readability, as well as for any future processing on the set). What  
> are the list's thoughts on such an approach; is there any prior art  
> that I'm missing, other standards that can achieve the same goals  
> that etc?
> Thanks in advance for your thoughts!
> Cheers,
> Peter
Received on Thursday, 26 July 2007 05:42:51 UTC

This archive was generated by hypermail 2.4.0 : Thursday, 24 March 2022 20:41:05 UTC