RDF#
- Release:
6.1.2
- Date:
Oct 28, 2026
Labeled directed graphs built from RDF / OWL datasets, where nodes are resources and edges are predicates; they support studying context-free path queries over RDF as in “Context-Free Path Queries on RDF Graphs”.
Graph |
Num Nodes |
Num Edges |
Reachable pairs / subClassOf |
Reachable pairs / subClassOf_type |
Reachable pairs / type |
Reachable pairs / broaderTransitive |
Size (MB) |
Download |
129 |
273 |
0 |
12 |
12 |
0.003 |
|||
131 |
277 |
33 |
52 |
19 |
0.004 |
|||
144 |
252 |
1 |
30 |
29 |
0.003 |
|||
179 |
293 |
17 |
25 |
6 |
0.003 |
|||
256 |
631 |
7 |
36 |
29 |
0.004 |
|||
291 |
425 |
2 |
6 |
4 |
0.004 |
|||
337 |
640 |
24 |
51 |
29 |
0.005 |
|||
341 |
459 |
43 |
47 |
4 |
0.004 |
|||
671 |
1980 |
1334 |
1356 |
20 |
0.013 |
|||
733 |
1839 |
499 |
565 |
65 |
0.012 |
|||
778 |
1086 |
27 |
58 |
31 |
0.007 |
|||
1323 |
2752 |
143 |
204 |
61 |
0.014 |
|||
6238 |
12363 |
883 |
884 |
2 |
0.052 |
|||
45007 |
490109 |
588976 |
588976 |
0 |
4.97 |
|||
48815 |
86543 |
394 |
396 |
3 |
14267542 |
0.360 |
||
450609 |
2201532 |
0 |
85 |
85 |
226669749 |
7.95 |
||
582929 |
1437437 |
640305 |
640316 |
9 |
11.23 |
|||
239111 |
360248 |
90988 |
90994 |
6 |
2.10 |
|||
2112625 |
32876289 |
5351657 |
5351657 |
0 |
99.65 |
|||
5728398 |
14922125 |
151703 |
151706 |
4 |
59.52 |
Canonical grammars#
Nested parentheses grammars introduced in “Context-Free Path Queries on RDF Graphs”. Template for these grammars is described on the Nested Parentheses page.
S -> subClassOf_r S subClassOf | subClassOf_r subClassOf
S -> type_r S type | type_r type
S -> subClassOf_r S subClassOf | subClassOf_r subClassOf
S -> type_r S type | type_r type
S -> broaderTransitive S broaderTransitive_r | broaderTransitive broaderTransitive_r