From: karl.wettin on
This is sort of off topic, but I could not think of a better forum to
place the question.

I'm searching for good white papers on social networks from an OO
angle. Interested in both advocacy and implemenations. The problem is
that there are so many. Almost as I need to implement some
collaboratie filtering in order to figure out what to read.

My original idea is to keep track of all vertices in RAM and navigate
it using an A*, Dijkstra or so. But as the graph might grow to a
couple of million identities with an average of 30-40 links, I might
just run out of RAM. So I was thinking that perhaps I should keep a
set in RAM that has been reduced from the persistent data. Some sort
of pseudo augmented social network, calculated using PCA (or so). This
might be crazy.

In the end I want to use it for trust filtering in an inverted search
engine with very heavy load, so it really needs to be speedy. I can
spare a couple of GB for cache.

Pointers to URL:s, experience from implementations et c, is all more
than welcome.

--
karl