Provided by:
Academy & Industry Research Collaboration Center
Topic:
Big Data
Format:
PDF
In this paper, the authors propose a method of identifying and aggregating literal nodes that have the same meaning in Linked Open Data (LOD) in order to facilitate cross-domain search. LOD has a graph structure in which most nodes are represented by Uniform Resource Identifiers (URIs), and thus LOD sets are connected and searched through different domains. However, 5% of the values are literal values (strings without URI) even in a de facto hub of LOD, DBpedia. In SPARQL Protocol and RDF Query Language (SPARQL) queries, they need to rely on regular expression to match and trace the literal nodes.
