The Query Containment Problem: Set Semantics vs. Bag Semantics

Considering that the Government of the Republic of South Africa, in spite of its long association with the World Health Organization, accepts and practises the policy of

In particular if a norm is computable in polynomial time then its set of relevant points has Hausdorff dimension 0 (Theorem 3.4 ), almost every point has a polynomial

Similarly, under the (polynomially verifiable) assumption that the input graph has a perfect matching, the exact perfect matching problem is precisely the exact weighted

Abstract: SPARQL query containment under schema axioms is the problem of determining whether, for any RDF graph satisfying a given set of schema axioms, the answers to a query

The intro- ductory experiments shows, that the nearly clones in dataset have an interesting structure, which needs to be investigated more deeply. This paper was introduc- tory for

Since our purpose here is to study agent migration in the presence of a structure of environments and stores, we will enrich this paradigm with the possibility of associating

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

This philosophy can be considered as equivalent to the generalization of the theta-join operator of the relational model [24] (with theta equals to a spatial operator). The