Detect redundant RDF data by rules

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The development and standardization of semantic web technologies have resulted in an unprecedented volume of RDF datasets being published on the Web. However, data quality exists in most of the information systems, and the RDF data is no exception. The quality of RDF data has become a hot spot of Web research and many data quality dimensions and metrics have been proposed. In this paper, we focus on the redundant problem in RDF data, and propose a rule based method to find and delete the semantic redundant triples. By evaluating the existing datasets, we prove that our method can remove the redundant triples to help data publisher provide more concise RDF data.

Cite

CITATION STYLE

APA

Guang, T., Gu, J., & Huang, L. (2016). Detect redundant RDF data by rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9645, pp. 362–368). Springer Verlag. https://doi.org/10.1007/978-3-319-32055-7_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free