Thanks Curtis, we were thinking something similar, but then thought that we could simplify the search algorithm by following additions (using documents because we a currently using Document API):
"find all documents between timestamp_1 and timestamp_2" 1. Add a link between adjacent documents ( i.e. add a property 'next' to a document => points to the next document available in time series) (2. Keep track of the timestamp list tail somewhere, so we can always quickly determine the latest data point) 3. Create an index of the timestamps in the documents 4. Find the closest document to timestamp_1 using the index (that is >= timestamp_1) 5. Traverse the links until we reach the closest document matching timestamp_2 (that is =< timestamp_2) Here the obvious problem is the potential size of the index, but in the other hand it is only accessed to find the starting node. What do you think? Timo -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
