A Heuristic Approach for Checking Containment of Generalized Tree-Pattern Queries

as discussed in Section 3.2, this test suite contains conjunctive queries with no projection (denoted as nop followed by case number , shown in Table 3) is designed for containment

The tree containment problem Network N displays tree T if we can obtain a subdivision of T by removing incoming edges from reticulations and “dummy leaves”.... The tree

Rule N EW handles the case of ν. Rule P AR combines the resources of several parts of the process. If one argument provides the resources requested by the other, then the trade

Trebuie gasit nodul x din care s-a determinat maximul, apoi trebuie determinat cum s-a calculat valoarea A sau B din care a rezultat maximul (si drumul se reconstituie in mod

It is an open question whether using arbitrary intervals in shape graphs has an impact on the complexity of testing containment; interest- ingly the answer to this question is

For NDL-rewritings, we show that polynomial-size rewritings always exist for tree-shaped queries with a bounded number of leaves (and arbitrary TBoxes), and for bounded

Representation of an ontology with multiple geometrical views can help the user to better understand the ontology, because different geometries empha- size the graph

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