- From: Melvin Carvalho <melvincarvalho@gmail.com>
- Date: Thu, 26 Jul 2018 12:49:13 +0200
- To: thomas lörtsch <tl@rat.io>
- Cc: Semantic Web <semantic-web@w3.org>
- Message-ID: <CAKaEYhJVnTRxO9SujbKyoTSvoP=4X8A=B1cPKpAB5h_PXhMRFQ@mail.gmail.com>
On 26 July 2018 at 12:42, Melvin Carvalho <melvincarvalho@gmail.com> wrote: > > > 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? > Ah, you want it to be an IRI So, what about just putting urn:string: before it? Or taking a hash and using ni: URIs as per RFC 6920 https://tools.ietf.org/html/rfc6920 The IRIs would need to be expanded. And a certain treatment for blank nodes. I think the JSON LD playground has a normalization algo https://json-ld.org/playground/ Is that along the right lines? > > >> >> >> Thanks, >> Thomas >> > >
Received on Thursday, 26 July 2018 10:49:37 UTC