2016-08-11 UTC
# 
cmal hey, has anybody thought of or implemented a flat-file database for time-ordered collections (streams) using fixed-length ids and timestamps so that we can query the collection in o(log(n))? I was just thinking about it last night and I see no reason not to do it but maybe somebody has more insights on the matter :-)