•Theorem If f is an acyclic conjunctive query and A is a
structure, then checking whether A ² f can be done in timme O(|f| |A|)
•
•Note: |A| denotes the size of the entire structure, i.e. is more of the form n + n3 + n2 + n5 if the arities
of the relations in A are 3, 2, 5.
•
•Proof [in class]