On Mon, Dec 19, 2016 at 12:33 PM, Thomas Munro
wrote:
> Since Dilip Kumar's Parallel Bitmap Heap Scan project is no longer
> using this, I think I should park it here unless/until another
> potential use case pops up. Some interesting candidates have been
> mentioned already, and I'm fairly sure
On Sun, Nov 20, 2016 at 11:54 AM, John Gorman wrote:
> I reviewed the dht-v2.patch and found that it is in excellent shape.
Thanks for reviewing! And sorry for the late reply.
> Benchmarking shows that this performs somewhat faster than
> dynahash which is surprising because it is doing DSA add
On Sun, Nov 20, 2016 at 9:54 AM, John Gorman wrote:
> I reviewed the dht-v2.patch and found that it is in excellent shape.
>
> The overall performance will be faster due to not having to examine
> more than one hash bucket array most of the time.
>
>
Reviewer didn't find any problems in the appro
I reviewed the dht-v2.patch and found that it is in excellent shape.
Benchmarking shows that this performs somewhat faster than
dynahash which is surprising because it is doing DSA address
translations on the fly.
One area where this could run faster is to reduce the amount of
time when the hash
On 2016-10-05 08:02:42 +0200, Magnus Hagander wrote:
> On Oct 5, 2016 1:23 AM, "Thomas Munro"
> wrote:
> > Another thought: it could be used to make things like
> > pg_stat_statements not have to be in shared_preload_libraries.
> That would indeed be a great improvement. And possibly also allow t
On Wed, Oct 5, 2016 at 7:02 PM, Magnus Hagander wrote:
> On Oct 5, 2016 1:23 AM, "Thomas Munro"
> wrote:
>>
>> On Wed, Oct 5, 2016 at 12:11 PM, Thomas Munro
>> wrote:
>> > On Wed, Oct 5, 2016 at 11:22 AM, Andres Freund
>> > wrote:
>> >>> Potential use cases for DHT include caches, in-memory dat
On Thu, Oct 6, 2016 at 12:02 AM, Dilip Kumar wrote:
> While reviewing , I found that in dht_iterate_begin function, we are
> not initializing
> iterator->last_item_pointer to InvalidDsaPointer;
Fixed, thanks.
--
Thomas Munro
http://www.enterprisedb.com
dht-v2.patch
Description: Binary data
-
On Wed, Oct 5, 2016 at 3:10 AM, Thomas Munro
wrote:
> Here is an experimental hash table implementation that uses DSA memory
> so that hash tables can be shared by multiple backends and yet grow
> dynamically. Development name: "DHT".
+dht_iterate_begin(dht_hash_table *hash_table,
+ dht_iterat
On Oct 5, 2016 1:23 AM, "Thomas Munro"
wrote:
>
> On Wed, Oct 5, 2016 at 12:11 PM, Thomas Munro
> wrote:
> > On Wed, Oct 5, 2016 at 11:22 AM, Andres Freund
wrote:
> >>> Potential use cases for DHT include caches, in-memory database objects
> >>> and working state for parallel execution.
> >>
> >
On Wed, Oct 5, 2016 at 12:11 PM, Thomas Munro
wrote:
> On Wed, Oct 5, 2016 at 11:22 AM, Andres Freund wrote:
>>> Potential use cases for DHT include caches, in-memory database objects
>>> and working state for parallel execution.
>>
>> Is there a more concrete example, i.e. a user we'd convert to
On Wed, Oct 5, 2016 at 11:22 AM, Andres Freund wrote:
>> Potential use cases for DHT include caches, in-memory database objects
>> and working state for parallel execution.
>
> Is there a more concrete example, i.e. a user we'd convert to this at
> the same time as introducing this hashtable?
A c
Hi,
> It's impossible to write a general purpose hash table that will be
> suitable for every use case, considering all the combinations of
> design trade offs and subsets of functionality someone might want.
Very much agreed.
> There is other work being done in this space: I'm aware of Andres
Hi hackers,
Here is an experimental hash table implementation that uses DSA memory
so that hash tables can be shared by multiple backends and yet grow
dynamically. Development name: "DHT".
It's impossible to write a general purpose hash table that will be
suitable for every use case, considerin
13 matches
Mail list logo
