Abstract

The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting queries using views. In the data-integration framework, however, the standard notion of query containment does not suffice. We define relative containment, which formalizes the notion of query containment relative to the sources available to the data-integration system. First, we provide optimal bounds for relative containment for several important classes of datalog queries, including the common case of conjunctive queries. Next, we provide bounds for the case when sources enforce access restrictions in the form of binding pattern constraints. Surprisingly, we show that relative containment for conjunctive queries is still decidable in this case, even though it is known that finding all answers to such queries may require a recursive datalog program over the sources. Finally, we provide tight bounds for variants of relative containment when the queries and source descriptions may contain comparison predicates.

Author Keywords: Query containment; Data integration; Query rewriting; Views; Datalog; Binding patterns

Article Outline

1. Introduction

2. Preliminaries

2.1. Queries

2.2. Query containment

2.3. Mediated schemas and source descriptions

2.4. Certain answers

2.5. Relative containment

2.6. Complexity measure

3. Complexity of relative containment

3.1. Upper bounds

3.2. Lower bounds

4. Binding pattern limitations

4.1. Problem definition

4.2. Decidability

5. Comparison predicates

6. Conclusions and open problems

References