Defining key semantics for the RDF datasets: experiments and evaluations
Graph-Based Representation and Reasoning: 21st International Conference on …, 2014•Springer
Many techniques were recently proposed to automate the linkage of RDF datasets.
Predicate selection is the step of the linkage process that consists in selecting the smallest
set of relevant predicates needed to enable instance comparison. We call keys this set of
predicates that is analogous to the notion of keys in relational databases. We explain
formally the different assumptions behind two existing key semantics. We then evaluate
experimentally the keys by studying how discovered keys could help dataset interlinking or …
Predicate selection is the step of the linkage process that consists in selecting the smallest
set of relevant predicates needed to enable instance comparison. We call keys this set of
predicates that is analogous to the notion of keys in relational databases. We explain
formally the different assumptions behind two existing key semantics. We then evaluate
experimentally the keys by studying how discovered keys could help dataset interlinking or …
Abstract
Many techniques were recently proposed to automate the linkage of RDF datasets. Predicate selection is the step of the linkage process that consists in selecting the smallest set of relevant predicates needed to enable instance comparison. We call keys this set of predicates that is analogous to the notion of keys in relational databases. We explain formally the different assumptions behind two existing key semantics. We then evaluate experimentally the keys by studying how discovered keys could help dataset interlinking or cleaning. We discuss the experimental results and show that the two different semantics lead to comparable results on the studied datasets.
Springer
Showing the best result for this search. See all results