A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
SAKey: Scalable Almost Key Discovery in RDF Data
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
We present SAKey, an approach that discovers keys in RDF data in an efficient way. ...
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. ...
Scalability of SAKey SAKey has been executed in every class of DBpedia. ...
doi:10.1007/978-3-319-11964-9_3
fatcat:yo3xs54ewjafzksotuczs6upui
ROCKER
2015
Proceedings of the 24th International Conference on World Wide Web - WWW '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1705.04380v1 fatcat:y4zc4p42lred3lhj2r6kgfyeuy
The Linked Data principles provide a decentral approach for publishing structured data in the RDF format on the Web. ...
Still, finding keys is of central importance for manifold applications such as resource deduplication, link discovery, logical data compression and data integration. ...
While Linkkey is a tool able to retrieve keys, SAKey is more scalable and able to retrieve also k-almost keys (see Section 4.2). ...
doi:10.1145/2736277.2741642
dblp:conf/www/SoruMN15
fatcat:u4e3dlb46vbkrk4dyuqbqr6qcm
Automatic Key Selection for Data Linking
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Finally, in [7] , a key discovery approach for numerical data is proposed. Atencia et al. ...
Bridging the gap between key discovery and data linking approaches is critical in order to obtain successful data linking results. ...
doi:10.1007/978-3-319-49004-5_1
fatcat:kseqvj5bpbdzjkx7mdniwr7shi
Vickey: Mining Conditional Keys On Knowledge Bases
2017
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A conditional key is a key constraint that is valid in only a part of the data. In this paper, we show how such keys can be mined automatically on large knowledge bases (KBs). ...
We also show that the conditional keys we mine can improve the quality of entity linking by up to 47 percentage points. ...
Scalable Almost Key discovery ...
doi:10.5281/zenodo.835646
fatcat:nzxu6f4rhjahpflceziqsijbym