Re: [Haskell-cafe] Map with incremental serialization

I recommend looking into Data.Acid.Remote if you plan on using acid-state. Will allow you to inspect your state using ghci. http://hackage.haskell.org/package/acid-state-0.12.2/docs/Data-Acid-Remote.h... On Fri, Oct 10, 2014 at 2:55 PM, Britt Mathis wrote:

I was told about acid-state on irc, but I wasn't sure if it did the incremental part - it looks like it will be perfect, thank you. And I will definitely check out that paper as well. On Oct 10, 2014 3:37 PM, "Nicolas Trangez" wrote:

...

On Fri, 2014-10-10 at 23:29 +0400, Nikita Volkov wrote:

...

There's "acid-state", which provides a log-based persistence model. I.e., it persists the modifications you make to the data structure.

You might also be interested in the paper 'Generic Storage in Haskell' by Sebastiaan Visser, and his thesis about the same subject.

Nicolas

...

2014-10-10 23:09 GMT+04:00 Britt Mathis :

...

Hello everyone, I'm not sure if something like this already exists

so I

...

...

figured I would ask here first before I reinvent the wheel. What I need is a data structure that behaves like Data.Map, but is serialized to disk incrementally so I only have the overhead of writing what has changed every time.

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

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

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

-- Cell: 1.630.740.8204