Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33876-2_14 | EKAW |
Keywords | Field | DocType |
key dependency,datasets interlinking,web data,better deal,pseudo-keys detection,relational databases,rdf datasets,classical notion,rdf vocabulary,variable quality | Ontology alignment,Data mining,Data linking,Information retrieval,Relational database,Computer science,Vocabulary,RDF | Conference |
Citations | PageRank | References |
14 | 0.82 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Atencia | 1 | 88 | 10.79 |
| Jérôme David | 2 | 220 | 18.27 |
| François Scharffe | 3 | 397 | 29.89 |