The query containment problem is a fundamental computer science problem which was originally defined for relational queries. With the growing popularity of the sparql query language, it became relevant and important in this new context: reliable and efficient sparql query containment solvers may have various applications within static analysis of queries, especially in the area of query optimizations and refactoring. In this paper, we present a new approach for solving the query containment problem in sparql. The approach is based on reducing the query containment problem to the satisfiability problem in first order logic. It covers a wide range of the sparql language constructs, including union of conjunctive queries, blank nodes, projections, subqueries, clauses from, filter, optional, graph, etc. It also covers containment under rdf schema entailment regime, and it can deal with the subsumption relation. We describe an implementation of the approach, an open source solver SpeCS and its thorough experimental evaluation on two relevant benchmarks, Query Containment Benchmark and SQCFramework. As a side result, SpeCS identified incorrect test cases within both benchmarks, which were manually checked, confirmed and fixed, resulting in better and more reliable benchmarks. The evaluation also shows that SpeCS is highly efficient and that compared to the state-of-the-art solvers, it gives more precise results in a shorter amount of time. In addition, SpeCS has the highest coverage of the supported language constructs.

查询包含问题是一个基本的计算机科学问题，最初是为关系查询定义的。随着sparql查询语言的日益普及，它在这个新的上下文中变得相关且重要：可靠且高效的sparql查询包含求解器可能在查询的静态分析中有各种应用，特别是在查询优化和重构领域。在本文中，我们提出了一种解决sparql中查询包含问题的新方法。该方法基于将查询包含问题减少为一阶逻辑中的可满足性问题。它涵盖了广泛的sparql语言结构，包括联合查询、空白节点、投影、子查询、子句from、过滤器、可选、图形等。它还涵盖了rdf schema 蕴含机制下的包含，它可以处理包含关系。我们描述了该方法的实现，一个开源求解器SpeCS及其在两个相关基准Query Containment Benchmark和SQCFramework上的全面实验评估。作为附带结果，SpeCS在两个基准中识别出不正确的测试用例，这些用例是手动检查、确认和修复的，从而产生更好、更可靠的基准。评估还表明，SpeCS非常高效，与最先进的求解器相比，它可以在更短的时间内给出更精确的结果。此外，SpeCS具有最高的受支持语言结构覆盖率。