- From: Michael Brunnbauer <brunni@netestate.de>
- Date: Thu, 19 Feb 2015 21:19:06 +0100
- To: Paul Houle <ontology2@gmail.com>
- Cc: Kingsley Idehen <kidehen@openlinksw.com>, Linked Data community <public-lod@w3.org>
- Message-ID: <20150219201906.GA4696@netestate.de>
Hello Paul, On Thu, Feb 19, 2015 at 12:27:41PM -0500, Paul Houle wrote: > I think you're particular concerned about the ordering of triples where ?s > and ?p are the same? > > ?s ?p ?o1 , ?o2, ?o3, ?o4 . > > right? The case for ?s ?p is more compelling but that does not mean that the case for ?s should be dropped. > One scenario is we are drawing a page about the creative works of Issac > Asimov, the Kinks, or Jeff Bridges and want to see titles that everybody > recognizes at the top of the list. In some of these cases there is a > subjective element in that there is no global total ordering or even a > partial ordering (see Arrow's Theorem), but it's fair to say more people > know the song "Lola" than "Ducks on the Wall". Don't forget the use case where the user wants to have his ordering and not some global ordering. Does Arrow's Theorem say something about partial orderings? The Wikipedia article about Arrow's Theorem talks about complete rankings, which I take to mean total ordering. > With RDF* you can put on edge weights which will support cases like that. This means automatically generated edge weights? Doesn't this assume that a reasonable number of people have made the same statement before and that the editor has has to somehow find this number and compare it with other numbers or get the edge weight from a central service? > Another approach is to further specify the data model so you get behavior > like hashtables in PHP -- PHP hashtables support random access look up but > if you iterate over them things come out in the order you put them in. I am not sure I understand this. How would this look like? Triples about MD5-hashes of serialized triples? > Another case is where there really is a total ordering. For instance, the > authors of a scientific paper might get excited if you list them in the > wrong order. One weird old trick for this is RDF containers, which are > specified in the XMP dialect of Dublin Core How do you bring this in line with <property> rdfs:range <datatype>, especially <property> rdfs:range rdf:langString? I do not see a contradiction but this makes things quite ugly. How about all the SPARQL queries that assume a literal as object and not a RDF container? > It's definitely a tooling issue but it does involve > looking at hard issues in the underlying data model. You can definitely solve it with one named graph per triple - which may look like a hard issue for some people. Regards, Michael Brunnbauer -- ++ Michael Brunnbauer ++ netEstate GmbH ++ Geisenhausener Straße 11a ++ 81379 München ++ Tel +49 89 32 19 77 80 ++ Fax +49 89 32 19 77 89 ++ E-Mail brunni@netestate.de ++ http://www.netestate.de/ ++ ++ Sitz: München, HRB Nr.142452 (Handelsregister B München) ++ USt-IdNr. DE221033342 ++ Geschäftsführer: Michael Brunnbauer, Franz Brunnbauer ++ Prokurist: Dipl. Kfm. (Univ.) Markus Hendel
Received on Thursday, 19 February 2015 20:19:30 UTC