3. The method of claim 2 , creating click relevance ordering of an m th and n th query/URL pair within the plurality of query/URL pairs comprising utilization of a plurality of click relevance ordering rules comprising: 
 if C m ≈C n and CR m >CR n and NCR m >NCR n ; 
 if I m ≈I n and CR m >CR n and NCR m >NCR n ; 
 if I m ≈I n and CR m >2 ×CR n and NCR m ≈NCR n ; 
 if I m =I n and CR m ≈CR n and NCR m >2× NCR n ; 
 if I m >100 and I n >100 and CR m >5×CR n and NCR m >0.8× NCR n ; and 
 if CR m >50× C n ; wherein m=1:k, n=1:k, and k=number of query/URL pairs in user data log; and wherein URL m is more relevant than URL n if any one of the plurality of click relevance ordering rules are satisfied.
3. The method of claim 2 , creating click relevance ordering of an m th and n th query/URL pair within the plurality of query/URL pairs comprising utilization of a plurality of click relevance ordering rules comprising: 
 if C m ≈C n and CR m >CR n and NCR m >NCR n ; 
 if I m ≈I n and CR m >CR n and NCR m >NCR n ; 
 if I m ≈I n and CR m >2 ×CR n and NCR m ≈NCR n ; 
 if I m =I n and CR m ≈CR n and NCR m >2× NCR n ; 
 if I m >100 and I n >100 and CR m >5×CR n and NCR m >0.8× NCR n ; and 
 if CR m >50× C n ; wherein m=1:k, n=1:k, and k=number of query/URL pairs in user data log; and wherein URL m is more relevant than URL n if any one of the plurality of click relevance ordering rules are satisfied. 4. The method of claim 3 , the plurality of click relevance ordering rules mitigating contradictory relations in the acyclic graph.