... a set of candidate ID mappings C = {m1, ,mn} and a weightfunction w :2I×I→ Q+. Goal: find I ⊆ C such that I is an ID set and thereis no I⊆ C such that Iis an ID set and mi∈Iw(mi) ... Querying and Navigation 153strings x = x1, ,xn and y = y1, ,ymwith n ≤ m. The string x is sequence-included in the string y if the l.c.s. of x and y is x. Note that sequence-inclusion and ... using thecontainment join (ContainingP arent and ContainedChild).For queries with n = 1, step 4, for the signature based query plan, and steps6 and 7, for the containment join based query plan,...