True
On Mon, Apr 25, 2022, 5:36 AM Andy Seaborne wrote:
> (this isn't a JSON-LD 1.0 vs 1.1 issue)
>
> On 24/04/2022 18:49, Dan Davis wrote:
> > The dependency exists whether it is explicit or not, because the
> ecosystem
> > of packages that validate JSON documents rev
array, and carries the
> information in the RDF data (triples and prefixes/@vocab). i.e. it
> round-trips.
>
> In the trade-off between better presentation, and switching over at the
> next version, I think delays in switching 1.1 is delayed will slowly
> becoming more painfu
It has always bothered me that JSONSchema is not an official standard in
the way that XML and RDF/XML are. I know that JSON-LD 1 and 2 are more
standardized under W3C, but they depend so much on JSONSchema. Last I
checked, JSON Schema DRAFT 4 was the closest to a schema. Is the story any
better
ith TextDataset wrapping about it: 13
> minutes
>
> Regards
>
> On Thu, Sep 19, 2019 at 10:54 AM Dan Davis wrote:
>
> > dbpedia is not actually that large. Make sure you test with RDF datasets
> > that really represent your data.
> >
> > On Wed, Sep 18,
to experimenting with it and seeing
what I can do on the backend.
On Thu, Sep 12, 2019 at 10:19 AM Dan Davis wrote:
> Virtuoso's Jena driver implements the model interface, rather than the
> DatasetGraphAPI. is translating the SPARQL query into its own JDBC
> interface. You can see the arc
Virtuoso's Jena driver implements the model interface, rather than the
DatasetGraphAPI. is translating the SPARQL query into its own JDBC
interface. You can see the architecture at
http://docs.openlinksw.com/virtuoso/rdfnativestorageprovidersjena/#rdfnativestorageprovidersjenawhatisv.
However,
Jason,
I would argue that you should exchange a Set of triples, so you can take
advantage of Spark's distributed nature. Your logic can materialize that
list into a Graph or Model when needed to operate on it. Andy is right
about being careful about the size - you may want to build a
POJO to the RDF subject and the other to
> identify the POJO properties that should be mapped to properties.
>
> Claude
>
> On Mon, Apr 8, 2019 at 7:00 AM Dan Davis wrote:
> >
> > To me, it seems unfortunate to make the Resource do all the work, and
> make
> >
To me, it seems unfortunate to make the Resource do all the work, and make
it more than the subject of triples. Some labeled property graphs define
an OGM (Object/Graph Mapping). I wonder whether that concept has any
bearing here.
Anyway, I've wished for an OGM sort of mapping to a POJO for
ersion as SPARQL 1.1 has
> been the default for a while now.
>
> The package:
> org.apache.jena.sparql.syntax.syntaxtransform
>
> work on the syntax, rather than the algebra, which might be an
> alternative for some transformation for you. It mikght be newer than
> code you h
.
}
The second problem was that ORDER BY screws up the results, because it
prevented an automated grouping.
On Sat, Mar 23, 2019 at 10:28 PM Dan Davis wrote:
> I've now designed a unit test for the code above, and it works mostly as
> intended. I still don't see how to get Count queries work
:
Syntax.querySyntaxNames.keys()
Sigh - I'd rather be programming Python, but that's OK.
On Fri, Mar 22, 2019 at 5:55 PM Dan Davis wrote:
>
> Hi guys, I'm writing my first Transform, and I'm having trouble with a
> count query.
> arq.qparse doesn't parse and print my count query, so I can
Hi guys, I'm writing my first Transform, and I'm having trouble with a
count query.
arq.qparse doesn't parse and print my count query, so I cannot get much
feedback whether I'm doing the right thing or not.
A limit query seems simple enough, however:
package gov.nih.nlm.lode.service;
import
Hi, the ability for RDF frameworks like Jena and triple-stores to do
inference is one of the particular features of RDF and SPARQL over graph
databases like Neo4j.
The inference done by triple stores is first-order logic, rather than
statistical inference, but it is still powerful. It means that
(CONTAINS(?something, "word")) never drives the
query, but FILTER(bif:contains(?something, "word")) will drive the query if
there is full text indexing.
Thanks,
-Dan Davis
True, my use case is development. It is easier if links that are results
of SPARQL point back to the development system.
On May 22, 2018 9:55 AM, "Martynas Jusevičius"
wrote:
Why generate URIs at all in the beginning, can't you use blank nodes?
Rewriting URIs is
On my system, I structure the system as APIs that return linked data and
HTML/JavaScript that rewrites the URLs.
No question - it's work anyway you do it.
On Tue, May 22, 2018, 7:00 AM Claude Warren wrote:
> I have what I think may be a common problem and am looking for
So, this is what I was asking about earlier. With small graphs, e.g.
DESCRIBE <>, the algorithms for graph isomorphism that support blank
nodes should be good. rdflib includes an implementation, and I wish I
knew whether there is an implementation of that digest algorithm for Jena.
On Fri,
d the data.
On Fri, Nov 24, 2017 at 10:02 AM, Osma Suominen <osma.suomi...@helsinki.fi>
wrote:
> Dan Davis kirjoitti 24.11.2017 klo 16:53:
>
>> Rdflib has a graph_diff method that returns common, triples, only in left,
>> only in right. It is in IsonorpgicGraph class,
What I do is load the new Nt file into an updates graph and then use
capabilities of the triple store to compare. For me, that's virtuoso, so
SQL queries are also available.
On Nov 24, 2017 9:53 AM, "Dan Davis" <dansm...@gmail.com> wrote:
> Rdflib has a graph_diff method
Rdflib has a graph_diff method that returns common, triples, only in left,
only in right. It is in IsonorpgicGraph class, so it should handle blank
nodes.
On Nov 24, 2017 7:19 AM, "Laura Morales" wrote:
> > What about simply deleting the old graph and loading the triples of
21 matches
Mail list logo