Method to efficiently process and present possible arrangements of a set of contiguous peer-to-peer links

• US 20030233362A1
• Filed: 06/14/2002
• Published: 12/18/2003
• Est. Priority Date: 06/14/2002
• Status: Active Grant

• Current Assignee: Integrated Knowledge Solutions Incorporated
• Original Assignee: Integrated Knowledge Solutions Incorporated
• Inventors: Nolan, Brendan V., Verret, Guy M.B.
• Granted Patent: US 7,359,904 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• 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

In a set of knowledge nodes with contiguous peer-to peer relationships, a method of displaying the knowledge nodes comprising the steps of choosing any knowledge node within the set of knowledge nodes as a root node; dynamically creating a tree from the root node, the tree being created by selecting a contiguous relationship in which one of the knowledge nodes in the relationship corresponds with the node at a tip of the tree; checking to see whether this knowledge node is a real or virtual leaf and if this is the case deducing that the branch of the tree is fully developed after adding this knowledge node to the tree; locating and developing successive branches through repeating the selecting, checking, adding and locating steps until all branches are fully developed.

Claims

1. In a set of knowledge nodes with contiguous peer-to peer relationships, a method of displaying the knowledge nodes comprising the steps of:

choosing any knowledge node within said set of knowledge nodes as a root node

dynamically creating a tree from said root node, said tree including a plurality of branches, the tree being created by;

selecting a contiguous relationship In which one of said knowledge nodes in said relationship corresponds with the node at a tip of said tree;

checking to see whether said knowledge node is a real or virtual leaf;

adding said knowledge node to a branch of said tree currently being developed and deducing that said current branch is fully developed if said knowledge node is a real or virtual leaf;

adding said knowledge node to said tree if it is not a real or virtual leaf; and

repeating said selecting, checking and adding steps until each of said plurality of branches is fully developed.

2. The method of claim 1 wherein the step of checking to see whether a knowledge node is a virtual leaf comprises the steps of:

marking said knowledge node as a virtual leaf if said knowledge node is within the current branch of said tree; and

marking said knowledge node as a virtual leaf if it exists in an already developed branch.

3. The method of claim 1 wherein said contiguous peer-to-peer relationships are directionless.

4. The method of claim 3 wherein said step of selecting a contiguous relationship comprises selecting said one of said knowledge nodes as said antecedent knowledge node.

5. The method of claim 1 wherein said contiguous peer-to-peer relationships are directional and specify a first knowledge node as an antecedent knowledge node and a second knowledge node as a descendent knowledge node.

6. The method of claim 2 wherein said set of knowledge nodes with contiguous peer-to-peer relationships is created using the steps of:

defining the scope of a new knowledge node;

defining the relationship between said new knowledge node and other knowledge nodes within said set of knowledge nodes;

7. The method of claim 2 wherein each said knowledge node consists of an internet web page.

8. The method of claim 2 wherein said method is used for the creation of interactive documents by specifying parts of said interactive documents as knowledge nodes and creating said relationships.