METHOD TO EFFICIENTLY PROCESS AND PRESENT POSSIBLE ARRANGEMENTS OF A SET OF CONTIGUOUS PEER-TO-PEER LINKS

• US 20080162398A1
• Filed: 03/14/2008
• Published: 07/03/2008
• Est. Priority Date: 06/14/2002
• Status: Abandoned Application

• Current Assignee: Brendan V. Nolan, Guy M.B. Verret
• Original Assignee: Brendan V. Nolan, Guy M.B. Verret
• Inventors: Verret, Guy M.B., NOLAN, Brendan V.
• Application Number:
  US12/048,653
• Publication Number:
  US 20080162398A1
• Time in Patent Office: Days
• US Class Current: 706/55
• CPC Class Codes: G06F 16/9558 Details of hyperlinks; Management of linked annotations
• CPC Class Codes: Y10S 707/967 Peer-to-peer
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

A method for displaying nodes within a set of nodes, stored as a set of linked pairs, indulging the steps of: providing a set of nodes each configured for being selectable as at least one of a root node, an antecedent node and a descendent node; choosing interactively any node within the set of nodes as a root node; selecting any node within the set of nodes as a second node to form a linked pair of nodes; determining if a relationship between the root and second nodes is directionless or directional; determining whether the second node is antecedent or descendent of the root node; and generating and displaying a knowledge map tree from the separately arranged linked pairs.

Claims

1. A computer implemented method for displaying user-selected knowledge nodes within a set of knowledge nodes, stored as a set of linked pairs of nodes, comprising the steps of:

a) providing a set of knowledge nodes each configured for being selectable as at least one of a root node, an antecedent node and a descendent node;

b) choosing interactively any knowledge node within said set of knowledge nodes as a root node;

c) selecting any knowledge node within said set of knowledge nodes as a second of said nodes to form a linked pair of said nodes, wherein said second node is distinct from said root node;

d) determining if a relationship between said root and second nodes is directionless or directional;

e) determining whether said second node is antecedent or descendent of said root node;

f) selecting a third node from any knowledge node within said set of knowledge nodes;

g) determining if a relationship between said third node and either of said root and second nodes is directionless or directional;

h) determining whether said third node is antecedent or descendent of either of said root or said second nodes, said third node forming a separately arranged linked pair with either of said root or said second nodes;

i) repeating steps f-h with additional nodes from said set of knowledge nodes;

j) generating a knowledge map tree from said separately arranged linked pairs, each of said linked pairs individually sharing a common node; and

k) displaying said knowledge map tree.

2. The method of claim 1 further comprising generating said knowledge map tree by beginning at said root node.

3. The method of claim 2 wherein said root note is determined by a user.

4. The method of claim 1 further comprising the steps of determining a value of a direction selection switch, said value being either on or off, wherein when said direction selection switch is on, said knowledge map tree is generated using only directional said linked pairs, and when said direction selection switch is off, said knowledge map tree is generated using all linked pairs.

5. The method of claim 4 wherein said value of said direction selection switch is selected by a user.

6. The method of claim 1 further comprising the step of determining at least one amplifying factor for at least one of said knowledge nodes, wherein said knowledge map tree is generated using said at least one amplifying factor.

7. The method of claim 6 further comprising the step of regenerating said knowledge map tree using said at least one amplifying factor.

8. The method of claim 6 wherein said at least one amplifying factor is selected by a user.

9. The method of claim 6 wherein said at least one amplifying factor allows for the selection of certain of said knowledge nodes over other said knowledge nodes.

10. The method of claim 1 wherein said knowledge map tree is generated based on a value of a direction selection switch.