[Haskell-cafe] pure Haskell database
graham.fawcett at gmail.com
Thu Sep 25 18:31:06 EDT 2008
On Thu, Sep 25, 2008 at 5:09 PM, Manlio Perillo
<manlio_perillo at libero.it> wrote:
> Graham Fawcett ha scritto:
>> If you're on Intel/Itanium, I believe there's a CMPXCHG instruction
>> that will do atomic compare-and-set on a memory address, and I'm not
>> sure you could get much faster than that. :-)
> I have an early draft of this type of database (written in D).
> Operations on integers use CMPXCHG, and for other operations a simple spin
> lock (implemented following the implementation in Nginx) is used.
And I thought I was being original. :-)
> The problem is that it is a simple shared array!
I'm guessing you've also ruled out sparse arrays? If not, what
complexity is acceptable on your lookup function?
(sorry if this heading off-topic for the list.)
More information about the Haskell-Cafe