Thomas, thanks for your reply. > > I think a regular (b tree) index is enough for your case. What queries do > you use? >
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. All the sensors are sampled at the same time, and written as one record (so I don't need a map for each series). > That's a documentation bug, I will fix it. In the past, the default map > implementation did not support concurrent writes. This is now changed. > Ok thanks. Just to be clear then, do all the implementations *including r-tree* support concurrent writes? 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/ Luckily this is a mobile app, so there isn't much data - but it is resource constrained, so efficiency is still important. Thanks -Alex -- 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.
