37、Web Join: Concepts, Pruning, and Construction

Web Join: Concepts, Pruning, and Construction

1. Web Join Basics

In the process of web join, we first have a step to concatenate joinable nodes. Let (t_{kr}’) represent the web tuple after this concatenation. Then, we check for adjacent joinable node type identifiers in (S_{ij}).

We define (D) as the set of pairs of adjacent joinable node type identifiers in (S_i) and (S_j). For each pair ((x, y) \in D):
- Let (L) be the set of links in (t_{kr}’) where the source and target ids of each link are instances of (x) and (y) respectively.
- Let (L_{ad} \subseteq X_{\ell_{ij}}) be the set of adjacent link type identifiers between (x) and (y).
- We remove the links (L’ \subseteq L) in (t_{kr}’) whose type identifiers are not in (L_{ad}) to ensur