Comments on: If you claim high scalability… http://lemire.me/blog/archives/2008/08/25/if-you-claim-high-scalability/ Computer Scientist and Open Scholar: Databases, Information Retrieval, Business Intelligence. Wed, 23 May 2012 19:07:50 +0000 hourly 1 http://wordpress.org/?v=3.3.2 By: Kevembuangga http://lemire.me/blog/archives/2008/08/25/if-you-claim-high-scalability/comment-page-1/#comment-50125 Kevembuangga Tue, 26 Aug 2008 07:22:53 +0000 http://www.daniel-lemire.com/blog/archives/2008/08/25/if-you-claim-high-scalability/#comment-50125 <i>But where is the fun in that?</i> What do you mean? Not trusting a "proof" over only 2000 datapoints? But where is the fun in that?

What do you mean?
Not trusting a “proof” over only 2000 datapoints?

]]> By: D. Eppstein http://lemire.me/blog/archives/2008/08/25/if-you-claim-high-scalability/comment-page-1/#comment-50122 D. Eppstein Mon, 25 Aug 2008 20:38:09 +0000 http://www.daniel-lemire.com/blog/archives/2008/08/25/if-you-claim-high-scalability/#comment-50122 <i>Their algorithm runs in O(n) time, so to know how long it would take to process 1000 times more data, just multiply by 1000.</i> Is that even true? It ignores memory hierarchy effects. Their algorithm runs in O(n) time, so to know how long it would take to process 1000 times more data, just multiply by 1000.

Is that even true? It ignores memory hierarchy effects.

]]>