News for hackers. Stuff that matters.
Re:Introducing Druid: Real-Time Analytics at a Billion Rows ... by StavrosK on Sunday May 01, 2011 @12:13PM (#2503251)
This doesn't change the fact that searching is at least as fast as aggregating, no matter how much you cheat. Besides, how is precomputing relevant to the discussion here? By that reasoning, I can convert any algorithm to O(1) time and O(1) space.

The topic is about how search was faster than aggregation, and I'm saying that searching is faster than aggregation generally. You can parallelize all you want, it's still going to be faster to search than to aggregate.

There are no comments on this comment yet.