The viewpoint of the CTO of a company that extensively uses RDF Triplestores commercially: Schema flexibility – it’s possible to do the equivalent of a schema change to an RDF store live, and without any downtime, or redesign – it’s not a free lunch, you need to be careful with how your software works, but … Read more
I’m not entirely sure why you say SPARQL doesn’t supply ‘the basic logic operators’, because your own examples clearly show that it does: it provides logical-OR (||) and logical-AND (&&) as part of FILTER conditions, and disjunctive graph patterns using UNION (of course, conjunctive graph patterns need no special syntax). Other variations of OR-like constructs … Read more
The best explanation is by example. Try googling for all cars advertised on the web with engines smaller than 2.0 litres that run unleaded, and have an mp3 connection and can been seen in a showroom conveniently accessible by public transport from my house. Google just won’t be able to help you with that query, … Read more
Well, the obvious first start is to look at the classes and properties present in the data. Here is how to see what classes are being used: SELECT DISTINCT ?class WHERE { ?s a ?class . } LIMIT 25 OFFSET 0 (LIMIT and OFFSET are there for paging. It is worth getting used to these … Read more
The main difference between graph databases and triple stores is how they model the graph. In a triple store (or quad store), the data tends to be very atomic. What I mean is that the “nodes” in the graph tend to be primitive data types like string, integer, date, etc. Relationships link primitives together, and … Read more