Adaptive tree structure for visualizing data

• US 8,595,750 B2
• Filed: 11/30/2010
• Issued: 11/26/2013
• Est. Priority Date: 11/30/2010
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Agarwal, Mayank, Dadiomov, Alexander, Ji, Xinhua
• Primary Examiner(s): Sough, H S
• Assistant Examiner(s): Onat, Umut
• Application Number:
  US12/956,127
• Publication Number:
  US 20120137308A1
• Time in Patent Office: 1,092 Days
• Field of Search: None
• US Class Current: 719/318
• CPC Class Codes: G06F 16/904 Browsing; Visualisation therefor for navigating the web G06F16/954; browsing optimisation for the web G06F16/957
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications

Abstract

One or more systems and/or techniques for generating an adaptive tree structure for storing event data based upon data density of events are disclosed. In particular, the adaptive tree structure may comprise one or more levels of nodes, where a level may correspond to a resolution of events. Nodes may correspond to particular time spans over which event data was recorded. A node may be designated as a raw node comprising raw events or a summary node comprising summary events based upon the number of events occurring within a time span covered by the node.

Claims

1. 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;

2. The method of claim 1, comprising:

presenting a timeline comprising event data represented by the node data.

3. The method of claim 2, comprising:

receiving user input corresponding to at least one of a zoom action or a scroll action within the timeline, the user input comprising a second requested time span different than the requested time span; and

determining second node data within the adaptive tree structure corresponding to the second requested time span.

4. The method of claim 1, comprising:

if the node data corresponds to a raw node, then;

aggregating raw events of a raw node into summary events; and

storing the summary events within the node data.

5. The method of claim 1, the node data comprising data associated with at least one of a document or a spreadsheet.

6. The method of claim 1, the node data comprising data associated with network traffic.

7. The method of claim 1, the node data comprising data associated with a social network.

8. A system, comprising:

one or more processing units; and

memory comprising instructions that when executed using at least one of the one or more processing units, perform a method for determining node data corresponding to events, the method comprising;

receiving a requested time span;

calculating a level (L) corresponding to;

9. The system of claim 8, the method comprising:

presenting a timeline comprising event data represented by the node data.

10. The system of claim 9, the method comprising:

receiving user input corresponding to at least one of a zoom action or a scroll action within the timeline, the user input comprising a second requested time span different than the requested time span; and

determining second node data within the adaptive tree structure corresponding to the second requested time span.

11. The system of claim 8, the method comprising:

if the node data corresponds to a raw node, then;

aggregating raw events of a raw node into summary events; and

storing the summary events within the node data.

12. The system of claim 8, the node data comprising data associated with at least one of a document or a spreadsheet.

13. The system of claim 8, the node data comprising data associated with network traffic.

14. The system of claim 8, the node data comprising data associated with a social network.

15. A computer readable storage memory comprising instructions that when executed perform a method, comprising:

receiving a requested time span;

calculating a level (L) corresponding to;

16. The computer readable storage memory of claim 15, the method comprising:

presenting a timeline comprising event data represented by the node data.

17. The computer readable storage memory of claim 16, the method comprising:

receiving user input corresponding to at least one of a zoom action or a scroll action within the timeline, the user input comprising a second requested time span different than the requested time span; and

determining second node data within the adaptive tree structure corresponding to the second requested time span.

18. The computer readable storage memory of claim 15, the method comprising:

if the node data corresponds to a raw node, then;

aggregating raw events of a raw node into summary events; and

storing the summary events within the node data.

19. The computer readable storage memory of claim 15, the node data comprising data associated with at least one of a document or a spreadsheet.

20. The computer readable storage memory of claim 15, the node data comprising data associated with network traffic.