SAKey: Scalable Almost Key Discovery in RDF Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

SAKey: Scalable Almost Key Discovery in RDF Data


Exploiting identity links among RDF resources allows applications to efficiently integrate data. Keys can be very useful to discover these identity links. A set of properties is considered as a key when its values uniquely identify resources. However, these keys are usually not available. The approaches that attempt to automatically discover keys can easily be overwhelmed by the size of the data and require clean data. We present SAKey, an approach that discovers keys in RDF data in an efficient way. To prune the search space, SAKey exploits characteristics of the data that are dynamically detected during the process. Furthermore , our approach can discover keys in datasets where erroneous data or duplicates exist (i.e., almost keys). The approach has been evaluated on different synthetic and real datasets. The results show both the relevance of almost keys and the efficiency of discovering them.
Fichier principal
Vignette du fichier
ISWC2014.pdf (972.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01275954 , version 1 (18-02-2016)



Danai Symeonidou, Vincent Armant, Nathalie Pernelle, Fatiha Saïs. SAKey: Scalable Almost Key Discovery in RDF Data. In proceedings of the 13th International Semantic Web Conference, ISWC 2014, Oct 2014, Riva del Garda, Italy. pp.33--49, ⟨10.1007/978-3-319-11964-9_3⟩. ⟨hal-01275954⟩
446 View
223 Download



Gmail Facebook Twitter LinkedIn More