- From: Michel Dumontier <michel.dumontier@gmail.com>
- Date: Tue, 24 Jul 2018 20:40:27 +0200
- To: tl@rat.io
- Cc: SWIG Web <semantic-web@w3.org>
- Message-ID: <CALcEXf5ymTZdfHVJ-pfYH1PsDXo_69HJPFiOn_fT_iXpKR1s+A@mail.gmail.com>
Hi, please have a look at our trustyURI solution http://trustyuri.net/ m. On Tue, Jul 24, 2018 at 6:02 PM 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? > > > Thanks, > Thomas > -- Michel Dumontier Distinguished Professor of Data Science Maastricht University http://dumontierlab.com
Received on Tuesday, 24 July 2018 18:41:02 UTC