Query containment is the problem of determining if the result of one query is included in the result of another for any RDF graph. Its advantages are broad: query optimizations, information integration, satisfiability for instance. A test case for containment comprises two queries Q1 and Q2, and an optional schema S. A query containment solver (QC solver) produces yes or no answers, i.e., yes if Q1 is contained in Q2 and no otherwise.
For this benchmark, queries are chosen according to the criteria: projection (or no projection), operator nesting, number of connectives (joins and disjunctions), and requiring RDFS reasoning. Our queries also vary in general characteristics like selectivity, query size, and different types of joins. One thing that should be noted is that, the benchmark criteria are selected in line with the ca- pacity of the current state-of-the-art.