Method and system for reducing complex tree structures to simple tree structures based on relevance of nodes using threshold values

• US 7,822,773 B2
• Filed: 01/25/2008
• Issued: 10/26/2010
• Est. Priority Date: 01/25/2008
• Status: Expired due to Fees

• Current Assignee: LinkedIn Corporation (Microsoft Corporation)
• Original Assignee: International Business Machines Corporation
• Inventors: Ayars, Frank Raymond
• Primary Examiner(s): Corrielus; Jean M
• Application Number:
  US12/020,473
• Publication Number:
  US 20090193010A1
• Time in Patent Office: 1,005 Days
• Field of Search: 707/790, 707/791, 707/797, 707/999.005
• US Class Current: 707/790
• 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, wherein the plurality of nodes comprise parent nodes and children nodes;

querying each of the plurality of nodes based upon a threshold value, wherein the threshold comprises a value used to determine the relevance of each of the plurality of nodes, wherein threshold value comprises an aggregate count value of the records in a particular parent node and the records in the children nodes of the particular parent node;

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, wherein the count for the particular node comprises the number of records in a directory that satisfy a particular rule, when a child node does not exist for the queried next child node then the next child node is displayed;

determining when the particular node has an additional next child, responsive to the particular node having an additional next child, determining when an additional count of the additional next child matches the threshold;

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

displaying the nodes that satisfy the threshold value, wherein each of the displayed nodes is a directory that is activated to determine the nodes therewithin.

2. 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, wherein the plurality of nodes comprise parent nodes and children nodes;

querying each of the plurality of nodes based upon a threshold value, wherein the threshold comprises a value used to determine the relevance of each of the plurality of nodes, wherein threshold value comprises an aggregate count value of the records in a particular parent node and the records in the children nodes of the particular parent node;

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, wherein the count for the particular node comprises the number of records in a directory that satisfy a particular rule, when a child node does not exist for the queried next child node then the next child node is displayed;

determining when the particular node has an additional next child, responsive to the particular node having an additional next child, determining when an additional count of the additional next child matches the threshold;

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

displaying the nodes that satisfy the threshold value, wherein each of the displayed nodes is a directory that is activated to determine the nodes therewithin.

3. 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, wherein the plurality of nodes comprise parent nodes and children nodes;

querying each of the plurality of nodes based upon a threshold value, wherein the threshold comprises a value used to determine the relevance of each of the plurality of nodes, wherein threshold value comprises an aggregate count value of the records in a particular parent node and the records in the children nodes of the particular parent node;

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, wherein the count for the particular node comprises the number of records in a directory that satisfy a particular rule, when a child node does not exist for the queried next child node then the next child node is displayed;

determining when the particular node has an additional next child, responsive to the particular node having an additional next child, determining when an additional count of the additional next child matches the threshold;

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

displaying the nodes that satisfy the threshold value, wherein each of the displayed nodes is a directory that is activated to determine the nodes therewithin.