Re: How to get good performance for very large lists/sets? - Mailing list pgsql-general

From Andy Colson
Subject Re: How to get good performance for very large lists/sets?
Date
Msg-id 5432F1C0.7070808@squeakycode.net
Whole thread Raw
In response to Re: How to get good performance for very large lists/sets?  (Andy Colson <andy@squeakycode.net>)
List 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


pgsql-general by date:

Previous
From: Jeff Janes
Date:
Subject: Re: How to get good performance for very large lists/sets?
Next
From: Jim Nasby
Date:
Subject: Re: table versioning approach (not auditing)