Re: How to get good performance for very large lists/sets?

From: Andy Colson <andy(at)squeakycode(dot)net>
To: pgsql-general(at)postgresql(dot)org
Subject: Re: How to get good performance for very large lists/sets?
Date: 2014-10-06 19:47:12
Message-ID: 5432F1C0.7070808@squeakycode.net
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

>>
>
>
> Ohhh..
>
> Um, completely left field, but, if your items are sequential in some
> way, maybe there is some gross misuse of ranges you could use?
>
> http://www.postgresql.org/docs/9.2/static/rangetypes.html
>
>
> -Andy
>
>

Another thought, for the case of "find all the items in list A but not
list B things can get very slow "

What if you selected everything from list B created yourself a bloom
filter, then selected everything out of list A. (Meaning, take it out
of PG and do the compare yourself)

Or, maybe write yourself a stored proc that could do bloom filters.

-Andy

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Jim Nasby 2014-10-06 21:47:26 Re: table versioning approach (not auditing)
Previous Message Jeff Janes 2014-10-06 19:17:36 Re: How to get good performance for very large lists/sets?