Re: Covering Indexes
Andrew Dunstan <andrew@dunslane.net>
From: Andrew Dunstan <andrew@dunslane.net>
To: Jeff Janes <jeff.janes@gmail.com>
Cc: "David E. Wheeler" <david@justatheory.com>, Pg Hackers <pgsql-hackers@postgresql.org>
Date: 2012-06-28T15:50:30Z
Lists: pgsql-hackers
On 06/28/2012 11:37 AM, Jeff Janes wrote: > On Thu, Jun 28, 2012 at 5:16 AM, David E. Wheeler<david@justatheory.com> wrote: >> Hackers, >> >> Very interesting design document for SQLite 4: >> >> http://www.sqlite.org/src4/doc/trunk/www/design.wiki >> >> I'm particularly intrigued by "covering indexes". For example: >> >> CREATE INDEX cover1 ON table1(a,b) COVERING(c,d); > I don't see the virtue of this in this case. Since the index is not > unique, why not just put the index on (a,b,c,d) and be done with it? > Is there some advantage to be had in inventing a way to store c and d > in the index without having them usable for indexing? > Presumably the comparison function will be faster the fewer attributes it needs to compare. cheers andrew