First, we show how to express subset constraints and attribute domain and range definitions in a simple DL dialect, and how to reduce the query containment and ...

This paper explores reductions of query containment and other problems to the subsumption problem in DL. It first selects a DL dialect that is expressive enough ...

In this paper we address the problem of efficiently evaluating con- tainment (i.e., subset, equality, and superset) queries over set-valued data. We propose a ...

Efficient Decision Procedures for Query Containment and Related Problems. 1-15. view. electronic edition @ ufmg.br (archived) · no references & citations ...

In this paper we address the problem of efficiently evaluating containment. (i.e., subset, equality, and superset) queries over set-valued data. We pro-.

First, we provide optimal bounds for relative containment for several important classes of datalog queries, including the common case of conjunctive queries.

XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries.

May 19, 2006 · We provide a complexity analysis together with practical experiments that illustrate the efficiency of the decision procedure for realistic ...

We consider the containment problem for regular queries with memory and regular queries with data tests: two recently proposed query languages for graph ...

In this paper we address the problem of efficiently evaluating con- tainment (i.e., subset, equality, and superset) queries over set-valued data. We propose a ...