US2019347280A1PendingUtilityA1

Condensed hierarchical data viewer

Assignee: HARTEN WILLIAM SCOTTPriority: Nov 27, 2013Filed: Apr 22, 2019Published: Nov 14, 2019
Est. expiryNov 27, 2033(~7.3 yrs left)· nominal 20-yr term from priority
G06F 16/287G06F 16/282
47
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

The disclosure extends to methods, systems, and devices for visualizing hierarchical data within a computing environment. In order to display and visualize the hierarchical data in a meaningful manner, the disclosed methods condenses or suppresses the space occupied by the detailed textual information that is often part of such hierarchical data charts or graphs. The disclosure uses pop-up windows to output the formerly suppressed textual detail. Thus, in order to efficiently display more entities per unit display space, the disclosure displays less textual detail per node for all entities in the chart or graph, and compensates by using mouse over pop-up events to display the suppressed, hidden, or compressed details.

Claims

exact text as granted — not AI-modified
1 . A method for visualizing hierarchical data within a computing system comprising:
 receiving, using a computing processor, hierarchical data representing a plurality of related data entities from a database system over a network;   building in computer memory a representation of each of the plurality of related data entities represented in the hierarchical data;   receiving a designation of a root data entity from within the plurality of related data entities;   deriving a property glyph representing each of the plurality of related data entities, including the root data entity, based on properties of interest for each of the plurality of related data entities;   allocating display space for the plurality of related data entities on a digital display;   rendering on the digital display:
 the root data entity; 
 the relationship of the root data entity to one or more of the plurality of related data entities; 
 a graphical representation identifying a generational relationship in a non-textual manner between the root data entity and one or more of the plurality of related data entities; and 
 one or more data entity shortfalls in relationships between one or more of the plurality of related data entities. 
   
     
     
         2 . The method of  claim 1 , further comprising:
 registering a listener sub-program to be notified by an underlying operating system when a user selects one of the property glyphs representing each related data entity; and   displaying textual details that correspond to the selected property glyph.   
     
     
         3 . The method of  claim 2 , further comprising:
 stopping the displaying of textual details when the user deselects the glyph.   
     
     
         4 . The method of  claim 2 , wherein user selecting is a mouse-over event. 
     
     
         5 . The method of  claim 3 , wherein user deselecting is a mouse-out event. 
     
     
         6 . The method of  claim 1 , wherein the hierarchical data is genealogical. 
     
     
         7 . The method of  claim 1 , further comprising:
 displaying the property glyph of the root data entity at the center of a substantially circular rendering that comprises property glyphs representing relatives of the root data entity that radiate out from the glyph of the root data entity forming the circular rendering.   
     
     
         8 - 9 . (canceled) 
     
     
         10 . The method of  claim 1 , wherein the relations are either ancestral or descendent; or wherein the relations are both ancestral and descendant. 
     
     
         11 - 13 . (canceled) 
     
     
         14 . The method of  claim 1 , further comprising:
 graphically highlighting a series of relations between glyphs that traverses from the root data entity to any other related data entity.   
     
     
         15 - 19 . (canceled) 
     
     
         20 . A system for visualizing hierarchical data within a computing environment comprising memory, computer storage, and computing processors, wherein computer readable instructions are stored in memory, and when the computer readable instructions are retrieved from memory and executed by the computing processors cause the system to:
 receive hierarchical data representing a plurality of related data entities from a database system;   build in computer memory a representation of each of the plurality of related data entities represented in the hierarchical data;   receive a designation of a root data entity from within the plurality of related data entities;   derive a property glyph representing each of the plurality of related data entities, including the root data entity, based on properties of interest for each of the plurality of related data entities;   allocate display space for the plurality of related data entities on a digital display;   render on the digital display:
 the root data entity; 
 the relationship of the root data entity to one or more of the plurality of related data entities; 
 a graphical representation identifying a generational relationship in a non-textual manner between the root data entity and one or more of the plurality of related data entities; and 
 one or more data entity shortfalls in relationships between one or more of the plurality of related data entities. 
   
     
     
         21 . The system of  claim 20 , further comprising:
 register a listener sub-program to be notified by an underlying operating system when a user selects one of the property glyphs representing each related data entity; and   display textual details that correspond to the selected property glyph.   
     
     
         22 . The system of  claim 21 , further comprising:
 stop the displaying of textual details when the user deselects the glyph.   
     
     
         23 . The system of  claim 20 , wherein the hierarchical data is genealogical. 
     
     
         24 . The system of  claim 20 , further comprising:
 display the property glyph of the root data entity at the center of a substantially circular rendering that comprises property glyphs representing relatives of the root data entity that radiate out from the glyph of the root data entity forming the circular rendering.   
     
     
         25 - 26 . (canceled) 
     
     
         27 . The system of  claim 20 , wherein the relations are either ancestral or descendent; or wherein the relations are both ancestral and descendant. 
     
     
         28 - 29 . (canceled) 
     
     
         30 . The system of  claim 20 , wherein the one or more of the plurality of related data entities in a same generation include no graphical connection. 
     
     
         31 . The system of  claim 20 , further comprising:
 graphically highlight a series of relations between glyphs that traverses from the root data entity to any other related data entity.   
     
     
         32 . The system of  claim 21 , wherein user selecting is a mouse-over event. 
     
     
         33 . The system of  claim 22 , wherein user deselecting is a mouse-out event. 
     
     
         34 . The method of  claim 1 , wherein the one or more of the plurality of related data entities in a same generation include no graphical connection.

Join the waitlist — get patent alerts

Track US2019347280A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.