Hi Ketil,
I know it may be a long shot, but did you consider using columnar data store
like Apache Arrow?
Without knowing more about your application it is a bit difficult to produce
more hints.
What is your application?
—
Cheers
Michal
> On 30 Apr 2017, at 2:44 PM, Ketil Malde <ke...@malde.org> wrote:
>
>
> Hi,
>
> I've been using Judy arrays as a fast and even more importatnly, compact
> associative structure. Infortunately, I'm getting occasional segfaults,
> and I'm unable to find anything wrong with my code. Others also report
> something similar. The Debian maintainer of libjudy made a version
> without some dubious optimizations, but that didn't help...at least
> not substantially.
>
> So the question is, what is a good replacement? I just need Word64 ->
> Integral, but again, I expect to fill all of main memory with data, so
> memory compactness is important. Anything using trees and boxed values
> (e.g. Data.IntMap and friends) out. I only need to be able to insert,
> modify (add one), and finally extract the key-value pairs
> (e.g. 'elems').
>
> Any suggestions?
>
> -k
> --
> If I haven't seen further, it is by standing in the footprints of giants
> _______________________________________________
> Biohaskell mailing list
> Biohaskell@biohaskell.org
> http://biohaskell.org/cgi-bin/mailman/listinfo/biohaskell
_______________________________________________
Biohaskell mailing list
Biohaskell@biohaskell.org
http://biohaskell.org/cgi-bin/mailman/listinfo/biohaskell
