Table 4 Crawled datasets with breadth-first/load-balancing strategy
From: ApproxMap - a method for mapping blank nodes in RDF datasets
Instance number | |B| | |G| | D a | b density | b len | |||||
|---|---|---|---|---|---|---|---|---|---|---|
| Â | File 1 | File 2 | File 1 | File 2 | File 1 | File 2 | File 1 | File 2 | File 1 | File 2 |
1 | 169 | 19 | 4,355 | 1,048 | 5.73 | 9.00 | 0.21 | 0.01 | 16.26 | 0.11 |
2 | 190 | 83 | 11,892 | 11,470 | 5.82 | 7.31 | 0.07 | 0.00 | 1.67 | 0.00 |
3 | 1,246 | 893 | 24,364 | 15,337 | 5.13 | 4.40 | 0.10 | 0.00 | 10.88 | 0.02 |
4 | 1,963 | 361 | 27,650 | 28,208 | 6.75 | 5.93 | 0.00 | 0.00 | 0.00 | 0.00 |
5 | 1,967 | 362 | 28,031 | 28,219 | 6.74 | 5.96 | 0.00 | 0.00 | 0.01 | 0.00 |