Consistent RDF Updates with Correct Dense Deltas

Abstract

Abstract. RDF is widely used in the Semantic Web for representing ontology data. Many real world RDF collections are large and contain complex graph relationships that represent knowledge in a particular domain. Such large RDF collections evolve in consequence of their representation of the changing world. Although this data may be distributed over the Internet, it needs to be managed and updated in the face of such evolutionary changes. In view of the size of typical collections, it is important to derive efficient ways of propagating updates to distributed data stores. The contribution of this paper is a detailed analysis of the performance of RDF change detection techniques. In addition the work describes a new approach to maintaining the consistency of RDF by using knowledge embedded in the structure to generate efficient update transactions. The evaluation of this approach indicates that it reduces the overall update size at the cost of increasing the processing time needed to generate the transactions. . . .

Updating OWL2 ontologies using pruned rulesets

“…The dense delta is non-deterministic as a result of inter-effects between insertion and deletion. This problem is overcome by the corrected dense delta (Dc) [1]. DEFINITION 4 (CORRECTED DENSE delta).…”