3. A method as recited in claim 1 , wherein the entity relationship graph is a candidate entity relationship graph that is reduced from an original entity relationship graph.
12. A computer-readable storage medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3 .