@prefix ns0: . @prefix ns1: . ns1:ekaw2012-paper-research-19-citation-count ns0:isIndicatorOf . ns1:ekaw2012-paper-research-19-plumx-captures ns0:isIndicatorOf . ns1:ekaw2012-paper-research-19-plumx-readers ns0:isIndicatorOf . ns1:ekaw2012-paper-research-19-readers-mendeley ns0:isIndicatorOf . @prefix ns2: . @prefix ns3: . ns3:proceedings ns2:hasPart . @prefix rdf: . @prefix ns5: . rdf:type ns5:ProceedingsPaper , ns2:InProceedings . @prefix ns6: . rdf:type ns6:InformationObject , ns6:Object . @prefix rdfs: . rdf:type rdfs:Resource , ns6:SocialObject . @prefix owl: . rdf:type owl:Thing ; rdfs:label "Keys and Pseudo-Keys Detection for Web Datasets Cleansing and Interlinking" ; owl:sameAs ; ns0:hasIndicator ns1:ekaw2012-paper-research-19-plumx-readers , ns1:ekaw2012-paper-research-19-readers-mendeley , ns1:ekaw2012-paper-research-19-citation-count , ns1:ekaw2012-paper-research-19-plumx-captures . @prefix ns9: . ns9: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." . @prefix dc: . @prefix ns11: . dc:creator ns11:francois-scharffe , ns11:jerome-david , ns11:manuel-atencia ; dc:title "Keys and Pseudo-Keys Detection for Web Datasets Cleansing and Interlinking" . @prefix ns12: . @prefix ns13: . ns12:authorList ns13:authorList . @prefix foaf: . foaf:maker ns11:jerome-david , ns11:francois-scharffe , ns11:manuel-atencia ; ns2: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." ; ns2:doi "10.1007/978-3-642-33876-2_14" ; ns2:hasAuthorList ns13:authorList ; ns2:isPartOf ns3:proceedings ; ns2:title "Keys and Pseudo-Keys Detection for Web Datasets Cleansing and Interlinking" ; ns2:isPublishedIn . ns11:francois-scharffe foaf:made . ns11:jerome-david foaf:made . ns11:manuel-atencia foaf:made .