l*******l
发帖数: 248 | 1 下面两种情况下怎么存最efficent？
a whole big pile VS like the last 10 ticks |
k**u
发帖数: 698 | 2 co-ask.
【在 l*******l 的大作中提到】
: 下面两种情况下怎么存最efficent？
: a whole big pile VS like the last 10 ticks
|
r***6
发帖数: 401 | 3 In memory last n ticks use circular buffer. For a whole days data use hdf5
or binary or R dataset.
co-ask.
★ Sent from iPhone App: iReader Mitbbs 6.88 - iPhone Lite
【在 k**u 的大作中提到】
: co-ask.
|
a****n
发帖数: 1887 | 4 in memory database vs queue in memory |
o********n
发帖数: 100 | 5 hello. I saw your post on BBS. I am doing similar thing. Maybe we can learn
from each other?
for whole day, use binary, because you can then use memory map to read it,
which is the most efficient tool you can have.
For in memory, what do you mean by "whole pile" ? I am just beginning
handling storage of data in memory and don't have a clue :-( so it would be
really nice to learn what is the general methods. |
