Ruben Verborgh’s data

Matches in Ruben’s data for { ?s ?p "Querying the Linked Open Data cloud as a whole still remains problematic. Prior knowledge is required to federate the queries to the appropriate datasets: each dataset provides its own SPARQL endpoint to query that dataset, and each dataset uses its own vocabulary to describe their information. In this paper, we propose a federated and asynchronous SPARQL framework to query the global data space. Our query federation is based on the fact that owl:sameAs relationships are symmetrical and transitive and, hence, that such linked resources are interchangeable. The provenance of the generated owl:sameAs links during the enrichment process is processed to resolve the SPARQL endpoints of linked datasets and their vocabulary mappings. This information is used during the query federation. Asynchronous SPARQL processing makes the query federation more scalable and exploits better Web caching."@en }

• publication abstract "Querying the Linked Open Data cloud as a whole still remains problematic. Prior knowledge is required to federate the queries to the appropriate datasets: each dataset provides its own SPARQL endpoint to query that dataset, and each dataset uses its own vocabulary to describe their information. In this paper, we propose a federated and asynchronous SPARQL framework to query the global data space. Our query federation is based on the fact that owl:sameAs relationships are symmetrical and transitive and, hence, that such linked resources are interchangeable. The provenance of the generated owl:sameAs links during the enrichment process is processed to resolve the SPARQL endpoints of linked datasets and their vocabulary mappings. This information is used during the query federation. Asynchronous SPARQL processing makes the query federation more scalable and exploits better Web caching.".