Hi Carsten,
On Thu, 2012-02-23 at 22:09 +0100, Carsten Keßler wrote:
[ . . . ]
So we'd have to do (assuming all graph metadata are stored in the same graph):
select ?s ?p ?o where {
graph ?g1 { ?g http://xmlns.com/foaf/0.1/maker
http://www.brunni.de/foaf.rdf#me .
?g2
Hello David,
On Thu, Feb 23, 2012 at 05:37:18PM -0500, David Booth wrote:
Essentially, you have used a clause like
?gN http://xmlns.com/foaf/0.1/maker
http://www.brunni.de/foaf.rdf#me .
instead of a FROM NAMED clause, so if you have N graphs, then you'll
need N of these
On Fri, 2012-02-24 at 15:18 +0100, Michael Brunnbauer wrote:
Hello David,
On Thu, Feb 23, 2012 at 05:37:18PM -0500, David Booth wrote:
Essentially, you have used a clause like
?gN http://xmlns.com/foaf/0.1/maker
http://www.brunni.de/foaf.rdf#me .
instead of a FROM
Dear Kingsley,
But this is what (most?) triple stores do with the default graph in the
absence of FROM/NAMED clauses in queries anyway. (Certainly this is the
Sesame approach, followed by OWLIM.)
Not so re. Virtuoso. The Graph IRIs don't matter. Only used them if you
explicitly seek to
On 2/23/12 7:07 AM, Carsten Keßler wrote:
Dear Kingsley,
But this is what (most?) triple stores do with the default graph in the
absence of FROM/NAMED clauses in queries anyway. (Certainly this is the
Sesame approach, followed by OWLIM.)
Not so re. Virtuoso. The Graph IRIs don't matter. Only
On Thu, 2012-02-23 at 13:20 +0100, Carsten Keßler wrote:
[ . . . ]
In principle, SPARQL 1.1 allows you to specify any number of named
graphs to be used in a query, using the FROM NAMED syntax. However,
this is not likely to work well when the number of named graphs gets
large.
What
Hello David,
On Thu, Feb 23, 2012 at 09:51:29AM -0500, David Booth wrote:
I do not have any specific evidence. I simply meant that SPARQL server
developers probably did not have thousands of FROM NAMED clauses in
mind as their primary design target, so you could run into unforeseen
Hi Michael,
On Thu, 2012-02-23 at 16:59 +0100, Michael Brunnbauer wrote:
[ . . . ]
I do not see why you have to name thousands of graphs in the query. Is
the metadata not attached to the named graph with the named graph URI
as subject ?
You could query it like this:
select ?s ?p ?o where
Hi David,
select ?s ?p ?o where {
graph ?g1 { ?g http://xmlns.com/foaf/0.1/maker
http://www.brunni.de/foaf.rdf#me }
graph ?g { ?s :p1 ?o .
?s :p2 ?o .}
}
So we'd have to do (assuming all graph metadata are stored in the same graph):
select ?s ?p ?o where
Hello David,
so the problem is not to get the merge of the matching graphs but to query
it ? Sorry - I was not following this thread with full attention.
In this case it seems that you have to repeat the metadata pattern for
every query triple like Carsten suggested. Or you first get a list of
Dear LODers,
we are currently working on a project for the United Nations Office
for the Coordination of Humanitarian Affairs (OCHA) in Geneva to
develop a Humanitarian Exchange Language (HXL). Some information about
the project is available at https://sites.google.com/site/hxlproject/.
One of
Hi Carsten,
On 2/22/2012 12:02 PM, Carsten Keßler wrote:
Dear LODers,
we are currently working on a project for the United Nations Office
for the Coordination of Humanitarian Affairs (OCHA) in Geneva to
develop a Humanitarian Exchange Language (HXL). Some information about
the project is
, February 22, 2012 5:21 AM
Subject: Re: Metadata about single triples
Hi Carsten,
On 2/22/2012 12:02 PM, CarstenKeßler wrote:
Dear LODers,
we are currently working on a project for the United Nations Office
for the Coordination of Humanitarian Affairs (OCHA) in Geneva to
develop
Hi Bob,
At a first glance, your ontology looks very interesting and well designed.
thanks, we are doing our best ;)
So there might be the (rather old) need for
statement identifiers, i.e., a URI (or maybe also a bnode) for identifying a
single triple and to be able to describe external
Hi Gannon,
I agree with the comments below. I think what Bob is suggesting is that you
include a non-ontology Core (DCMI for example).
I am not sure whether I get that correctly, but it is pretty clear to
use that we need something like this. We are already using some of the
DCMI properties
Hi Carsten,
On 2/22/2012 5:51 PM, Carsten Keßler wrote:
Hi Bob,
At a first glance, your ontology looks very interesting and well designed.
thanks, we are doing our best ;)
So there might be the (rather old) need for
statement identifiers, i.e., a URI (or maybe also a bnode) for
On 22/02/2012 17:21, Bob Ferris wrote:
[...] Named Graphs unnecessary fragment complex descriptions into
(very) small piece due to their provenance descriptions*. So when you
would like to query this complex description at once you may have to
include many Named Graphs. This makes the SPARQL
On 2/22/12 12:30 PM, Barry Norton wrote:
On 22/02/2012 17:21, Bob Ferris wrote:
[...] Named Graphs unnecessary fragment complex descriptions into
(very) small piece due to their provenance descriptions*. So when you
would like to query this complex description at once you may have to
include
Carsten,
On Wed, 2012-02-22 at 12:02 +0100, Carsten Keßler wrote:
[ . . . ]
The aspect we are currently working on is a metadata section that will
include classes and properties to state who has reported a certain
piece of information, when it was reported, whether it was approved
(and at
On 22/02/2012 18:18, Kingsley Idehen wrote:
On 2/22/12 12:30 PM, Barry Norton wrote:
On 22/02/2012 17:21, Bob Ferris wrote:
[...] Named Graphs unnecessary fragment complex descriptions into
(very) small piece due to their provenance descriptions*. So when
you would like to query this complex
On 2/22/12 1:58 PM, Barry Norton wrote:
On 22/02/2012 18:18, Kingsley Idehen wrote:
On 2/22/12 12:30 PM, Barry Norton wrote:
On 22/02/2012 17:21, Bob Ferris wrote:
[...] Named Graphs unnecessary fragment complex descriptions into
(very) small piece due to their provenance descriptions*. So
Keßler carsten.kess...@uni-muenster.de
To: public-lod@w3.org
Cc: Chad Hendrix hend...@un.org
Sent: Wednesday, February 22, 2012 11:10 AM
Subject: Re: Metadata about single triples
Hi Gannon,
I agree with the comments below. I think what Bob is suggesting is that you
include a non-ontology Core
22 matches
Mail list logo
