Subject: Re: Performant queries on table with many boolean columns
To: Rob Imig <rimig88@gmail.com>, pgsql-performance@postgresql.org
References: 
 <CANcrS5pR1P1Tj=e-RQQ=FF3WPAy_fyruS0YJer-+iJHxR1JAiA@mail.gmail.com>
From: Teodor Sigaev <teodor@sigaev.ru>
Message-ID: <5717D07E.3070802@sigaev.ru>
Date: Wed, 20 Apr 2016 21:54:54 +0300
User-Agent: Mozilla/5.0 (X11; FreeBSD i386; rv:42.0) Gecko/20100101
 Firefox/42.0 SeaMonkey/2.39
MIME-Version: 1.0
In-Reply-To: 
 <CANcrS5pR1P1Tj=e-RQQ=FF3WPAy_fyruS0YJer-+iJHxR1JAiA@mail.gmail.com>
Content-Type: text/plain; charset=KOI8-R; format=flowed
Content-Transfer-Encoding: 7bit
Precedence: bulk
Sender: pgsql-performance-owner@postgresql.org

>
> The obvious thing seems to make a table with ~100 columns, with 1 column
> for each boolean property. Though, what type of indexing strategy would
> one use on that table? Doesn't make sense to do BTREE. Is there a better
> way to structure it?
>
looks like a deal for contrib/bloom index in upcoming 9.6 release


-- 
Teodor Sigaev                      E-mail: teodor@sigaev.ru
                                       WWW: http://www.sigaev.ru/


-- 
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance