The Coron System.
Data Publica, le portail français des données publiques et de l'open data. Managing RDF Using Named Graphs. In this post I want to put down some thoughts around using named graphs to manage and query RDF datasets.
This thinking is prompted is in large part by thinking how best to use Named Graphs to support publishing of Linked Data, but also most recently by the first Working Drafts drafts of SPARQL 1.1. While the notion of named graphs for RDF has been around for many years now, the closest they have come to being standardised as a feature is through the SPARQL 1.0 specification which refers to named graphs in its specification of the dataset for a SPARQL query. SPARQL 1.1 expands on this, explaining how named graphs may be used in SPARQL Update, and also as part of the new Uniform HTTP Protocol for Managing RDF Graphs document. Named graphs are an increasingly important feature of RDF triplestores and are very relevant to the notion of publishing Linked Data, so their use and specification does bear some additional analysis. Tutorials for HBase: concepts, architecture, mapreduce, etc. - alexdong's notebook.