• Aucun résultat trouvé

SaGe: Web Preemption for Public SPARQL Query Services

N/A
N/A
Protected

Academic year: 2021

Partager "SaGe: Web Preemption for Public SPARQL Query Services"

Copied!
12
0
0

Texte intégral

Figure

Figure 3: Possible states of a query execution in a preemptive Web Server.
Figure 4: A tree representation of a page returned by the SaGe server when executing SPARQL query Q 2 with the saved plan passed by value.
Table 1: Complexities of preemption of physical query iter- iter-ators. |id| and |tp| denote the size of encoding an index key and a triple pattern, respectively.
Figure 6: Distribution of query execution time.
+2

Références

Documents relatifs

In order to illustrate our language of abstract queries, and show its expressive power, we show below the table query T for the complex use case (C) of Section 2. ) T 0 is the

When a number is to be multiplied by itself repeatedly,  the result is a power    of this number.

Concretely, a SimplePARQL query is transformed into N valid SPARQL queries that extend the initial query in order to reach the IRIs or literals in the RDF bases cor- responding

SQCFrame- work is able to generate customized SPARQL containment benchmarks from real SPARQL query logs.. To this end, the framework makes use of different

For in- stance, the configuration (2, 1, {{OPTIONAL, FILTER}, {UNION}}, 10) makes QED construct a test suite containing 10 test cases with queries that contain both OPTIONAL and

Research Challenge: How should academics and system designers model and optimise search performance based on information needs and not a single query.. Method

Searching information on the Web of Data requires user friendly approaches, similar to the ease of keyword-based search engines, but relying on the RDF. In this

Throughout this paper, we shall use the following notations: N denotes the set of the positive integers, π( x ) denotes the number of the prime numbers not exceeding x, and p i