Keys and Pseudo-Keys Detection for Web Datasets Cleansing and Interlinking

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.

Domaines

Autre [cs.OH]

Fichier principal

atencia2012b.pdf (210.86 Ko)

Origine	Fichiers produits par l'(les) auteur(s)
Licence	Autorisation HAL

Connectez-vous pour contacter le contributeur

https://inria.hal.science/hal-00768412

Soumis le : vendredi 21 décembre 2012-14:33:37

Dernière modification le : samedi 27 septembre 2025-19:29:10

Archivage à long terme le : dimanche 18 décembre 2016-08:34:13

Dates et versions

hal-00768412 , version 1 (21-12-2012)

Licence

Autorisation HAL

Identifiants

HAL Id : hal-00768412 , version 1
DOI : 10.1007/978-3-642-33876-2_14

Citer

Manuel Atencia, Jérôme David, François Scharffe. Keys and Pseudo-Keys Detection for Web Datasets Cleansing and Interlinking. EKAW: Knowledge Engineering and Knowledge Management, Oct 2012, Galway, Ireland. pp.144-153, ⟨10.1007/978-3-642-33876-2_14⟩. ⟨hal-00768412⟩