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

Re: generating globally unique triple identifier as IRIs

From: Melvin Carvalho <melvincarvalho@gmail.com>
Date: Thu, 26 Jul 2018 12:42:31 +0200
Message-ID: <CAKaEYhKidYiE2==x_dHPOQPZ+Z6g=NXYZ1DvJv6mP_B5=Svaug@mail.gmail.com>
To: thomas lörtsch <tl@rat.io>
Cc: Semantic Web <semantic-web@w3.org>
On 24 July 2018 at 17:56, thomas lörtsch <tl@rat.io> wrote:

> I’m looking for an algorithm to generate identifiers for any possible RDF
> statements that are themselve IRIs, globally unique, reproducible and not
> dependend on the source of the statement (i.e. document URI).
>
> In other words, the algorithm has to have the following properties:
> - reproducible: the same triple must always get the same identifier
> - global: the identifier must be independent from the source of the triple
>   (a document title, named graph name, graph URI etc)
> - unique: triples that differ in subject, predicate or object must have
> different identifiers
> - conformant: the identifier must be an IRI
> - autonomous and finite: it can’t rely on any central repository,
> secondary service etc
>
> Does such an algorithm exist? Is it even possible given that each node in
> the stateent could be an IRI of maximal length and entropy?
>

surely it's already a unique UUID, modulo white space?

so just separate with spaces and put a . at the end ... am i missing
something?


>
>
> Thanks,
> Thomas
>
Received on Thursday, 26 July 2018 10:43:05 UTC

This archive was generated by hypermail 2.3.1 : Thursday, 26 July 2018 10:43:06 UTC