• Aucun résultat trouvé

Federated SPARQL Queries Processing

Federated SPARQL Queries Processing with Replicated Fragments

Federated SPARQL Queries Processing with Replicated Fragments

... performs federated queries on A1 (DBpedia) and A2 ...the queries, a data consumer endpoint C1 with replicated fragments has been installed as in Figure ...CONSTRUCT SPARQL queries with ...

17

Parallelizing Federated SPARQL Queries in Presence of Replicated Data

Parallelizing Federated SPARQL Queries in Presence of Replicated Data

... Abstract. Federated query engines have been enhanced to exploit new data localities created by replicated data, ...aware federated query engines mainly focus on pruning sources during the source selection ...

17

PeNeLoop: Parallelizing Federated SPARQL Queries in Presence of Replicated Fragments

PeNeLoop: Parallelizing Federated SPARQL Queries in Presence of Replicated Fragments

... join processing in presence of replicated ...of queries in presence of replicated fragments and shows to be more efficient on larger ...for queries with a large number of intermediate results, and ...

15

RDF Modelling and SPARQL Processing of SQL Abstract Syntax Trees

RDF Modelling and SPARQL Processing of SQL Abstract Syntax Trees

... data federated into organisations’ data warehouses are usually analyzed through a variety of dynamic documents authored with business intelligence (BI) ...or queries for reuse, but they depend on ...

9

Efficient Query Processing for SPARQL Federations with Replicated Fragments

Efficient Query Processing for SPARQL Federations with Replicated Fragments

... restricted SPARQL query by downloading fragments required to execute the query from an LDF server through a simple HTTP ...query processing to clients, at the cost of slower query execution ...process ...

16

Collaborative SPARQL Query Processing for Decentralized Semantic Data

Collaborative SPARQL Query Processing for Decentralized Semantic Data

... Management, SPARQL query processing, sources discovery 1 Introduction Decentralization is a common way to give users back control over their digital ...decentralized SPARQL queries over ...

16

Fedra: Query Processing for SPARQL Federations with Divergence

Fedra: Query Processing for SPARQL Federations with Divergence

... existing federated query engines do not exploit such opportu- ...public SPARQL endpoint of ...Performing queries in presence of divergent data leads to stale answers ...

17

SPARQL distributed query processing over linked data

SPARQL distributed query processing over linked data

... our federated query processing approach within the Corese semantic Web ...query processing efficiency, result completeness and data replication ...query processing time and the number of ...

130

Decomposing federated queries in presence of replicated fragments

Decomposing federated queries in presence of replicated fragments

... Abstract Federated query engines allow for linked data consumption using SPARQL ...efficient federated query processing. However, existing federated query engines are not designed to ...

24

Decomposing Federated Queries in presence of Replicated Fragments

Decomposing Federated Queries in presence of Replicated Fragments

... Abstract Federated query engines allow for linked data consumption using SPARQL ...efficient federated query processing. However, existing federated query engines are not designed to ...

24

Answering SPARQL Queries using Views

Answering SPARQL Queries using Views

... the SPARQL endpoints poor availability, several strategies may be ...query processing, this strategy decreases the query performance in terms of number of answers produced by time unit, and amount of ...

137

PFed: Recommending Plausible Federated Queries

PFed: Recommending Plausible Federated Queries

... Abstract. Federated SPARQL query processing allows to query multi- ple interlinked datasets hosted by remote SPARQL ...pertinent federated queries over a growing number of ...

16

Distributed Processing of Continous Join Queries using DHT Networks

Distributed Processing of Continous Join Queries using DHT Networks

... for processing continuous join queries using ...of queries using the trees formed by the underlying DHT ...of queries to avoid the in- dexing of tuples that cannot contribute to generate join ...

9

PFed: Recommending Plausible Federated SPARQL Queries

PFed: Recommending Plausible Federated SPARQL Queries

... Other SPARQL operators such as FILTER, OPTIONAL are not ...large SPARQL query logs [6] shows that 74.83% of studied queries have JOIN, FILTER and OPTIONAL and only ...(conjunctive queries). ...

16

DHTJoin: Processing Continuous Join Queries Using DHT Networks

DHTJoin: Processing Continuous Join Queries Using DHT Networks

... query processing in data stream management systems (DSMS) has received considerable attention ...for processing data streams in a continuous ...centralized processing of continuous queries ...

30

An Efficient Mechanism for Processing Top-k Queries in DHTs

An Efficient Mechanism for Processing Top-k Queries in DHTs

... complex queries is top- k ...Top-k queries have attracted much interest in many different areas such as network and system monitoring [2][21][9], information retrieval [22][6][30][25], multimedia databases ...

15

How to execute SPARQL property path queries online and get complete results?

How to execute SPARQL property path queries online and get complete results?

... Abstract. SPARQL property path queries provide a concise way to write complex navigational queries over RDF knowledge ...these queries over online knowledge graphs such as DBPedia or Wikidata ...

17

Query Processing for SPARQL Federations with Data Replication

Query Processing for SPARQL Federations with Data Replication

... local SPARQL endpoints improve scalability and availability of public SPARQL endpoints, mak- ing the consumption of Linked Data a ...query processing strategies to take advantage of ...of ...

16

Processing continuous join queries in qtructured P2P systems

Processing continuous join queries in qtructured P2P systems

... Random Walks. In Random Walks [LCC + 02], for each query, the query originator forwards k query messages to k of its randomly chosen neighbors. Each of these messages follows its own path, having intermediate peers ...

119

Efficient Processing of Continuous Join Queries using Distributed Hash Tables

Efficient Processing of Continuous Join Queries using Distributed Hash Tables

... We generate arbitrary input data streams consisting of synthetic asynchronous data items with no tuple-level semantics. We have a schema of 4 relations, each one with 10 attributes. In order to create a new tuple we ...

11

Show all 1633 documents...

Sujets connexes