System And Method For Redistributing Interest In A Hierarchical Data Structure Representation
AssigneePalo Alto Research Center Incorporated
InventorsJeffrey M. Heer, Stuart K. Card
Life of this patent
Estimating the term…
Loading patent…
AssigneePalo Alto Research Center Incorporated
InventorsJeffrey M. Heer, Stuart K. Card
Estimating the term…
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.
A system for redistributing interest in a hierarchical data structure representation, comprising:
A method for redistributing interest in a hierarchical data structure representation, comprising:
Dependencies are inferred from the claim text.