Name
Abstract | ||
|---|---|---|
In the Linked Data field, data publishers frequently materialize linksets between two different datasets using link discovery tools. To create a linkset, such tools typically execute linkage rules that retrieve data from the underlying datasets and apply matching predicates to create the links, in an often complex process. Also, such tools do not support linkset maintenance, when the datasets are updated. A simple, but costly strategy to maintain linksets up-to-date would be to fully re-materialize them from time to time. This paper presents an alternative strategy, called incremental, for maintaining linksets, based on idea that one should re-compute only the links that involve the updated resources. The paper discusses in detail the incremental strategy, outlines an implementation and describes an experiment to compare the performance of the incremental strategy with the full re-materialization of linksets. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-44406-2_7 | DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2016, PT II |
Keywords | Field | DocType |
RDF views, Linksets, SPARQL update, Linked data | Data mining,Incremental strategy,Computer science,Incremental maintenance,Linked data,SPARQL | Conference |
Volume | ISSN | Citations |
9828 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 9 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elisa Menendez | 1 | 1 | 0.69 |
| Marco A. Casanova | 2 | 1007 | 979.09 |
| Vânia Maria Ponte Vidal | 3 | 94 | 37.28 |
| Bernardo Pereira Nunes | 4 | 185 | 30.96 |
| Giseli Rabello Lopes | 5 | 107 | 16.44 |
| Luiz André P. Paes Leme | 6 | 90 | 13.81 |