The authors introduce a theory of finite tables by extending a theory of bags with support for product, filter, and map operators. They also extend a theory of finite relations with map, filter, and inner join operators. Additionally, they introduce a theory of nullable sorts as an extension of a theory of algebraic datatypes. These new theories enable the encoding in SMT of a large fragment of SQL under either multiset or set semantics and the automated analysis of problems such as query equivalence.
The authors implemented these new theories in the cvc5 SMT solver and evaluated them on a set of benchmarks derived from public sets of SQL equivalence problems. Their solution has two main advantages over previous work: (1) it is not limited to SQL equivalence problems, and (2) it comes fully integrated in a state-of-the-art SMT solver with a rich set of background theories. This opens up the door to other kinds of SQL query analyses, such as query containment and query emptiness problems, over a large set of types for query columns.
다른 언어로
소스 콘텐츠 기반
arxiv.org
더 깊은 질문