Re: [Haskell-cafe] Efficient temporary file storage??

It's not as efficient for Maps, but you might want to look at the swapper package: http://hackage.haskell.org/package/swapper It transfers Haskell data structures (any functors) directly to and from disk. Tom On 1/23/12, Krzysztof Skrzętnicki wrote:

From my experience I can recommend msgpack ( http://hackage.haskell.org/package/msgpack) as being extremely fast. It comes with optimized prepared instances for common data structures which is very nice, because you don't have to roll your own version with library like cereal (which is indeed very fast, but simply less convenient).

Best regards, Krzysztof Skrzętnicki

On Tue, Jan 24, 2012 at 00:37, Nick Rudnick wrote:

...

Dear all,

if you want to temporarily store haskell data in a file – do you have a special way to get it done efficiently?

In an offline, standalone app, I am continuously reusing data volumes of about 200MB, representing Map like tables of a rather simple structure,

key: (Int,Int,Int) value: [((Int,Int),LinkId)]

which take quite a good deal of time to produce.

Is there a recommendation about how to 'park' such data tables most efficiently in files – any format acceptable, quick loading time is the most desirable thing.

Thanks a lot in advance, Nick

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe