An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Communications of the ACM
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Ontology Versioning and Change Detection on the Web
EKAW '02 Proceedings of the 13th International Conference on Knowledge Engineering and Knowledge Management. Ontologies and the Semantic Web
Promptdiff: a fixed-point algorithm for comparing ontology versions
Eighteenth national conference on Artificial intelligence
Simple and Efficient Minimal RDFS
Web Semantics: Science, Services and Agents on the World Wide Web
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
RDFSync: efficient remote synchronization of RDF models
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
On the foundations of computing deltas between RDF models
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
On Computing Deltas of RDF/S Knowledge Bases
ACM Transactions on the Web (TWEB)
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Leveraging terminological structure for object reconciliation
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Replication and versioning of partial RDF graphs
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Hi-index | 0.00 |
In RDF, a blank node (or anonymous resource or bnode) is a node in an RDF graph which is not identified by a URI and is not a literal. Several RDF/S Knowledge Bases (KBs) rely heavily on blank nodes as they are convenient for representing complex attributes or resources whose identity is unknown but their attributes (either literals or associations with other resources) are known. In this paper we show how we can exploit blank nodes anonymity in order to reduce the delta (diff) size when comparing such KBs. The main idea of the proposed method is to build a mapping between the bnodes of the compared KBs for reducing the delta size. We prove that finding the optimal mapping is NP-Hard in the general case, and polynomial in case there are not directly connected bnodes. Subsequently we present various polynomial algorithms returning approximate solutions for the general case. For making the application of our method feasible also to large KBs we present a signature-based mapping algorithm with n logn complexity. Finally, we report experimental results over real and synthetic datasets that demonstrate significant reductions in the sizes of the computed deltas. For the proposed algorithms we also provide comparative results regarding delta reduction, equivalence detection and time efficiency.