Re: half-atomically rebuild databases

[Ingo Schwarze <schwarze@usta.de>]

Hi Kristaps,

> It's still debatable whether using recno(3) for the index is a good
> idea.  The general usage is to hit the btree(3) then look up in the
> recno(3)

Right, so typically, we do a full linear search through the
whole large btree(3), doing a substring or even regex match for
each entry, and after that typically a single or a few recno(3)
lookups in the much smaller index.

I'd *guess* almost the whole time is spent in the btree,
so i'm not sure optimizing the recno will buy us anything.
I'd discourage optimizing the recno part without first
confirming that any relevant part of the time is spent there.

In any case, please don't optimize the database format right now.  ;-)

> (btree(3) is harmless, I think, but useless: we don't do
> lexicographic lookup as I'd originally thought).

That statement makes sense to me.

Yours,
  Ingo
--
 To unsubscribe send an email to tech+unsubscribe@mdocml.bsd.lv