| From: | Andrew Dunstan <andrew(at)dunslane(dot)net> |
|---|---|
| To: | Joel Jacobson <joel(at)compiler(dot)org>, Tomas Vondra <tomas(dot)vondra(at)enterprisedb(dot)com>, pgsql-hackers(at)lists(dot)postgresql(dot)org |
| Subject: | Re: Do we want a hashset type? |
| Date: | 2023-06-01 10:51:21 |
| Message-ID: | cf5fdbfb-314a-4309-e6a4-6f3e64ec05ca@dunslane.net |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 2023-05-31 We 11:40, Joel Jacobson wrote:
> On Wed, May 31, 2023, at 16:53, Tomas Vondra wrote:
>> I think this needs a better explanation - what exactly is a hashset in
>> this context? Something like an array with a hash for faster lookup of
>> unique elements, or what?
> In this context, by "hashset" I am indeed referring to a data structure similar
> to an array, where each element would be unique, and lookups would be faster
> than arrays for larger number of elements due to hash-based lookups.
Yeah, a fast lookup set type has long been on my "blue sky" wish list.
So +1 for pursuing the idea.
cheers
andrew
--
Andrew Dunstan
EDB:https://www.enterprisedb.com
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Melih Mutlu | 2023-06-01 10:54:02 | Re: [PATCH] Reuse Workers and Replication Slots during Logical Replication |
| Previous Message | Greg Stark | 2023-06-01 10:47:40 | Re: Avoiding another needless ERROR during nbtree page deletion |