8
Subgraph Properties
•
Consider R(x,y);
•
For every edge, Pr(R(u,v)) = c/n
2
•
•
Given Q, let H = Q
¹
obtained by adding all
predicates of the form x
i
¹
x
j
•
•
H checks for the presence of a subgraph