Messages in this thread | | | Date | Thu, 30 Oct 2008 18:43:00 +0100 | From | Pavel Machek <> | Subject | Re: [RFC] B+Tree library |
| |
Hi!
> Main disadvantage of btrees is that they are complicated, come in a > gazillion subtly different variant that differ mainly in the balance > between read efficiency and write efficiency. Comparing btrees against > anything is a bit like comparing apples and random fruits.
:-)))))
+ * Disks have fulfilled the prerequite for a long time. More recently DRAM
prerequisite?
+#define MAX(a, b) ((a) > (b) ? (a) : (b))
We already have that in the headers somewhere.
-- (english) http://www.livejournal.com/~pavelmachek (cesky, pictures) http://atrey.karlin.mff.cuni.cz/~pavel/picture/horses/blog.html
| |