Abstract
We study computationally efficient methods calculating changes in IFC models that have been converted to RDF graphs. It is shown how to calculate difference sets that are small enough to be descriptive and usable for synchronization while still using limited computing resources. We present an algorithm that utilizes the neighborhood of an anonymous node to find a probable matching node pair in the second version of the model. By limiting the neighborhood only to the most informative paths in the RDF graph, a balance between the certainty of the matching pair and the size of the neighborhood can be found. The algorithm is compared with commonly available RDF diff tools: Jena, and RDFContextTools RDFC14Ner. When compared, our algorithm provided significantly better results.
| Original language | English |
|---|---|
| Pages | 599-608 |
| Number of pages | 10 |
| Publication status | Published - 2015 |
| Event | CIB W78 Conference - Eindhoven University of Technology, Eindhoven, Netherlands Duration: 27 Oct 2015 → 29 Oct 2015 Conference number: 32 http://cib-w78-2015.bwk.tue.nl/ |
Conference
| Conference | CIB W78 Conference |
|---|---|
| Abbreviated title | CIB W78 |
| Country | Netherlands |
| City | Eindhoven |
| Period | 27/10/2015 → 29/10/2015 |
| Internet address |