Generating Linked Data based on existing data sources requires the modeling of their information structure. This modeling needs the identification of potential entities, their attributes and the relationships between them and among entities. For databases this identification is not required, because a data schema is always available. However, for other data formats, such as hierarchical data, this is not always the case. Therefore, analysis of the data is required to support RDF term and data type identification. We introduce a tool that performs such an analysis on hierarchical data. It implements the algorithms, Daro and S-Daro, proposed in this paper. Based on our evaluation, we conclude that SDaro offers a more scalable solution regarding run time, with respect to the dataset size, and provides more complete results.
CITATION STYLE
Heyvaert, P., Dimou, A., Verborgh, R., & Mannens, E. (2016). Data analysis of hierarchical data for RDF term identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10055 LNCS, pp. 204–212). Springer Verlag. https://doi.org/10.1007/978-3-319-50112-3_15
Mendeley helps you to discover research relevant for your work.