System and method for redistributing interest in a hierarchical data structure representation
US8010575B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 30, 2009 |
| Grant date | Aug 30, 2011 |
| Priority date | — |
| Expiry date | Nov 30, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T11/206
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A system and method for redistributing interest in a hierarchical data structure representation is provided. A data representation of a hierarchical data structure includes depth levels having one or more blocks of sibling nodes associated with node interest characteristics. Two or more of the sibling nodes are combined as aggregates into elided subsets. One of the elided subsets is selected and expanded to reveal the aggregated sibling nodes. A breadth of the depth level in which the block is located is determined. A further determination that the breadth exceeds a constrained breadth extent for the data representation is made. The breadth is decreased by ordering the sibling nodes in the depth level by their node interest characteristic and by combining at least a portion of the sibling nodes into the elided subset based on the respective node interest characteristics such that the breadth does not exceed the constrained breadth extent.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.