A Heuristic-Based Approach for Planning Federated SPARQL Queries

Polystores. More recently, the research focus shifted towards query processing against heterogeneous data sources. Differ- ent approaches have been proposed on how to store,

Since the new query functionality offered by SPARQL-LD (allowing to query any HTTP resource containing RDF data) can lead to queries with large num- ber of service patterns which

3 Queries from the British Museum have been completely filtered out, since it was not recorded if they returned a result. Furthermore, all requests from the dataset were made by

Queries marked as improved have a lower execution time (ET ) with FedX ` Fedra ` PeNeLoop than with FedX ` Fedra. iii) Number of Transferred Tuples (NTT): is the number of

Abstract. In this article we propose a probabilistic framework in order to study the fair division of a divisible good, e.g. Our framework follows the same idea than the

In Section 8.3, we present how we designed our system around a scalable infrastructure for supporting the mass of worldwide gtfs information, how we leverage various data sources

Statistics computation: As DBpedia has a very high number of CSs (160,061), we reduced them to 10,000 by merging (as suggested in [8,12] and explained in Section 3.3)

So, depending on your triple store software, using a federated query that requests the protected triple store using its local location can result in an unchecked access through