Sciweavers

Share
ICDT
2007
ACM

Containment of Conjunctive Queries over Databases with Null Values

12 years 5 months ago
Containment of Conjunctive Queries over Databases with Null Values
Abstract. We study containment of conjunctive queries that are evaluated over databases that may contain tuples with null values. We assume the semantics of SQL for single block queries with a SELECT DISTINCT clause. This problem (“null containment” for short) is different from containment over databases without null values and sometimes more difficult. We show that null-containment for boolean conjunctive queries is NPcomplete while it is ΠP 2 -complete for queries with distinguished variables. However, if no relation symbol is allowed to appear more than twice, then null-containment is polynomial, as it is for databases without nulls. If we add a unary test predicate IS NULL, as it is available in SQL, then containment becomes ΠP 2 -hard for boolean queries, while it remains in ΠP 2 for arbitrary queries.
Carles Farré, Werner Nutt, Ernest Teniente,
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICDT
Authors Carles Farré, Werner Nutt, Ernest Teniente, Toni Urpí
Comments (0)
books