Google is Harder Than it Looks ETCON talk notes

Cory Doctorow has posted His Notes from the O’Reilly Emerging Technology Conference talk, Google is Harder Than it Looks by Nelson Minar from Google.

Not much detail, but it looks like it was an interesting talk, especially “How a search works:”

“Index server, “every page with the word ‘apple’ in it — a
cluster that manages “shards” or “partitions” (everything
starting with the letter “a”) and then load-balancing
replications for each. Have to calculate intersections for
multiple-term queries


There’s a few other nuggets in there as well.