[Haskell-cafe] Storing big datasets
volhovm.cs at gmail.com
Fri May 6 20:28:50 UTC 2016
I'm using ACID package as main database -- it's simple and... ACID
(which is cool of course).
So now I need to store up to ~30GB of data in a single data structure
(!) that will be constantly updated (some kind of a huge tree set).
Here's a question -- how to operate that big structure?
1. It doesn't even fit in RAM
2. It should be updated atomically and frequently (every 10 seconds up
to 500 elements out of 10^7).
3. What structures should I use? I'd like to store up to 10^6~10^7 some
simple elements there too, that will be gigabytes of data. So it seems
to me I can't use Data.Set.
Thanks for any ideas!
M3#38 ITMO study group 17'
Computer Technologies Department
More information about the Haskell-Cafe