METHOD AND SYSTEM FOR REDUCING COMPLEX TREE STRUCTURES TO SIMPLE TREE STRUCTURES BASED ON RELEVANCE

• US 20090193010A1
• Filed: 01/25/2008
• Published: 07/30/2009
• Est. Priority Date: 01/25/2008
• Status: Active Grant

• Current Assignee: LinkedIn Corporation (Microsoft Corporation)
• Original Assignee: International Business Machines Corporation
• Inventors: AYARS, Frank Raymond
• Granted Patent: US 7,822,773 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

The present invention discloses a method for reducing a tree structure in a processing system. The method includes providing a plurality of nodes in a tree structure. The method also includes querying each of the plurality of nodes based upon a threshold value, wherein the threshold is related to relevance; when a count of a particular node matches the threshold then a next child node is queried to determine if the next child node matches the threshold, if a child node does not exist for the queried node when the node is displayed. The method further includes visiting all of the parent nodes based on the querying step until all of plurality of nodes have been queried. The method finally includes displaying the nodes that satisfy the threshold value.

Claims

1. A method for reducing a tree structure in a processing system comprising;

providing a plurality of nodes in a tree structure;

querying each of the plurality of nodes based upon a threshold value, wherein the threshold is related to relevance;

when a count of a particular node matches the threshold then a next child node is queried to determine if the next child node matches the threshold, if a child node does not exist for the queried node when the node is displayed;

visiting all of the parent nodes based on the querying step until all of plurality of nodes have been queried; and

displaying the nodes that satisfy the threshold value.

2. The method of claim 1 wherein the threshold value comprises a count threshold value.

3. The method of claim 1 wherein threshold value comprises the aggregate count value of the files in a parent node and the files in the children nodes.

4. The method of claim 1 wherein each of the displayed nodes is a directory that can be activated to determine the nodes therewithin.

5. A computer readable medium containing program instructions for reducing a tree structure in a processing system;

the program instructions for;

providing a plurality of nodes in a tree structure;

querying each of the plurality of nodes based upon a threshold value, wherein the threshold is related to relevance;

when a count of a particular node matches the threshold then a next child node is queried to determine if the next child node matches the threshold, if a child node does not exist for the queried node when the node is displayed;

visiting all of the parent nodes based on the querying step until all of plurality of nodes have been queried; and

displaying the nodes that satisfy the threshold value,

6. The computer readable medium of claim 5 wherein the threshold value comprises a count threshold value.

7. The computer readable medium of claim 5 wherein threshold value comprises the aggregate count value of the files in a parent node and the files in the children nodes.

8. The computer readable medium of claim 5 wherein each of the displayed nodes is a directory that can be activated to determine the nodes therewithin.

9. A data processing system comprising:

a processor;

a memory coupled to the processor; and

a tree structure reducing cache to be executed by the processor;

the tree structure reducing code comprising providing a plurality of nodes in a tree structure;

querying each of the plurality of nodes based upon a threshold value, wherein the threshold is related to relevance;

when a count of a particular node matches the threshold then a next child node is queried to determine if the next child node matches the threshold, if a child node does not exist for the queried node when the node is displayed;

visiting all of the parent nodes based on the querying step until all of plurality of nodes have been queried; and

displaying the nodes that satisfy the threshold value.