Ruben Verborgh’s data

Ruben’s data

Query Ruben’s data by triple pattern

Matches in Ruben’s data for { ?s ?p "Evaluating federated Linked Data queries requires consulting multiple sources on the Web. Before a client can execute queries, it must discover data sources, and determine which ones are relevant. Federated query execution research focuses on the actual execution, while data source discovery is often marginally discussed—even though it has a strong impact on selecting sources that contribute to the query results. Therefore, we introduce a discovery approach for Linked Data interfaces based on hypermedia links and controls, and apply it to federated query execution with Triple Pattern Fragments. In addition, we identify quantitative metrics to evaluate this discovery approach. This article describes generic evaluation measures and results for our concrete approach. With low-cost data summaries as seed, interfaces to eight large real-world datasets can discover each other within 7 minutes. Hypermedia-based client-side querying shows a promising gain of up to 50% in execution time, but demands algorithms that visit a higher number of interfaces to improve result completeness. With these findings, we conclude that using hypermedia for interface discovery brings us closer to a queryable global dataspace. However, clients require more intelligent methods to effectively consume such space."@en }

Showing triples 1 to 1 of 1 with 100 triples per page.