quick question: index optimisations on small tables - Mailing list pgsql-general

From Andrew Snow
Subject quick question: index optimisations on small tables
Date
Msg-id 000801c13164$5b674630$fa01b5ca@avon
Whole thread Raw
Responses Re: quick question: index optimisations on small tables  (Peter Eisentraut <peter_e@gmx.net>)
List pgsql-general
If I have:

CREATE TABLE small (
  key   integer PRIMARY KEY,
  value text
);

and assuming there are only enough rows to fit in one page, doesn't it
make sense to use the index instead of a seq. scan for queries of type

SELECT value FROM small WHERE key = 12345;


Since it can get the answer straight out of the index, and if there are
potentially numerous rows, looking up a b-tree is faster than a linear
search?


- Andrew


pgsql-general by date:

Previous
From: "P.J. \"Josh\" Rovero"
Date:
Subject: glacial deletes (long)
Next
From: Stephan Szabo
Date:
Subject: Re: Re: Fw: [JDBC] Regarding vacuumdb