Re: Uniqueness of blank node labels

On Wednesday 2. March 2011 19:44:00 you wrote:
> In case you want to compile queries from several BGPs that potentially
> share bnodes programmatically, you can proceed similar to RDF graph merge,
> where, when two graphs are merged, bnode labels are expected to be
> "standardized apart".

Yes, I can see how that can be done.

> We would be grateful if you would acknowledge that your comment has been
> answered by sending a reply to this mailing list.

Yes, thank you, my comment has been answered.

Best,

Kjetil
-- 
Kjetil Kjernsmo
Ph.d. Student, Semantic Web
kjekje@ifi.uio.no
http://www.kjetil.kjernsmo.net/

Received on Wednesday, 2 March 2011 18:59:42 UTC