[HACKERS] Re: custom hash-based COUNT(DISTINCT) aggregate - unexpectedly high memory consumption

2013-10-11 Thread Huchev
gettimeofday(&start, NULL); for (i = 0; i < VALUES; i++) { state = XXH32_init(result); XXH32_update(state, &i, 4); XXH32_digest(state); } gettimeofday(&end, NULL); This code is using the "update" variant, which is only useful when dealing with very large amount of

Re: [HACKERS] pluggable compression support

2013-09-30 Thread Huchev
I've been following this issue these last few months. Having the latest and best compressors built-in is a fashionable features these days. And for good reasons. I'm quite amazed that this issue is still considered a "legal risk". To put this in perspective, the *whole world* is using LZ4 by now.

Re: [HACKERS] Faster compression, again

2012-04-06 Thread Huchev
nabble.com> a écrit : > On Tue, Apr 3, 2012 at 7:29 AM, Huchev <[hidden > email]<http://user/SendEmail.jtp?type=node&node=5619199&i=0>> > wrote: > > For a C implementation, it could interesting to consider LZ4 algorithm, > since > > it is written nativ

Re: [HACKERS] Faster compression, again

2012-04-03 Thread Huchev
For a C implementation, it could interesting to consider LZ4 algorithm, since it is written natively in this language. In contrast, Snappy has been ported to C by Andy from the original C++ Google code, which lso translate into less extensive usage and tests. http://code.google.com/p/lz4/ Further