A query over RDF data is usually expressed in terms of matching between a graph representing the target and a huge graph representing the source. Unfortunately, graph matching is typically performed in terms of subgraph isomorphism, which makes semantic data querying a hard problem. In this paper we illustrate a novel technique for querying RDF data in which the answers are built by combining paths of the underlying data graph that align with paths specified by the query. The approach is approximate and generates the combinations of the paths that best align with the query. We show that, in this way, the complexity of the overall process is significantly reduced and verify experimentally that our framework exhibits an excellent behavior with respect to other approaches in terms of both efficiency and effectiveness.
|Titolo:||Approximate Querying of RDF Graphs via Path Alignment|
|Autori interni:||MACCIONI, ANTONIO|
DE VIRGILIO, ROBERTO
|Data di pubblicazione:||2014|
|Rivista:||DISTRIBUTED AND PARALLEL DATABASES|
|Appare nelle tipologie:||1.1 Articolo in rivista|