How Can We Shrink the Family of Test Databases? Query Containment with Nulls and Comparisons

2026-09-14

AI Summary

研究解决了数据库查询中包含问题的测试数据库集缩减问题，通过针对空值和比较构建特定方法，将测试数据库数量减少到可管理的数量。

Abstract

Query containment and equivalence drive database query optimization and rewriting. For plain conjunctive queries, both are decided by evaluating one query over a single canonical database of the other. This classical test breaks down in two settings that pervade real queries: databases with null values under SQL's three-valued semantics, and queries with order comparisons. In both, deciding containment is $Π_2^p$-complete, and the known characterizations replace it by an exponential family of test databases, leaving no practical route to certifying equivalence. We ask how the family of test databases can be shrunk. For conjunctive queries over databases with nulls, we shrink the family to one that is exponential only in a special set of variables, and place containment in NP when that set has constant size. For queries with comparisons, we construct canonical values that decide containment, and then shrink the family by decomposing the test into independent components and by splitting it along the order conflicts. Finally, we combine the two features, and prove that the number of test databases is fixed-parameter tractable in three local parameters of the two queries, with the null-only and comparison-only tests as special cases. Each test evaluates the containing query over a family of databases, an operation native to any database system.

Problem

• query containment
• null values
• comparisons
• test databases

Innovation

• conjunctive queries
• null values
• comparisons
• test databases reduction
• fixed-parameter tractable