Reorganization of nodes in a partial view of hierarchical information

• US 5,812,135 A
• Filed: 11/05/1996
• Issued: 09/22/1998
• Est. Priority Date: 11/05/1996
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Kotchey, Christopher Michael
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Alam, Hosain T.
• Application Number:
  US08/744,522
• Time in Patent Office: 686 Days
• Field of Search: 345/356, 345/341, 345/340, 345/355, 345/357, 707/3-6, 707/100
• US Class Current: 715/853
• CPC Class Codes: G06F 16/10 File systems; File servers
• CPC Class Codes: G06F 16/904 Browsing; Visualisation therefor for navigating the web G06F16/954; browsing optimisation for the web G06F16/957

Abstract

A method for rearranging the partially displayed nodes of an information hierarchy such that the lineage of displayed nodes is shown up through the root node of the hierarchy.

Claims

1. A method for optimizing an amount of information shown on a display, comprising the steps of:

a) partially displaying a hierarchical data structure, the partial display not including the root node of said hierarchical data structure;

b) selecting an item of information stored in the hierarchical data structure and visible in said display;

c) identifying other items of information linked between the item of information and said root node of the hierarchical data structure; and

d) displaying simultaneously said root of the hierarchical data structure, the item of information, and said other items of information.

2. The method according to claim 1, wherein step d) includes the step of:

i) removing from the display non-relevant items of the data structure.

3. The method according to claim 2, wherein the item of information stored in the data structure is an item selected from the group consisting of a directory name, a folder name, and a file name.

4. The method according to claim 2, wherein step b) includes the user implemented step of:

ii) pointing at the item of information with a pointing device.

5. A method of partially displaying a nodal hierarchy in a single display area, comprising the steps of:

a) partially displaying in the single display area a nodal hierarchy, the partial display not including the root node of said nodal hierarchy;

b) selecting a node from the hierarchy;

c) identifying parents and ancestors of the selected node; and

d) displaying the selected node and all said parents and ancestors, including said root node, of the selected node in the single display area.

6. The method according to claim 5, wherein step d) includes the step of:

i) removing from the single display area nodes unrelated to the selected node.

7. The method according to claim 6, wherein step b) includes the user implemented step of:

ii) pointing at the node with a pointing device.

8. The method according to claim 6, wherein step b) includes the user implemented step of:

ii) highlighting the node.

9. A method of rearranging a partially displayed data structure having a hierarchy of nodes, comprising the steps of:

a) displaying a portion of the hierarchy of nodes, said portion not including the root node of said hierarchy;

b) selecting at least one node from the displayed portion of said hierarchy of nodes;

c) finding undisplayed parent and ancestor nodes, if any, of said at least one node; and

d) simultaneously displaying said at least one node and said parent and ancestor nodes of said at least one node by selectively removing from said portion sibling nodes of said parent and ancestor nodes.

10. The method according to claim 9, wherein step b) includes the user implemented step of:

i) pointing at said at least one node with a pointing device.

11. The method according to claim 10, wherein step d) includes the step of:

ii) not displaying at least one other node unrelated to said at least one node.

12. The method according to claim 9, wherein step d) includes the step of:

i) simultaneously displaying said at least one node and said parent and ancestor nodes of said at least one node in a list fashion.

13. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for maximizing an amount of information displayed on a computer monitor, said method steps comprising:

a) partially displaying a data structures the partial display not including the root node of said data structure;

b) selecting an item of information stored in the data structure;

c) identifying other items of information linked between the item of information and said root node of the data structure; and

d) displaying simultaneously said root node of the data structure, said item of information, and said other items of information by selectively removing from said partial display siblings of said other items of information.

14. An article of manufacture for use in a computer system having an operating system for optimizing an amount of information shown on a display,

said article of manufacture comprising a computer usable medium having computer readable program code means embodied in said medium, said program code means including:

computer readable program code means embodied in said computer usable medium for causing a computer to effect the following steps;

a) partially displaying in the single display area a nodal hierarchy, the partial display not including the root node of said hierarchy;

b) selecting a node from the hierarchy;

c) identifying parents and ancestors of the selected node; and

d) displaying the selected node and the parents and ancestors of the selected node in the single display area by selectively removing from said partial display siblings of said parents and ancestors of the selected node.

15. A method for operating a computing apparatus to rearrange nodes of an information hierarchy within a single display area insufficient in size to display the complete hierarchy of nodes between the root node of said hierarchy and a selected descendent node such that the lineage of displayed nodes is shown from said selected descendent node up through said root node of the hierarchy, comprising the steps of:

preparing for display a portion of said hierarchy of nodes, the display portion not including said root node;

selecting a descendent node from said hierarchy of nodes,

identifying parent and ancestor nodes of descendent node, and displaying said descendent node together with said root node and said parent and ancestor nodes in the single display area by selectively removing from said display siblings of said parents and ancestors of the selected node.