Hi, The user interface needs to show graphs and statistics so I need to (1) > query range between timestamps and read each record to plot that data - > possibly skipping every N records for crude resampling and (2) traverse all > the data to calculate some statistics on it. >
The regular b-tree based MVMap should work fine. Ok thanks. Just to be clear then, do all the implementations *including > r-tree* support concurrent writes? > Yes. I found this article on storing time series in various databases. They > cover (1) files (2) LSM tree ordered store and (3) b-tree ordered k/v store > http://jmoiron.net/blog/thoughts-on-timeseries-databases/ > Yes. The MVStore should work fine. It is a b-tree ordered k/v store, and you can implement an LSM tree on top of that if you need blind writes (which are faster). This is what I did in the "create index" command: create multiple maps that are independent, and merge them when required. Regards, Thomas -- You received this message because you are subscribed to the Google Groups "H2 Database" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/h2-database. For more options, visit https://groups.google.com/d/optout.
