Re: how to build a database from scratch

From: Sampo Syreeni <decoy_at_iki.fi>
Date: Thu, 7 Dec 2006 04:29:36 +0200
Message-ID: <Pine.SOL.4.62.0612070414490.25106@kruuna.helsinki.fi>

On 2006-12-07, paul c wrote:

> A strict internal separation, eg., protocol will allow multiple NAIVE
> btree tasks to co-exist.

Could you elaborate a bit? I honestly don't see how that would work out.

> All the rest is depends on the speed of hardware.

Below a constant limit or asymptotic? Absolute or relative (to what?)? Parallel or sequential complexity? Parallel only in processing, or only in I/O, or both, or neither? "Speed" as such doesn't really seem to circumscribe the problem adequately.

-- 
Sampo Syreeni, aka decoy - mailto:decoy_at_iki.fi, tel:+358-50-5756111
student/math+cs/helsinki university, http://www.iki.fi/~decoy/front
openpgp: 050985C2/025E D175 ABE5 027C 9494 EEB0 E090 8BA9 0509 85C2

Received on Wed Dec 06 2006 - 20:29:36 CST