User interface virtualization for large-volume structural data

Patent metadata

Field	Value
Publication number	US-10635459-B2
Application number	US-201815945692-A
Country	US
Kind code	B2
Filing date	Apr 4, 2018
Priority date	Apr 4, 2018
Publication date	Apr 28, 2020
Grant date	Apr 28, 2020

Abstract

In one example, a multi-dimensional data set is converted into a single-dimensional data set that includes structural information associated with the multi-dimensional data set, such that root nodes and each node in the single-dimensional node for which each ancestor node of the node is an expanded node is assigned a reference. A view is caused to be displayed, including using the single-dimensional data set to render at least a selected portion of the single-dimensional data set.

First claim

We claim:

1. An apparatus, comprising:
a device including at least one memory adapted to store run-time data for the device, and at least one processor that is adapted to execute processor-executable code that, in response to execution, enables the device to perform actions, including:
converting a multi-dimensional data set into a single-dimensional data set that includes structural information associated with the multi-dimensional data set, such that root nodes and each node in the single-dimensional node for which each ancestor node of the node is an expanded node is assigned a reference; and
causing a view to be displayed, including using the single-dimensional data set to render at least a selected portion of the single-dimensional data set, such that the rendering is based, at least in part, on the structural information, and such that single-dimensional nodes in the single-dimensional data set lacking references are skipped.

2. The apparatus of claim 1 , wherein the structural information includes a dimension value for each node in the single-dimensional data set that is not a descendant of a collapsed node.

3. The apparatus of claim 1 , the actions further including:
creating a reverse lookup data structure based on the single-dimensional data set such that the reverse lookup data structure uses key-value pairs in which, for each key-value pair, the key is the reference, and the value is an index of a corresponding item in the single-dimensional data set.

4. The apparatus of claim 3 , the actions further including, in response to adding a new node to the multi-dimensional data set:
generating a sub single-dimensional view model;
inserting the sub single-dimensional view model in the single-dimensional data set; and
after inserting the sub single-dimensional view model in the single-dimensional data set, ensuring that the reverse lookup data structure corresponds to the single-dimensional data set.

5. The apparatus of claim 3 , the actions further including, in response to removing a node from the multi-dimensional data set:
using the reverse lookup data structure to find a corresponding node in the single-dimensional data set;
removing the corresponding node from the single-dimensional data set;
removing the descendent nodes of the removed node from the single-dimensional data set; and
after removing the descendent nodes, ensuring that the reverse lookup data structure corresponds to the single-dimensional data set.

6. The apparatus of claim 3 , the actions further including, in response to expanding a node in the single-dimensional data set:
generating a sub single-dimensional view;
inserting the sub single-dimensional view into the single-dimensional data set based on the index of the expanded node in the reverse lookup data structure; and
after inserting the sub single-dimensional view, ensuring that the reverse lookup data structure corresponds to the single-dimensional data set.

7. The apparatus of claim 3 , where the actions further include, in response to collapsing a node in the single-dimensional data set:
removing each descendant node of the collapsed node from the single-dimensional data set; and
after removing each descendent node of the collapsed node, ensuring that the reverse lookup data structure corresponds to the single-dimensional data set.

8. The apparatus of claim 1 , wherein using the single-dimensional set to render at least a selected portion of the single-dimensional data includes:
determining a start and an end of the data in the single-dimensional data to be displayed; and
rendering each item from the determined start to the determined end.

9. The apparatus of claim 8 , wherein determining the start and the end of the data to be displayed is accomplished using the references of the single-dimensional set, a view port location, and a view port size.

10. The apparatus of claim 8 , wherein the actions further include, in response to a change in the view port, determining a start and an end of the data to be displayed in the changed viewport, and rendering each item from the determined start of the changed view port to the determined end of the changed view port.

11. A method, comprising:
via at least one processor, converting a multi-dimensional data model into a single-dimensional view model that includes structural information associated with the multi-dimensional data model, such that, in the single-dimensional view model, root nodes and each node in the single-dimensional node for which each ancestor node of the node is an expanded node is assigned a reference; and
causing a view to be displayed, including using the single-dimensional view model to render at least a selected portion of the single-dimensional view model, such that the rendering is based, at least in part, on the structural information, and such that single-dimensional nodes in the single-dimensional view model lacking references are skipped.

12. The method of claim ii, wherein the structural information includes a dimension value for each node in the single-dimensional view model that is not a descendant of a collapsed node.

13. The method of claim ii, further comprising:
creating a reverse lookup data structure based on the single-dimensional view model such that the reverse lookup data structure uses key-value pairs in which, for each key-value pair, the key is the reference, and the value is an index of a corresponding item in the single-dimensional view model.

14. The method of claim ii, wherein using the single-dimensional set to render at least a selected portion of the single-dimensional data includes:
determining a start and an end of the data in the single-dimensional view model to be displayed; and
rendering each item from the determined start to the determined end.

15. The method of claim 14 , further comprising, in response to a change in the view port, determining a start and an end of the data to be displayed in the changed viewport, and rendering each item from the determined start of the changed view port to the determined end of the changed view port.

16. A processor-readable storage medium, having stored thereon process-executable code that, upon execution by at least one processor, enables actions, comprising:
converting a multi-dimensional data set into a single-dimensional data set that includes structural information associated with the multi-dimensional data set, such that each node in the single-dimensional node that is not a descendant node of a collapsed node is assigned a reference; and
rendering at least a selected portion of the single-dimensional data set.

17. The processor-readable storage medium of claim 16 , wherein the structural information includes a dimension value for each node in the single-dimensional data set that is not a descendant of a collapsed node.

18. The processor-readable storage medium of claim 16 , the actions further comprising:
creating a reverse lookup data structure based on the single-dimensional data set such that the reverse lookup data structure uses key-value pairs in which, for each key-value pair, the key is the reference, and the value is an index of a corresponding item in the single-dimensional data set.

19. The processor-readable storage medium of claim 16 , wherein rendering at least a selected portion of the single-dimensional data includes:
determining a start and an end of the data in the single-dimensional data to be displayed; and
rendering each item from the determined start to the determined end.

20. The p

Assignees

• Microsoft Technology Licensing Llc

Inventors

• Lin Ling
• Maeda Masato
• Dhadda Harjinder Singh
• Chen hong tao
• Tripathi Jyotirmaya
• Aeron Rayman Faruk

Classifications

• G06F9/452 Primary

  Remote windowing, e.g. X-Window System, desktop virtualisation (protocols for virtual reality H04L67/131) · CPC title

• G06F16/2264

  Multidimensional index structures · CPC title

• G06F16/2246

  Trees, e.g. B+trees · CPC title

• G06F16/26

  Visual data mining; Browsing structured data · CPC title

• G06F16/2272

  Management thereof · CPC title