<table><caption>Listing 13: An RDF mapping serialized in YARRRML.</caption>
  <tbody>
    <tr>
      <td>prefixes:</td>
      <td></td>
    </tr>
    <tr>
      <td>ex:</td>
      <td>"http://example.org/"</td>
    </tr>
    <tr>
      <td>dbo:</td>
      <td>"http://dbpedia.org/ontology/"</td>
    </tr>
    <tr>
      <td>locah:</td>
      <td>"http://data.archiveshub.ac.uk/def/"</td>
    </tr>
    <tr>
      <td>geo:</td>
      <td>"http://www.w3.org/2003/01/geo/wgs84_pos#"</td>
    </tr>
    <tr>
      <td>foaf:</td>
      <td>"http://xmlns.com/foaf/0.1/"</td>
    </tr>
    <tr>
      <td>schema:</td>
      <td>"http://schema.org/"</td>
    </tr>
    <tr>
      <td>wikidata:</td>
      <td>"http://www.wikidata.org/entity/"</td>
    </tr>
    <tr>
      <td>dul:</td>
      <td>"http://www.ontologydesignpatterns.org/ont/dul/DUL.owl#"</td>
    </tr>
    <tr>
      <td>sources:</td>
      <td></td>
    </tr>
    <tr>
      <td>dataset-source:</td>
      <td>[people.csv~csv]</td>
    </tr>
    <tr>
      <td>mappings:</td>
      <td></td>
    </tr>
    <tr>
      <td>person:</td>
      <td></td>
    </tr>
    <tr>
      <td>source:</td>
      <td>dataset-source</td>
    </tr>
    <tr>
      <td>s:</td>
      <td>ex:Person/$(Name)</td>
    </tr>
    <tr>
      <td>po:</td>
      <td></td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, dbo:Person]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, dbo:Agent]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, foaf:Person]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, dul:NaturalPerson]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, wikidata:Q215627]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, wikidata:Q5]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, schema:Person]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[dbo:name, $(Name)]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[locah dateBirth, $(Birth)]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[dbo:birthPlace, ex:Place/$(Birth City)~iri]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[dbo:birthPlace, ex:Place/$(Birth Province)~iri]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[rdfs:label, $(Name)]</td>
    </tr>
    <tr>
      <td>place:</td>
      <td></td>
    </tr>
    <tr>
      <td>source:</td>
      <td>dataset-source</td>
    </tr>
    <tr>
      <td>s:</td>
      <td>ex:Place/$(Birth City)</td>
    </tr>
    <tr>
      <td>po:</td>
      <td></td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, dbo:Place]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, dbo:Location]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, schema:Place]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, geo:SpatialThing]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[rdfs:label, $(Birth City)]</td>
    </tr>
    <tr>
      <td>spatialthing:</td>
      <td></td>
    </tr>
    <tr>
      <td>source:</td>
      <td>dataset-source</td>
    </tr>
    <tr>
      <td>s:</td>
      <td>ex:Place/$(Birth Province)</td>
    </tr>
    <tr>
      <td>po:</td>
      <td></td>
    </tr>
    <tr>
      <td>-</td>
      <td>[a, geo:SpatialThing]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[geo:lat, $(Lat)]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[geo:long, $(Long)]</td>
    </tr>
    <tr>
      <td>-</td>
      <td>[rdfs:label, $(Birth Province)]</td>
    </tr>
  </tbody>
</table>
<figure><img src="image_58.png" /><figcaption>Listing 14: The restrictiveness lattice of status of Figure 4.2c in RDF format.</figcaption></figure>
A. SUPPLEMENTAL MATERIALS

1

PREFIX tcga: <http://tcga.deri.ie/schema/>

2

PREFIX kegg: <http://bio2rdf.org/ns/kegg#>

3

PREFIX dbpedia: <http://dbpedia.org/ontology/>

4

PREFIX drugbank: <http://www4.wiwiss.fu-berlin.de/drugbank/resource/drugbank/>

5

PREFIX purl: <http://purl.org/dc/terms/>

6

7

SELECT DISTINCT ?patient ?gender ?country ?popDensity ?drugName ?indication ?formula ?compound

8

WHERE

9

{

10

?uri tcga:bcr patient barcode ?patient .

11

?patient tcga:gender ?gender .

12

?patient dbpedia:country ?country .

13

?country dbpedia:populationDensity ?popDensity.

14

?patient tcga:bcr drug barcode ?drugbcr.

15

?drugbcr tcga:drug_name ?drugName.

16

?drgBnkDrg drugbank:genericName ?drugName.

17

?drgBnkDrg drugbank:indication ?indication.

18

?drgBnkDrg drugbank:chemicalFormula ?formula.

19

?drgBnkDrg drugbank:keggCompoundId ?compound .

20

}

21

22

SELECT DISTINCT ?patient ?gender ?country ?popDensity ?drugName ?indication ?formula ?compound

23

24

WHERE

25

{

26

?uri tcga:bcr patient barcode ?patient .

27

?patient tcga:gender ?gender.

28

?patient dbpedia:country ?country.

29

?country ?7sqC60 ?popDensity.

30

?patient tcga:bcr drug barcode ?drugbcr.

31

?drugbcr tcga:drug_name ?drugName.

32

?drgBnkDrg drugbank:genericName ?drugName.

33

?drgBnkDrg drugbank:indication ?indication.

34

?drgBnkDrg drugbank:chemicalFormula ?formula.

35

?drgBnkDrg drugbank:keggCompoundId ?compound .

36

}

37

38

# Similarity: 0.6666666666

<caption>Listing 15: The query C10 followed by the candidate query C10'.</caption>
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

```sql
PREFIX linkedmdb: <http://data.linkedmdb.org/resource/movie/>
PREFIX dcterms: <http://purl.org/dc/terms/>
PREFIX dbpedia: <http://dbpedia.org/ontology/>
PREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#>

SELECT ?actor ?movie ?movieTitle ?movieDate ?birthDate ?spouseName
{
    ?actor rdfs:label ?actor_name_en .
    ?actor dbpedia:birthDate ?birthDate .
    ?actor dbpedia:spouse ?spouseURI .
    ?spouseURI rdfs:label ?spouseName .
    ?imdbactor linkedmdb:actor_name ?actor_name.
    ?movie linkedmdb:actor ?imdbactor .
    ?movie dcterms:title ?movieTitle .
    ?movie dcterms:date ?movieDate .
    FILTER (STR(?actor_name_en ) = STR(?actor_name))
}

SELECT ?actor ?movie ?movieTitle ?movieDate ?birthDate ?spouseName
{
    ?actor rdfs:label ?actor_name_en .
    ?actor ?SxzR4W ?birthDate .
    ?actor ?10CiE4 ?spouseURI .
    ?spouseURI rdfs:label ?spouseName .
    ?imdbactor linkedmdb:actor_name ?actor_name .
    ?movie linkedmdb:actor ?imdbactor .
    ?movie dcterms:title ?movieTitle .
    ?movie dcterms:date ?movieDate .
    FILTER (STR(?actor_name_en ) = STR(?actor_name))
}

# Similarity: 0.4444444444
```

<caption>Listing 16: The query C5 followed by the candidate query C5'.</caption>
A. SUPPLEMENTAL MATERIALS

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

```sql
PREFIX swc: <http://data.semanticweb.org/ns/swc/ontology#>
PREFIX swrc: <http://swrc.ontoware.org/ontology#>
PREFIX eswc: <http://data.semanticweb.org/conference/eswc/>
PREFIX iswc: <http://data.semanticweb.org/conference/iswc/2009/>
PREFIX foaf: <http://xmlns.com/foaf/0.1/>
PREFIX purl: <http://purl.org/ontology/bibo/>
PREFIX dbpedia: <http://dbpedia.org/ontology/>
PREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#>

SELECT DISTINCT * WHERE
{
    ?paper swc:isPartOf iswc:proceedings .
    iswc:proceedings swrc:address ?proceedingAddress.
    ?paper swrc:author ?author .
    ?author swrc:affiliation ?affiliation ;
    ?author rdfs:label ?fullnames ;
    ?author foaf:based_near ?place.
    ?place dbpedia:capital ?capital .
    ?place dbpedia:populationDensity ?populationDensity .
    ?place dbpedia:governmentType ?governmentType .
    ?place dbpedia:language ?language .
    ?place dbpedia:leaderTitle ?leaderTitle .
}

SELECT DISTINCT * WHERE
{
    ?paper swc:isPartOf iswc:proceedings .
    iswc:proceedings swrc:address ?proceedingAddress.
    ?paper swrc:author ?author .
    ?author swrc:affiliation ?affiliation .
    ?author rdfs:label ?fullnames .
    ?author foaf:based_near ?place.
    ?place ?mM9RIT ?capital .
    ?place ?cZP8iP ?populationDensity .
    ?place ?Pp7c1t ?governmentType .
    ?place ?z2uYJB ?language .
    ?place ?de70QZ ?leaderTitle .
}

# Similarity: 0.0777777777
```

<caption>Listing 17: The query C8 followed by the candidate query C8'.</caption>
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

```sql
PREFIX dbpedia: <http://dbpedia.org/ontology/>
PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
PREFIX owl: <http://www.w3.org/2002/07/owl#>
PREFIX drugbank: <http://www4.wiwiss.fu-berlin.de/drugbank/resource/drugbank/>

SELECT * WHERE
{
    ?Drug rdf:type dbpedia:Drug .
    ?drugbankDrug owl:sameAs ?Drug .
    ?InteractionName drugbank:interactionDrug1 ?drugbankDrug .
    ?InteractionName drugbank:interactionDrug2 ?drugbankDrug2 .
    ?InteractionName drugbank text ?IntEffect .
    OPTIONAL
    {
        ?drugbankDrug drugbank:affectedOrganism 'Humans and other mammals' .
        ?drugbankDrug drugbank:description ?description .
        ?drugbankDrug drugbank:structure ?structure .
        ?drugbankDrug drugbank:casRegistryNumber ?casRegistryNumber .
    }
}

ORDER BY (?drugbankDrug)

SELECT * WHERE
{
    ?Drug ?00gzMk ?Cvqg5H .
    ?drugbankDrug ?c5DqMr ?Drug .
    ?InteractionName drugbank:interactionDrug1 ?drugbankDrug .
    ?InteractionName drugbank:interactionDrug2 ?drugbankDrug2 .
    ?InteractionName drugbank text ?IntEffect .
    OPTIONAL
    {
        ?drugbankDrug drugbank:affectedOrganism 'Humans and other mammals' .
        drugbank:description ?description .
        drugbank:structure ?structure .
        drugbank:casRegistryNumber ?casRegistryNumber .
    }
}

ORDER BY (?drugbankDrug)

# Similarity: 0.22222222222
```

<caption>Listing 18: The query C9 followed by the candidate query C9'.</caption>
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

```sql
PREFIX dbpedia: <http://dbpedia.org/resource/>
PREFIX dbprop: <http://dbpedia.org/property/>
PREFIX dbowl: <http://dbpedia.org/ontology/>
PREFIX foaf: <http://xmlns.com/foaf/0.1/>
PREFIX owl: <http://www.w3.org/2002/07/owl#>
PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
PREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#>
PREFIX skos: <http://www.w3.org/2004/02/skos/core#>
PREFIX factbook: <http://www4.wiwiss.fu-berlin.de/factbook/ns#>
PREFIX mo: <http://purl.org/ontology/mo/>
PREFIX dc: <http://purl.org/dc/elements/1.1/>
PREFIX fb: <http://rdf.freebase.com/ns/>

SELECT * WHERE {
    ?a dbowl:artist dbpedia:Michael_Jackson .
    ?a rdf:type dbowl:Album .
    ?a foaf:name ?n .
}

SELECT * WHERE {
    ?a dbowl:artist dbpedia:Michael_Jackson .
    ?a rdf:type dbowl:Album .
    ?a rdfs:label ?n .
}

# Similarity: 0.8115399282213058
```

Listing 19: The query L5 followed by the candidate query L5'.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

```sql
    PREFIX dbpedia: <http://dbpedia.org/resource/>
    PREFIX dbowl: <http://dbpedia.org/ontology/>
    PREFIX owl: <http://www.w3.org/2002/07/owl#>
    PREFIX linkedMDB: <http://data.linkedmdb.org/resource/>
    PREFIX foaf: <http://xmlns.com/foaf/0.1/>
    PREFIX geo: <http://www.geonames.org/ontology#>

SELECT * WHERE {
    ?director dbowl:nationality dbpedia:Italy .
    ?film dbowl:director ?director.
    ?x owl:sameAs ?film .
    ?x foaf:based_near ?y .
    ?y geo:officialName ?n .
}

SELECT * WHERE {
    ?director dbowl:nationality dbpedia:Italy .
    ?film dbowl:director ?director.
    ?x owl:sameAs ?film .
    ?x ?6GKJwd ?y .
    ?y geo:officialName ?n .
}

# Similarity: 0.66666666666
```

<caption>Listing 20: The query L6 followed by the candidate query L6'.</caption>

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

```sql
    PREFIX tcga: <http://tcga.deri.ie/schema/>
    PREFIX dbpedia: <http://dbpedia.org/ontology/>
    SELECT DISTINCT ?patient ?p ?o
    WHERE
    {
        ?uri tcga:bcr patient barcode ?patient .
        ?patient dbpedia:country ?country .
        ?country dbpedia:populationDensity ?popDensity.
        ?patient tcga:bcr aliquot barcode ?aliquot .
        ?aliquot ?p ?o.
    }

    SELECT DISTINCT ?patient ?p ?o
    WHERE
    {
        ?uri tcga:bcr patient barcode ?patient .
        ?patient dbpedia:country ?country .
        ?country ?cG4icP ?popDensity.
        ?patient tcga:bcr aliquot barcode ?aliquot .
        ?aliquot ?p ?o .
    }

# Similarity: 0.66666666666
```

<caption>Listing 21: The query L7 followed by the candidate query L7'.</caption>
```
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
```
```
PREFIX kegg: <http://bio2rdf.org/ns/kegg#>
PREFIX drugbank: <http://www4.wiwiss.fu-berlin.de/drugbank/resource/drugbank/>
PREFIX owl: <http://www.w3.org/2002/07/owl#>
PREFIX foaf: <http://xmlns.com/foaf/0.1/>
PREFIX skos: <http://www.w3.org/2004/02/skos/core#>

SELECT * WHERE {
    ?drug drugbank:drugCategory drugbank:micronutrient .
    ?drug drugbank:casRegistryNumber ?id .
    ?drug owl:sameAs ?s .
    ?s foaf:name ?o .
    ?s skos:subject ?sub .
}

SELECT * WHERE {
    ?drug drugbank:drugCategory drugbank:micronutrient .
    ?drug drugbank:casRegistryNumber ?id .
    ?drug ?XKeC36 ?s .
    ?s rdfs:label ?o .
    ?s skos:subject ?sub .
}

# Similarity: 0.5410266188142039
```

<caption>Listing 22: The query L8 followed by the candidate query L8'.</caption>

```
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
```
```
PREFIX drugbank: <http://www4.wiwiss.fu-berlin.de/drugbank/resource/drugbank/>
PREFIX owl: <http://www.w3.org/2002/07/owl#>
PREFIX dbo: <http://dbpedia.org/ontology/>

SELECT ?Drug ?IntDrug ?IntEffect WHERE {
    ?Drug a dbo:Drug .
    ?y owl:sameAs ?Drug .
    ?Int drugbank:interactionDrug1 ?y .
    ?Int drugbank:interactionDrug2 ?IntDrug .
    ?Int drugbank text ?IntEffect .
}

SELECT ?Drug ?IntDrug ?IntEffect WHERE {
    ?Drug ?zkB8o2 ?OKS9kY .
    ?y ?Y2df3t ?Drug .
    ?Int drugbank:interactionDrug1 ?y .
    ?Int ?Q6kLIS ?IntDrug .
    ?Int drugbank: text ?IntEffect .
}

# Similarity: 0.11111111111
```

<caption>Listing 23: The query S10 followed by the candidate query S10'.</caption>
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

```sql
1     PREFIX drugbank: <http://www4.wiwiss.fu-berlin.de/drugbank/resource/drugbank/>
2     PREFIX dbo: <http://dbpedia.org/ontology/>
3
4     SELECT ?drug ?melt WHERE {
5         { ?drug drugbank:meltingPoint ?melt. }
6         UNION
7         { ?drug dbo:meltingPoint ?melt. }
8     }
9
10
11     SELECT ?drug ?melt WHERE {
12         { ?drug drugbank:meltingPoint ?melt. }
13         UNION
14         { ?drug ?1HmoLC ?melt. }
15     }
16
17     # Similarity: 0.6666666666666666
```

<caption>Listing 24: The query S8 followed by the candidate query S8'.</caption>
<caption>**Algorithm 3:** The insertion of a new license in a CaLi ordering graph starting from the bottom.</caption>

1 **Function** insertFromBottomRec(lᵢ, lⱼ, G):
   **Data:** lᵢ, lⱼ, l<sub>complⱼ</sub>: License,
   G: Graph,
   S: Supremum,
   I: Infimum,
   C<sub>→</sub>: Compatibility constraints,
   LRCompl<sub>lⱼ</sub>: Least restrictive licenses compliant with lⱼ in G,
   LRCompl<sub>lᵢ</sub>: Least restrictive licenses compliant with lᵢ in G
   **if** lⱼ is not already visited **then**
    2 **for** l<sub>complⱼ</sub> ∈ LRCompl<sub>lⱼ</sub> **do**
    3     **if** lᵢ ∨ l<sub>complⱼ</sub> = l<sub>complⱼ</sub> and is_compatible(lᵢ →<sub>ℓ</sub> l<sub>complⱼ</sub>, C<sub>→</sub>) **then**
    4         **if** lᵢ ∨ l<sub>complⱼ</sub> = l<sub>complⱼ</sub> and is_compatible(l<sub>complⱼ</sub> →<sub>ℓ</sub> l<sub>complᵢ</sub>, C<sub>→</sub>) **then**
    5             **for** l<sub>complᵢ</sub> ∈ LRCompl<sub>lᵢ</sub> − l<sub>complⱼ</sub> **do**
    6                 **if** l<sub>complᵢ</sub> ∨ l<sub>complⱼ</sub> = l<sub>complᵢ</sub> and is_compatible(l<sub>complⱼ</sub> →<sub>ℓ</sub> l<sub>complᵢ</sub>, C<sub>→</sub>) **then**
    7                     **if** l<sub>complⱼ</sub> is compatible with l<sub>complᵢ</sub>
    8                         **add** lᵢ → l<sub>complⱼ</sub> to G
    9                 **if** lᵢ ∨ lⱼ = lᵢ and is_compatible(lⱼ →<sub>ℓ</sub> lᵢ, C<sub>→</sub>) **then**
   10                     **if** lᵢ is between lⱼ and l<sub>complⱼ</sub>
   11                         **add** lⱼ → lᵢ to G
   12                     **delete** lⱼ → l<sub>complⱼ</sub> from G
   13                 **else**
   14                     **if** not_compatible(lᵢ →<sub>ℓ</sub> l<sub>complⱼ</sub>, G) **then**
   15                         **add** lᵢ → l<sub>complⱼ</sub> to G
   16                 **if** MRCompl<sub>lᵢ</sub> == ∅ **then**
   17                     **if** MRCompl<sub>lᵢ</sub> is compliant with no license
   18                         **add** I → lᵢ to G
   19                 **return** G
List of Figures

<table>
  <tbody>
    <tr>
      <td>2.1</td>
      <td>An rdf graph vizualized as a labelled directed multigraph.</td>
      <td>13</td>
    </tr>
    <tr>
      <td>2.2</td>
      <td>An extract of the DBpedia ontology.</td>
      <td>14</td>
    </tr>
    <tr>
      <td>2.3</td>
      <td>The saturated RDF graph of Figure 2.1.</td>
      <td>15</td>
    </tr>
    <tr>
      <td>2.4</td>
      <td>Links between two RDF graphs that share the same IRIs.</td>
      <td>16</td>
    </tr>
    <tr>
      <td>2.5</td>
      <td>A BGP matching a subgraph of an RDF graph.</td>
      <td>18</td>
    </tr>
    <tr>
      <td>2.6</td>
      <td>A query processed by a query engine (a) and a federated query engine (b).</td>
      <td>19</td>
    </tr>
    <tr>
      <td>3.1</td>
      <td>An RDF mapping for Roman emperors dataset.</td>
      <td>23</td>
    </tr>
    <tr>
      <td>3.2</td>
      <td>An RDF dataset describing Roman emperors.</td>
      <td>23</td>
    </tr>
    <tr>
      <td>3.3</td>
      <td>HTTP client-server SPARQL interfaces.</td>
      <td>25</td>
    </tr>
    <tr>
      <td>3.4</td>
      <td>The SPARQL Endpoint interface.</td>
      <td>26</td>
    </tr>
    <tr>
      <td>3.5</td>
      <td>The Triple Pattern Fragments interface.</td>
      <td>26</td>
    </tr>
    <tr>
      <td>3.6</td>
      <td>The execution of a SPARQL query on a virtually integrated non-RDF dataset.</td>
      <td>26</td>
    </tr>
    <tr>
      <td>3.7</td>
      <td>The global architecture of ODMTP.</td>
      <td>27</td>
    </tr>
    <tr>
      <td>3.8</td>
      <td>The components of the ODMTP module.</td>
      <td>28</td>
    </tr>
    <tr>
      <td>3.9</td>
      <td>Super classes and equivalent classes of the <code>dbo:Place</code> class.</td>
      <td>29</td>
    </tr>
    <tr>
      <td>3.10</td>
      <td>The saturated RDF mapping of Figure 3.1 according to the ontology of Figure 3.9.</td>
      <td>29</td>
    </tr>
    <tr>
      <td>3.11</td>
      <td>The reasoner module integrated to ODMTP.</td>
      <td>30</td>
    </tr>
    <tr>
      <td>3.12</td>
      <td>The average execution time to retrieve the last page for each type of triple pattern.</td>
      <td>32</td>
    </tr>
    <tr>
      <td>3.13</td>
      <td>The average execution time to retrieve the last page of a triple triple pattern.</td>
      <td>33</td>
    </tr>
    <tr>
      <td>3.14</td>
      <td>The average time to execute a SPARQL query.</td>
      <td>34</td>
    </tr>
    <tr>
      <td>3.15</td>
      <td>Two other RDF mappings for the Roman emperors dataset.</td>
      <td>35</td>
    </tr>
    <tr>
      <td>3.16</td>
      <td>The global architecture of EvaMap.</td>
      <td>37</td>
    </tr>
    <tr>
      <td>3.17</td>
      <td>The quality score for an RDF mapping returned by EvaMap.</td>
      <td>38</td>
    </tr>
    <tr>
      <td>3.18</td>
      <td>The feedback on the clarity dimension for an RDF mapping returned by EvaMap.</td>
      <td>39</td>
    </tr>
    <tr>
      <td>3.19</td>
      <td>The user interface of KARMA.</td>
      <td>40</td>
    </tr>
  </tbody>
</table>
<table><tr><td>3.20</td><td>The user interface of RMLEditor.</td><td>40</td></tr><tr><td>3.21</td><td>The user interface of Juma.</td><td>41</td></tr><tr><td>3.22</td><td>The global architecture of Semanticbot.</td><td>42</td></tr><tr><td>3.23</td><td>The user interface of SemanticBot.</td><td>44</td></tr><tr><td>3.24</td><td>The workflow to publish non-RDF datasets on the Web of Data.</td><td>45</td></tr><tr><td>4.1</td><td>A set of three RDF Creative Commons licenses with their compatibility and restrictiveness relationships.</td><td>49</td></tr><tr><td>4.2</td><td>Examples of restrictiveness lattices of status (LS).</td><td>54</td></tr><tr><td>4.3</td><td>An example of CaLi ordering.</td><td>57</td></tr><tr><td>4.4</td><td>Compatibility subgraphs of CC_CaLi.</td><td>60</td></tr><tr><td>4.5</td><td>The performance of the CaLi insertion sort algorithm in number of comparisons with incremental size of subsets of licenses.</td><td>62</td></tr><tr><td>4.6</td><td>A graph of the ODRL_CaLi ordering for some licensed RDF datasets.</td><td>65</td></tr><tr><td>4.7</td><td>The search bar of the license-based search engine.</td><td>65</td></tr><tr><td>5.1</td><td>The compatibility graph of licenses for datasets of LargeRDFBench.</td><td>69</td></tr><tr><td>5.2</td><td>A federated license-aware query engine using FLiQue.</td><td>73</td></tr><tr><td>5.3</td><td>Example of SPARQL query Q and some relaxed queries Q'.</td><td>76</td></tr><tr><td>5.4</td><td>Ontology representing courses in a university.</td><td>76</td></tr><tr><td>5.5</td><td>Relaxation lattice of triple pattern tp4 of query Q.</td><td>78</td></tr><tr><td>5.6</td><td>Relaxation sub-graph of Q over F2 with relaxations of tp4.</td><td>81</td></tr><tr><td>5.7</td><td>Average time to get the first result of the 22 queries of LargeRDFBench that can produce a licensable result set without relaxation.</td><td>84</td></tr><tr><td>5.8</td><td>Average time to get the first result of the 10 queries of LargeRDFBench that need relaxation to produce a licensable result set.</td><td>85</td></tr><tr><td>5.9</td><td>Number of generated and executed failing relaxed queries until finding each candidate query.</td><td>86</td></tr></table>
# List of Algorithms

<table><tr><td>1</td><td>The choice of a strategy to insert a new license in a CaLi ordering graph.</td><td>61</td></tr><tr><td>2</td><td>The global approach of FLiQue.</td><td>75</td></tr><tr><td>3</td><td>The insertion of a new license in a CaLi ordering graph starting from the bottom.</td><td>106</td></tr></table>
<figure><img src="image_59.png" /></figure>
List of Tables

<table><tr><td>3.1</td><td>An excerpt from a structured and typed dataset describing Roman emperors.</td><td>23</td></tr><tr><td>3.2</td><td>The eight types of triple patterns.</td><td>31</td></tr><tr><td>3.3</td><td>The set of dimensions used in EvaMap.</td><td>36</td></tr><tr><td>3.4</td><td>The set of metrics used in EvaMap.</td><td>37</td></tr><tr><td>5.1</td><td>Dataset D1 containing courses. D1 has licence CC BY.</td><td>77</td></tr><tr><td>5.2</td><td>Dataset D2 containing teachers and students. D2 has licence CC BY-SA.</td><td>77</td></tr><tr><td>5.3</td><td>Dataset D3 containing students. D3 has licence CC BY-NC.</td><td>77</td></tr><tr><td>5.4</td><td>Statistics of properties in federations F1 and F2.</td><td>80</td></tr><tr><td>5.5</td><td>Statistics of classes in federations F1 and F2.</td><td>80</td></tr><tr><td>5.6</td><td>Capabilities of federations F1 and F2.</td><td>80</td></tr><tr><td>5.7</td><td>Feedback with candidate queries for the user query Q.</td><td>82</td></tr><tr><td>5.8</td><td>The 16 queries of LargeRDFBench whose result set cannot be licensed. DBP (DBpedia), DB (Drug bank), TCGA (Linked TCGA), JA (Jamendo).</td><td>84</td></tr></table>
<figure><img src="image_60.png" /></figure>
List of Listings

<table><tr><td>1</td><td>Two triples about Opendatasoft.</td><td>2</td></tr><tr><td>2</td><td>A SPARQL query that retrieves population of each city where Opendatasoft company is located.</td><td>3</td></tr><tr><td>3</td><td>Two triples about the city of Paris.</td><td>4</td></tr><tr><td>4</td><td>An RDF graph serialized in Turtle that describes five statements about Opendatasoft.</td><td>13</td></tr><tr><td>5</td><td>A SPARQL query that retrieves companies, associated to their city, that are located in the same city as an office of the Opendatasoft company.</td><td>18</td></tr><tr><td>6</td><td>A query that retrieves resources of type dbo:Place.</td><td>29</td></tr><tr><td>7</td><td>A query that retrieves resources of type dbo:Location.</td><td>29</td></tr><tr><td>8</td><td>A SPARQL query Q annotated with the sources for each triple pattern and dataset licenses.</td><td>70</td></tr><tr><td>9</td><td>An RDF graph serialized in JSON-LD.</td><td>93</td></tr><tr><td>10</td><td>An RDF graph serialized in RDF-XML.</td><td>94</td></tr><tr><td>11</td><td>An RDF graph serialized in RDFa.</td><td>94</td></tr><tr><td>12</td><td>An extract of a fragment returned by a Triple Pattern Fragments server.</td><td>95</td></tr><tr><td>13</td><td>An RDF mapping serialized in YARRRML.</td><td>96</td></tr><tr><td>14</td><td>The restrictiveness lattice of status of Figure 4.2c in RDF format.</td><td>97</td></tr><tr><td>15</td><td>The query C10 followed by the candidate query C10'.</td><td>98</td></tr><tr><td>16</td><td>The query C5 followed by the candidate query C5'.</td><td>99</td></tr><tr><td>17</td><td>The query C8 followed by the candidate query C8'.</td><td>100</td></tr><tr><td>18</td><td>The query C9 followed by the candidate query C9'.</td><td>101</td></tr><tr><td>19</td><td>The query L5 followed by the candidate query L5'.</td><td>102</td></tr><tr><td>20</td><td>The query L6 followed by the candidate query L6'.</td><td>103</td></tr><tr><td>21</td><td>The query L7 followed by the candidate query L7'.</td><td>103</td></tr><tr><td>22</td><td>The query L8 followed by the candidate query L8'.</td><td>104</td></tr><tr><td>23</td><td>The query S10 followed by the candidate query S10'.</td><td>104</td></tr><tr><td>24</td><td>The query S8 followed by the candidate query S8'.</td><td>105</td></tr></table>
<figure><img src="image_61.png" /></figure>
Bibliography

[1] K. Alexander, R. Cyganiak, M. Hausenblas, and J. Zhao. "Describing Linked Datasets". In: *Linked Data on the Web (LDOW) collocated with WWWC*. 2009.

[2] T. Berners-Lee, J. Hendler, and O. Lassila. "The Semantic Web". In: *Scientific American* (2001).

[3] A. Bernstein, J. Hendler, and N. Noy. "A New Look at the Semantic Web". In: *Communications of the ACM* (2016).

[4] C. Bizer, T. Heath, and T. Berners-Lee. "Linked Data: The Story so Far". In: *Semantic Services, Interoperability and Web Applications: Emerging Concepts*. 2011.

[5] C. Buil-Aranda, A. Hogan, J. Umbrich, and P.-Y. Vandenbussche. "Sparql Web-Querying Infrastructure: Ready for Action?" In: *International Semantic Web Conference (ISWC)*. 2013.

[6] E. Cabrio, A. P. Aprosio, and S. Villata. "These Are Your Rights". In: *Extended Semantic Web Conference (ESWC)*. 2014.

[7] L. Costabello, S. Villata, and F. Gandon. "Context-Aware Access Control for RDF Graph Stores". In: *European Conference on Artificial Intelligence (ECAI)*. 2012.

[8] *Creative Commons licenses in RDF*. https://github.com/creativecommons/cc.licensepdf.

[9] E. Daga, M. d'Aquin, E. Motta, and A. Gangemi. "A Bottom-up Approach for Licences Classification and Selection". In: *Workshop on Legal Domain and Semantic Web Applications (LeDA-SWAn) collocated with ESWC*. 2015.

[10] B. A. Davey and H. A. Priestley. *Introduction to Lattices and Order*. 2002.

[11] D. E. Denning. "A Lattice Model of Secure Information Flow". In: *Communications of the ACM* (1976).
[12] A. Dimou, D. Kontokostas, M. Freudenberg, R. Verborgh, J. Lehmann, E. Mannens, S. Hellmann, and R. Van de Walle. "Assessing and Refining Mappings to RDF to Improve Dataset Quality". In: *International Semantic Web Conference (ISWC)*. 2015.

[13] A. Dimou, M. Vander Sande, P. Colpaert, R. Verborgh, E. Mannens, and R. Van de Walle. "RML: A Generic Language for Integrated RDF Mappings of Heterogeneous Data". In: *Linked Data on the Web (LDOW) collocated with WWWC*. 2014.

[14] J. D. Fernández, M. A. Martínez-Prieto, C. Gutiérrez, A. Polleres, and M. Arias. "Binary RDF Representation for Publication and Exchange (HDT)". In: *Journal of Web Semantics* (2013).

[15] S. Ferré. "Answers Partitioning and Lazy Joins for Efficient Query Relaxation and Application to Similarity Search". In: *Extended Semantic Web Conference (ESWC)*. 2018.

[16] G. Fokou, S. Jean, A. Hadjali, and M. Baron. "RDF Query Relaxation Strategies Based on Failure Causes". In: *Extended Semantic Web Conference (ESWC)*. 2016.

[17] P. Folz, G. Montoya, H. Skaf-Molli, P. Molli, and M.-E. Vidal. "Semlav: Querying Deep Web and Linked Open Data with SPARQL". In: *Extended Semantic Web Conference (ESWC)*. 2014.

[18] A. Gabillon and L. Letouzey. "A View Based Access Control Model for SPARQL". In: *International Conference on Network and System Security (NSS)*. 2010.

[19] G. Gangadharan, M. Weiss, V. D'Andrea, and R. Iannella. "Service License Composition and Compatibility Analysis". In: *International Conference on Service-Oriented Computing (ICSOC)*. 2007.

[20] B. Glimm, A. Hogan, M. Krötzsch, and A. Polleres. "OWL: Yet to Arrive on the Web of Data?" In: *Linked Data on the Web (LDOW) collocated with WWWC*. 2012.

[21] O. Görlitz and S. Staab. "SPLENDID: SPARQL Endpoint Federation Exploiting VOID Descriptions". In: *Workshop Consuming Linked Data (COLD) collocated with ISWC*. 2011.

[22] O. Görlitz, M. Thimm, and S. Staab. "SPLODGE: Systematic Generation of SPARQL Benchmark Queries for Linked Open Data". In: *International Semantic Web Conference (ISWC)*. 2012.

[23] G. Governatori, A. Rotolo, S. Villata, and F. Gandon. "One License to Compose Them All. A Deontic Logic Approach to Data Licensing on the Web of Data". In: *International Semantic Web Conference (ISWC)*. 2013.
[24] S. Gupta, P. Szekely, C. A. Knoblock, A. Goel, M. Taheriyan, and M. Muslea. "Karma: A System for Mapping Structured Sources Into the Semantic Web". In: *Extended Semantic Web Conference (ESWC), Poster&Demo*. 2012.

[25] F. Hacques, H. Skaf-Molli, P. Molli, and S. E. Hassad. "PFed: Recommending Plausible Federated SPARQL Queries". In: *International Conference on Database and Expert Systems Applications (DEXA)*. 2019.

[26] O. Hartig and C. Buil-Aranda. "Bindings-restricted Triple Pattern Fragments". In: *On the Move to Meaningful Internet Systems Confederated International Conferences (OTM)*. 2016.

[27] G. Havur, S. Steyskal, O. Panasiuk, A. Fensel, V. Mireles, T. Pellegrini, T. Thurner, A. Polleres, and S. Kirrane. "DALICC: A Framework for Publishing and Consuming Data Assets Legally". In: *International Conference on Semantic Systems (SEMANTICS), Poster&Demo*. 2018.

[28] P. Heyvaert, B. De Meester, A. Dimou, and R. Verborgh. "Declarative Rules for Linked Data Generation at Your Fingertips!" In: *Extended Semantic Web Conference (ESWC), Poster&Demo*. 2018.

[29] P. Heyvaert, A. Dimou, A.-L. Herregodts, R. Verborgh, D. Schuurman, E. Mannens, and R. Van de Walle. "RMLEditor: a Graph-Based Mapping Editor for Linked Data Mappings". In: *Extended Semantic Web Conference (ESWC)*. 2016.

[30] A. Hogan, E. Blomqvist, M. Cochez, C. d'Amato, G. de Melo, C. Gutierrez, J. E. L. Gayo, S. Kirrane, S. Neumaier, A. Polleres, et al. "Knowledge Graphs". In: *arXiv Preprint arXiv:2003.02320* (2020).

[31] H. Huang, C. Liu, and X. Zhou. "Approximating Query Answering on RDF Databases". In: *Journal of World Wide Web* (2012).

[32] C. A. Hurtado, A. Poulovassilis, and P. T. Wood. "Query Relaxation in RDF". In: *Journal on Data Semantics X* (2008).

[33] A. C. Junior, C. Debruyne, and D. O'Sullivan. "An Editor that Uses a Block Metaphor for Representing Semantic Mappings in Linked Data". In: *Extended Semantic Web Conference (ESWC), Poster&Demo*. 2018.

[34] G. M. Kapitsaki, F. Kramer, and N. D. Tselikas. "Automating the License Compatibility Process in Open Source Software With SPDX". In: *Journal of Systems and Software* (2017).

[35] Y. Khan, M. Saleem, A. Iqbal, M. Mehdi, A. Hogan, A.-C. N. Ngomo, S. Decker, and R. Sahay. "SAFE: Policy Aware SPARQL Query Federation Over RDF Data Cubes". In: *Semantic Web Applications and Tools for Life Sciences (SWAT4LS)*. 2014.
[36] S. Kirrane, A. Abdelrahman, A. Mileo, and S. Decker. "Secure Manipulation of Linked Data". In: *International Semantic Web Conference (ISWC)*. 2013.

[37] M. Lefrançois, A. Zimmermann, and N. Bakerally. "A SPARQL Extension for Generating RDF from Heterogeneous Formats". In: *Extended Semantic Web Conference (ESWC)*. 2017.

[38] M. Mesiti, P. Perlasca, and S. Valtolina. "On the Composition of Digital Licenses in Collaborative Environments". In: *Conference on Database and Expert Systems Applications (DEXA)*. 2013.

[39] F. Michel, C. Faron-Zucker, and J. Montagnat. "A Mapping-based Method to Query MongoDB Documents with SPARQL". In: *Database and Expert Systems Applications (DEXA)*. 2016.

[40] T. Minier, H. Skaf-Molli, and P. Molli. "SaGe: Web Preemption for Public SPARQL Query Services". In: *The World Wide Web Conference (WWW)*. 2019.

[41] B. Moreau, E. Desmontils, and P. Serrano-Alvarado. "Enrichissement de Données RDF Integrées à la Volée". In: *Atelier Web des Données (AWD) collocated with EGC*. 2019.

[42] B. Moreau and P. Serrano-Alvarado. "Assessing the Quality of RDF Mappings with EvaMap". In: *Extended Semantic Web Conference (ESWC), Poster&Demo*. 2020.

[43] B. Moreau and P. Serrano-Alvarado. "Ensuring License Compliance in Federated Query Processing". In: *Gestion de Données – Principes, Technologies et Applications (BDA)*. 2020.

[44] B. Moreau, P. Serrano-Alvarado, and E. Desmontils. "CaLi: A Lattice-Based Model for License Classifications". In: *Gestion de Données – Principes, Technologies et Applications (BDA)*. 2018.

[45] B. Moreau, P. Serrano-Alvarado, E. Desmontils, and D. Thoumas. "Querying non-RDF Datasets Using Triple Patterns". In: *International Semantic Web Conf (ISWC), Poster&Demo*. 2017.

[46] B. Moreau, P. Serrano-Alvarado, M. Perrin, and E. Desmontils. "A License-Based Search Engine". In: *Extended Semantic Web Conference (ESWC), Poster&Demo*. 2019.

[47] B. Moreau, P. Serrano-Alvarado, M. Perrin, and E. Desmontils. "Modéliser la Compatibilité Entre les Licences". In: *Journées francophones d'Ingénierie des Connaissances (IC)*. 2020.
[48] B. Moreau, P. Serrano-Alvarado, M. Perrin, and E. Desmontils. "Modelling the Compatibility of Licenses". In: *Extended Semantic Web Conference (ESWC)*. 2019.

[49] B. Moreau, N. Terpolilli, and P. Serrano-Alvarado. "A Semi-Automatic Tool for Linked Data Integration". In: *International Semantic Web Conference (ISWC)*, *Poster&Demo*. 2019.

[50] B. Moreau, N. Terpolilli, and P. Serrano-Alvarado. "SemanticBot: Intégration Semi-Automatique de Données au Web des Données". In: *Atelier Web des Données (AWD) collocated with EGC*. 2020.

[51] N. Noy, Y. Gao, A. Jain, A. Narayanan, A. Patterson, and J. Taylor. "Industry-scale Knowledge Graphs: Lessons and Challenges". In: *Queue* (2019).

[52] S. Oulmakhzoune, N. Cuppens-Boulahia, F. Cuppens, S. Morucci, M. Barhamgi, and D. Benslimane. "Privacy Query Rewriting Algorithm Instrumented by a Privacy-Aware Access Control Model". In: *Annals of Telecommunications* (2014).

[53] H. Pérez-Urbina, I. Horrocks, and B. Motik. "Efficient Query Answering for OWL 2". In: *International Semantic Web Conference (ISWC)*. 2009.

[54] B. Quilitz and U. Leser. "Querying Distributed RDF Data Sources with SPARQL". In: *Extended Semantic Web Conference (ESWC)*. 2008.

[55] N. A. Rakhmawati, M. Saleem, S. Lalithsena, and S. Decker. "QFed: Query Set for Federated SPARQL Query Benchmark". In: *International Conference on Information Integration and Web-based Applications & Services (iiWAS)*. 2014.

[56] P. Reddivari, T. Finin, A. Joshi, et al. "Policy-Based Access Control for an RDF Store". In: *Workshop Semantic Web for Collaborative Knowledge Acquisition (SWeCKa) collocated with IJCAI*. 2007.

[57] V. Rodríguez Doncel, A Gómez-Pérez, and S. Villata. "A Dataset of RDF Licenses". In: *Legal Knowledge and Information Systems Conference (ICLKIS)*. 2014.

[58] R. Rosati and A. Almatelli. "Improving Query Answering over DL-Lite Ontologies". In: *Principles of Knowledge Representation and Reasoning (KR)*. 2010.

[59] N. Sadeh, A. Acquisti, T. D. Breaux, L. F. Cranor, and et.al. "Towards Usable Privacy Policies: Semi-Automatically Extracting Data Practices from Websites' Privacy Policies". In: *Symposium on Usable Privacy and Security (SOUPS)*, *Poster&Demo*. 2014.
[60] M. Saleem, A. Hasnain, and A.-C. N. Ngomo. "LargeRDFBench: a Billion Triples Benchmark for Sparql Endpoint Federation". In: *Journal of Semantic Web* (2018).

[61] M. Saleem and A.-C. N. Ngomo. "HIBISCuS: Hypergraph-Based Source Selection For SPARQL Endpoint Federation". In: *Extended Semantic Web Conference (ESWC)*. 2014.

[62] M. Saleem, A. Potocki, T. Soru, O. Hartig, and A. N. Ngomo. "CostFed: Cost-Based Query Optimization for SPARQL Endpoint Federation". In: *International Conference on Semantic Systems (SEMANTICS)*. 2018.

[63] R. S. Sandhu. "Lattice-Based Access Control Models". In: *Computer* (1993).

[64] O. Seneviratne, L. Kagal, and T. Berners-Lee. "Policy-Aware Content Reuse on the Web". In: *International Semantic Web Conference (ISWC)*. 2009.

[65] V. Soto-Mendoza, P. Serrano-Alvarado, E. Desmontils, and J. A. Garcia-Macias. "Policies Composition Based on Data Usage Context". In: *Workshop Consuming Linked Data (COLD) collocated with ISWC*. 2015.

[66] D.-E. Spanos, P. Stavrou, and N. Mitrou. "Bringing Relational Databases Into the Semantic Web: A Survey". In: *Journal of Semantic Web* (2012).

[67] J. Subercaze, C. Gravier, J. Chevalier, and F. Laforest. "Inferray: Fast In-memory RDF Inference". In: *VLDB Endowment* (2016).

[68] P.-Y. Vandenbussche, G. A. Atemezing, M. Poveda-Villalón, and B. Vatant. "Linked Open Vocabularies (LOV): a Gateway to Reusable Semantic Vocabularies on the Web". In: *Semantic Web* (2017).

[69] R. Verborgh, M. Vander Sande, O. Hartig, J. Van Herwegen, L. De Vocht, B. De Meester, G. Haesendonck, and P. Colpaert. "Triple Pattern Fragments: A Low-cost Knowledge Graph Interface for the Web". In: *Journal of Web Semantics* (2016).

[70] S. Villata and F. Gandon. "Licenses Compatibility and Composition in the Web of Data". In: *Workshop Consuming Linked Data (COLD) collocated with ISWC*. 2012.

[71] D. A. Wheeler. *The Free-Libre/Open Source Software (FLOSS) License Slide*. https://www.dwheeler.com/essays/floss-license-slide.pdf. 2007.

[72] A. Zaveri, A. Rula, A. Maurino, R. Pietrobon, J. Lehmann, and S. Auer. "Quality Assessment for Linked Data: a Survey". In: *Journal of Semantic Web* (2016).
<figure><img src="image_62.png" /></figure>
# Facilitating Reuse on the Web of Data

**Keywords** : Web of Data, Linked Data, RDF, SPARQL, licenses, usage control, federated query processing, query relaxation, data integration, RDF mappings

**Abstract:** The Web of Data is a web of interlinked datasets that can be queried and reused through federated query engines. To protect their datasets, data producers use licenses to specify their condition of reuse. But, choosing a compliant license is not easy. Licensing reuse of several licensed datasets must consider compatibility among licenses. To facilitate reuse, federated query engines should preserve license compliance. To do so, we focus on two problems (1) how to compute compatibility relations among licenses, and (2) how to ensure license compliance during federated query processing.

To the first problem, we propose **CaLi**, a model that partially orders any set of licenses in terms of compatibility. To the second problem, we propose **FLiQue**, a license-aware federated query processing strategy. FLiQue uses CaLi to detect license compatibility conflicts and ensures that the result of a federated query preserves license compliance. Within the scope of this thesis, we also propose three approaches **ODMTP**, **EvaMap**, and the **SemanticBot** that aim to facilitate the integration of datasets to the Web of Data.

# Faciliter la Réutilisation sur le Web des Données

**Mots-clés** : Web des données, données liées, RDF, SPARQL, licences, contrôle d'usage, traitement des requêtes fédérées, relâchement de requête, intégration de données, mappings RDF

**Résumé** : Le Web des données est un ensemble de données liées qui peuvent être interrogées et réutilisées à l'aide de moteurs de requêtes fédérées. Pour protéger les jeux de données, les licences renseignent leurs conditions d'utilisation. Cependant, choisir une licence conforme n'est pas toujours aisé. En effet, pour protéger la réutilisation de plusieurs jeux de données, il est nécessaire de prendre en considération la compatibilité entre leurs licences. Pour faciliter la réutilisation, les moteurs de requêtes fédérées devraient respecter les licences. Dans ce contexte, nous nous intéressons à deux problèmes (1) comment calculer la relation de compatibilité entre des licences, et (2)

comment respecter les licences pendant le traitement de requêtes fédérées. Pour le premier problème, nous proposons **CaLi**, un modèle capable d'ordonner partiellement n'importe quel ensemble de licences selon leur compatibilité. Pour le second problème, nous proposons **FLiQue**, un moteur de requête fédéré respectant les licences. FLiQue utilise CaLi pour détecter les conflits de compatibilité entre licences et assure que le résultat d'une requête fédérée respecte les licences. Dans le cadre de cette thèse, nous proposons également trois approches **ODMTP**, **EvaMap** et le **SemanticBot** ayant pour objectif de faciliter l'intégration de données au web des données.