Yves Weißig<weissig(at)rbg(dot)informatik(dot)tu-darmstadt(dot)de> wrote:
> Am 21.04.2011 20:56, schrieb Kevin Grittner:
>> Yves Weißig<weissig(at)rbg(dot)informatik(dot)tu-darmstadt(dot)de> wrote:
>>
>>> what is the best way to test a new developed index structure?
>>
>> Are you talking about a new AM (like btree, hash, GiST, or GIN)?
>
> Yes I do!
The tests are going to depend somewhat on what the index is intended
to do.
That said, I would start by making sure that basic things like
CREATE INDEX and DROP INDEX work. Then I would test that INSERT,
UPDATE, and DELETE do the right things with the index. Then I would
make sure that vacuum did the right thing. Then I would make sure
that the optimizer was doing a reasonable job of knowing when it was
usable and what it cost, so that it would be chosen when
appropriate. Once everything seemed to be behaving I would
benchmark it against the reasonable alternatives.
-Kevin