Patent ID: 8595750

Claim:
A method, implemented at least in part via a processing unit, for determining node data corresponding to events, comprising: receiving a requested time span; calculating a level (L) corresponding to: T CPNL L < requested ⁢ ⁢ time ⁢ ⁢ span ≤ T CPNL L - 1 , where T is a total time span of an event dataset and CPNL is a predetermined number of child nodes per summary node, the requested time span less than or equal to the total time span, CPNL comprising a non-zero number other than one, T comprising a non-zero number; and determining node data within an adaptive tree structure corresponding to the requested time span, the determining node data comprising: if the requested time span falls completely within a node of level (L), then determining the node as comprising the node data; if the requested time span falls completely within two adjacent nodes of level (L), then determining the two adjacent nodes as comprising the node data; if a first segment of the requested time span falls completely within a first node of level (L) and a second segment of the requested time span does not fall within respective nodes of level (L) then: determining the first node as comprising a first portion of the node data; and determining a second node within a previous level as comprising a second portion of the node data, where the second segment of the requested time span falls completely within the second node; and if none of level (L)'s nodes span at least a portion of the requested time span, then decrementing the level (L) by one level to a previous level and iterating to determine node data.