« Disappearing Links... | Main | “The Blog 500” Challenge: Some thoughts on Jason's metrics »

August 05, 2005



Nice try to make this sound like a big deal, but matching a few hundred thousand subscribers to 2 million entries per day is easy, even on a dual PC as you point out. I fail to see the hard problem that is being solved.

[Bob Wyman responds: Well, if you think it is easy, then try to do it yourself! If you can demonstrate it to us, we'll probably offer you a job. Or, identify a system that already does this... You'll find that it is harder than you think. Remember, you need to re-evaluate every one of the "few hundred thousand" subscriptions 2 million times each day in order to deliver the same low-latency matching that we do. Solutions that involve batching data, and thus increasing latency, aren't fair comparisons. You can only match one message at a time. Also, your system should be able to match arbitrarily complex boolean expressions on multi-element XML-formatted messages. In any case, remember as well that I wrote that we're currently running far below capacity... ]

Peter Q

Bob, Count me impressed. As you rightly point out, it's significant particularly if no one else is doing it, and there is a "market for it".

The key to the future of information management and delivery is personalization, and this is a significant step in that direction.


Phillip Pearson

I'll take you up on that challenge, at least as far thinking up an algorithm. I'm not looking for a job, but this looks like a fun problem!


Let me know what you think.


Nice one, Bob.


What's Google's corresponding Hyperbole Number?

The comments to this entry are closed.