DBpedia Fr provides a complete description of itself using the void, dcat, sd and prov ontologies.
That description is composed of two layers :
DBpedia Fr contains many triples, they spread out named graphs. Each graph is the result of a different extraction process, as available on our Databus collection.
By convention their URI is defined as follows: <http://fr.dbpedia.org/graph/$nom_artefact> You can specify easily which name graph you want to query with a FROM statement. For example, if you want to get the type of a particular resource, it is better to define that you target the dedicated named graph, rather than letting Virtuoso lookup for a specific property in the entire knowledge base.:
The performance gain in time is not significant on that simple query, but when you work on a complex query it will make sense.
You can visualize below these named graphs depending on the number of triples they contribute to DBpedia Fr. Mouse over the bubbles for reading some information about each graph. Click on it if you want to fix the data in the right-hand table.
Properties | Value |
---|---|
Name | |
Nb triples | |
Nb properties | |
Nb entities | |
Nb classes | |
Description | |
Generated at | |
Process | |
DataDump |
Metadata are also available into the DBpedia endpoint in the named graph : <http://fr.dbpedia.org/graph/metadata>. therefore it make possible to querying them via SPARQL.
Note that we choose to not diplaying the blank nodes (Filter !isBlank)
For getting all the named graph, it's possible to use the following query :
If you want to learn more about a given named graph, for example this one : <http://fr.dbpedia.org/graph/dbpedia_generic_infobox-properties>, you just have to use this query :
You can access via this query to all the following propertie
In addition to global statistics, it is possible to have access to fine statistics computed on each named graph. Most of them aren't reachable using a COUNT statement, because they require too much computation time. We pre-calculated and made them accessible using the properties partitions and class partitions, proposed by the void vocabulary. We recommend, therefore, that you do not re-calculate these statistics yourself using a COUNT clause.
Give you access for each property of a named graph to :
Give you access for each class of a named graph to :