Defining key semantics for the RDF datasets: Experiments and evaluations

Citations of this article
Mendeley users who have this article in their library.

You may have access to this PDF.


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. © 2014 Springer International Publishing.




Atencia, M., Chein, M., Croitoru, M., David, J., Leclère, M., Pernelle, N., … Symeonidou, D. (2014). Defining key semantics for the RDF datasets: Experiments and evaluations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8577 LNAI, pp. 65–78). Springer Verlag.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free