Re: Performant queries on table with many boolean columns

From: "David G(dot) Johnston" <david(dot)g(dot)johnston(at)gmail(dot)com>
To: Teodor Sigaev <teodor(at)sigaev(dot)ru>
Cc: Rob Imig <rimig88(at)gmail(dot)com>, "pgsql-performance(at)postgresql(dot)org" <pgsql-performance(at)postgresql(dot)org>
Subject: Re: Performant queries on table with many boolean columns
Date: 2016-04-20 21:49:10
Message-ID: CAKFQuwY3z7oGwriDie4guGPudy_k8S4wWJKrTRy7zPKjTUm=wQ@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

On Wed, Apr 20, 2016 at 11:54 AM, Teodor Sigaev <teodor(at)sigaev(dot)ru> wrote:

>
>> 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

​Curious, it doesn't look like it will work with booleans out of the box.

http://www.postgresql.org/docs/devel/static/bloom.html

David J.
​

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Sven Kerkling 2016-04-21 09:49:54 Performance problems with postgres and null Values?
Previous Message Rick Otten 2016-04-20 21:07:27 Re: Performant queries on table with many boolean columns