Keys and pseudo-keys detection for web datasets cleansing and interlinking

35Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper introduces a method for analyzing web datasets based on key dependencies. The classical notion of a key in relational databases is adapted to RDF datasets. In order to better deal with web data of variable quality, the definition of a pseudo-key is presented. An RDF vocabulary for representing keys is also provided. An algorithm to discover keys and pseudo-keys is described. Experimental results show that even for a big dataset such as DBpedia, the runtime of the algorithm is still reasonable. Two applications are further discussed: (i) detection of errors in RDF datasets, and (ii) datasets interlinking. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Atencia, M., David, J., & Scharffe, F. (2012). Keys and pseudo-keys detection for web datasets cleansing and interlinking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7603 LNAI, pp. 144–153). https://doi.org/10.1007/978-3-642-33876-2_14

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