You might need to use a lot of bitwise OR statements in the query though if you are looking at very sparse sets of specific values...
Something like the get_bit() function might allow you to select a specific bit, but then you might want a bunch of functional indexes on the column for various get_bit() combinations.
Maybe you can group commonly queried sets of columns into bit strings. (rather than having one bit string column for all 100 booleans).
On Wed, Apr 20, 2016 at 2:54 PM, Teodor Sigaev <teodor@sigaev.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
