[Haskell-cafe] Map with incremental serialization

[Alberto G. Corona]

I don´t know the new versions, but acid-state is not incremental. it writes
everithing.

the package TCache is incremental. it uses HasTables instead of a map. It
works in the STM monad. And it is incremental with configurable persistence.

https://hackage.haskell.org/package/TCache

2014-10-10 22:15 GMT+02:00 Britt Mathis <britt.mathis at gmail.com>:

> Someone on irc mentioned acid-state remote (it may have even been you), I
> will definitely be using it. My only worry is that I only have 512MB of Ram
> to work with atm, which should be fine until I have several thousand users.
> I see on the acid state website that I would need to integrate with
> something else to provide the ability to have a data structure larger than
> memory (I may be missing or misunderstanding something), would it be
> trivial to add this in later or should I be worried about it now?
> On Oct 10, 2014 4:10 PM, "David Johnson" <djohnson.m at gmail.com> wrote:
>
>> 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.html
>>
>> On Fri, Oct 10, 2014 at 2:55 PM, Britt Mathis <britt.mathis at gmail.com>
>> 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" <nicolas at incubaid.com> 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 <britt.mathis at gmail.com>:
>>>> >
>>>> > > 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 at haskell.org
>>>> > > http://www.haskell.org/mailman/listinfo/haskell-cafe
>>>> > >
>>>> > >
>>>> > _______________________________________________
>>>> > Haskell-Cafe mailing list
>>>> > Haskell-Cafe at haskell.org
>>>> > http://www.haskell.org/mailman/listinfo/haskell-cafe
>>>>
>>>>
>>>>
>>> _______________________________________________
>>> Haskell-Cafe mailing list
>>> Haskell-Cafe at haskell.org
>>> http://www.haskell.org/mailman/listinfo/haskell-cafe
>>>
>>>
>>
>>
>> --
>> Cell: 1.630.740.8204
>>
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>


-- 
Alberto.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20141010/54fb2ecb/attachment.html>