SPARQL for RDF querying <https://twitter.com/bobdc...
# thinking-together
c
đŸ€© 2
e
"I use these rarely enough that I re-read the “Named Graphs” section of my book’s “Updating Data with SPARQL” chapter as a review before I assembled the steps below."
this is weird to me since it seems like such useful feature, given the difficulty to address triples. The named graph makes the triple a quad
so you can use that forth quad to determine origin of the triple for instance
if the graph is named "emmanuel:2020-04-26" then potentially I can use that info to determine author and date of each of the triples on that graph
🌈 1
j
The author makes two (on the surface) contradictory claims: redundancy generally leads to inefficiency, and db administrators introduce redundancy to increase efficiency. I think in the first case, they’re referring to developer/user efficiency, and in the second computer (db server) efficiency. Other ways that we can trade off between those two efficiencies spring to mind: low-level vs. high-level languages, simple vs. complex UI. Pretty unrelated to the content of the article, but I thought it was a little interesting.
e
I found the comment on inefficiency weird too... denormalization is wasteful in terms of storage requirements but it is usually done to avoid joins, so it ends up being a trade-off, the main problem it causes is not inefficiency but data inconsistency
oh, been reading these patterns on using named graphs: https://patterns.dataincubator.org/book/data-management-patterns.html