[rdfweb-dev] nDegrees?

[Julian Bond]

Libby Miller <Libby.Miller at bristol.ac.uk> wrote:
>I'm trying it for knows but I'm up to 6,000,000 rows and it's not
>stopping...I think another approach is needed :)

I wonder what LinkedIn does? I've seen a screen shot of someone trying 
to make a connection with 3 intervening people (4 hops) so they must 
have some clever algorithm for suggesting routes.

If you limit the path length some of this is pretty easy. eg show me 
friends who know both me and the target or Show me a list of my friends 
of friends. With 3 hops the SQL gets nasty. With 4 hops it's unworkable 
without some dramatic simplification. One trick might be to create a 
temporary table of my FoF and do the same thing for the other person. 
Then look for the intersection. That would get you out to 4 hops. Orkut 
has a display of average path length so they must be calculating 
something, somehow.

-- 
Julian Bond Email&MSM: julian.bond at voidstar.com
Webmaster:                 http://www.ecademy.com/
Personal WebLog:          http://www.voidstar.com/
M: +44 (0)77 5907 2173      T: +44 (0)192 0412 433