The cost of reasoning with RDF updates

Sana Al Azwari, John N. Wilson

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

2 Citations (Scopus)
121 Downloads (Pure)


Many real world RDF collections are large compared with other real world data structures. Such large RDF collections evolve in a distributed environment.
Therefore, these changes between RDF versions need to be detected and computed in order to synchronize these changes to the other users. To cope with the evolving nature of the semantic web, it is important to understand the costs and benefits of the different change detection techniques. In this paper, we experimentally provide a detailed analysis of the overall process of RDF change detection techniques namely: explicit change detection, forward-inference change detection, backward-inference change detection and backward-inference and pruning change detection. The results show that pruning is relatively expensive by comparison with inferencing.
Original languageEnglish
Title of host publicationProceedings of the 9th IEEE International Conference on Semantic Computing (IEEE ICSC 2015)
Place of PublicationPiscataway, New Jersey, United States
Number of pages4
ISBN (Print)9781479979356
Publication statusPublished - 6 Feb 2015


  • Resource Description Framework (RDF)
  • reasoning
  • RDF data model
  • inference methods
  • distributed systems
  • RDF graphs


Dive into the research topics of 'The cost of reasoning with RDF updates'. Together they form a unique fingerprint.

Cite this