yes, I was thinking about the same, basically the search functionality would be on me. If one has an estimation of how frequently data come in (if the search is

yes, I was thinking about the same, basically the search functionality would be on me. If one has an estimation of how frequently data come in (if the search is done on time) then one could find the best approach for keeping those trees within reasonable size, maybe with a multi level approach, as you suggest. A generic functionality that would adapt to all situations would be nicer. Maybe Blyss could offer some libraries for that?