Distributed computer database system and method employing intelligent agents

• US 6,192,364 B1
• Filed: 07/23/1999
• Issued: 02/20/2001
• Est. Priority Date: 07/24/1998
• Status: Expired due to Term

• Current Assignee: Jarg Corporation
• Original Assignee: Jarg Corporation
• Inventors: Baclawski, Kenneth P.
• Primary Examiner(s): Amsbury, Wayne
• Assistant Examiner(s): Coby, Frantz
• Application Number:
  US09/360,011
• Time in Patent Office: 578 Days
• Field of Search: 707/10, 707/3, 707/103, 709/218, 709/217, 705/14, 706/11
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2255 Hash tables
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

A distributed computer database system connected to a network, e.g., the Internet or on an intranet, indexes interests of agents that have registered with the system, examines information objects, for example, that reside on the network, and, responsive to a match with the registered agents'"'"' interests, specifies to the agents the relevant information objects.

Claims

1. A method for object examination in a distributed computer database system having a plurality of examination nodes and a plurality of index nodes connected by a network, said method comprising the steps of:

A) extracting, by an examination node, a plurality of features from an object;

B) fragmenting each said object feature into a number of object feature fragments;

C) hashing, by said examination node, each said object feature fragments, said hashed object feature fragment having a first portion and a second portion;

D) transmitting, by said examination node, each said hashed object feature fragment to a respective one of said plurality of index nodes indicated by said first portion of each said hashed object feature fragment;

E) using, by said index node, said second portion of said respective hashed object feature fragment to access data according to a local hash table located on said index node;

F) returning, by each said index node accessing data according to said respective hashed object feature fragment, a plurality of agent identifiers corresponding to said accessed data to said examination node;

G) transmitting, by said selected examination node, each said agent identifier of said plurality of agent identifiers to a respective one of said plurality of agent nodes indicated by said first portion of each said agent identifier;

H) using, by said agent node, said second portion of said respective agent node to access data according to a local agent table located on said agent node;

I) using by said agent node, said accessed data to notify the agent identified by said agent identifier that an object has been examined that may be relevant to the said agent; and

J) transmitting, by said agent node, object information to said agent.

2. The method of claim 1 further comprising the steps of:

A) determining, by said examination node, a measure of similarity between said accessed data and said object; and

B) returning to said agent, by said examination node, accessed data having a predetermined degree of similarity, subsequent to the step of returning said plurality of agent identifiers.

3. The method of claim 2 wherein said measure of similarity is determined by a similarity function based on features possessed by both the said accessed data and the said object, and features possessed only by the said object.

4. The method of claim 1 further comprising the steps of:

A) receiving, at said examination node, an object from an agent, prior to the step of extracting features from said object; and

B) establishing communication between said agent and each agent in said plurality of agents for which the said object from said agent is determined to be relevant, after the step of transmitting object information to said plurality of agents.

5. The method of claim 4 further comprising the steps of:

A) determining, by said examination node, a measure of similarity between said accessed data and said object; and

B) returning to said agent, by said examination node, accessed data having a predetermined degree of similarity;

subsequent to the step of returning said plurality of agent identifiers.

6. The method of claim 5 wherein said measure of similarity is determined by a similarity function based on features possessed by both the said accessed data and the said object, and features possessed only by the said object.

7. A method of storing agents or locations of agents in a manner which is conducive to routing retrieval in a distributed computer database system having a plurality of examination nodes, a plurality of index nodes, and a plurality of agent nodes connected by a network, said method comprising the steps of:

A) selecting, by an examination node, a unique agent identifier for an agent submitted by a user for registration, said agent identifier having a first portion and a second portion;

B) using the said first portion of said agent identifier to select one of said plurality of agent nodes;

C) transmitting, by said examination node, agent information to said selected agent node;

D) using, by said selected agent node, said second portion of said agent identifier to store data according to a local agent table located on said agent node;

E) extracting, by said examination node, a plurality of features from an object specifying a set of interests of an agent submitted by a user for registration;

F) fragmenting each said agent feature into a number of agent feature fragments;

G) hashing, by said examination node, each said agent feature fragment, said hashed agent feature fragment having a first portion and a second portion;

H) transmitting, by said examination node, each said hashed agent feature fragment to a respective one of said plurality of index nodes indicated by said first portion of each said hashed agent feature fragment; and

I) using, by said index node, said second portion of said respective hashed agent feature fragment to store data according to a local hash table located on said index node.

8. The method of claim 7 further comprising the steps of:

A) receiving, at said examination node, an object from an agent, prior to the step of examining said object; and

B) establishing communication between said agent and each agent in said plurality of agents for which the said object from said agent is determined to be relevant, after the step of transmitting object information to said plurality of agents.

9. The method of claim 8 wherein said examination node measures similarity using a similarity function determined by features possessed by both the said accessed data and the said object;

and features possessed only by the said object.

10. The method of claim 7 wherein said examination node measures similarity using a similarity function determined by features possessed by both the said accessed data and the said agent object, and features possessed only by the said object.

11. The method of claim 10 further comprising the step of receiving, at said examination node, an agent registration request from said user, prior to the step of extracting features from said agent object.

12. A distributed computer database system having a routing retrieval tool for handling objects comprising:

A) a plurality of examination nodes, a plurality of index nodes; and

a plurality of agent nodes;

said plurality of examination nodes, said plurality of index nodes, and said plurality of agent nodes connected by a network,

B) wherein each said examination node, upon examining an object, extracts a plurality of features from said object, fragments the object features into a plurality of object feature fragments;

hashes each said object feature fragment into a hashed object feature fragment having a first portion and a second portion, and transmits each said hashed object feature fragment to a respective one of said plurality of index nodes indicated by said first portion of said hashed object feature fragment,

C) further wherein each said index node uses said second portion of said hashed object feature fragment to access data according to a local hash table located on said index node and returns a plurality of agent identifiers corresponding to said accessed data to said examination node,

D) further wherein the said examination node, upon receiving a plurality of agent identifiers from each said index node, divides each said agent identifier of said plurality of agent identifiers into a first portion and a second portion, and transmits each said agent identifier to a respective one of said plurality of agent nodes indicated by said first portion of said agent identifier,

E) further wherein each said agent node uses said second portion of said agent identifier to access data according to a local agent table located on said agent node, uses said accessed data to notify the agent identified by said agent identifier that an object has been examined that may be relevant to the said agent, and transmits object information to said agent.

13. A distributed computer database system for registration of agents, comprising:

A) a plurality of examination nodes, plurality of agent nodes, and a plurality of index nodes;

said plurality of examination nodes, said plurality of agent nodes and said plurality of index nodes connected by a network,

B) wherein each said examination node, upon receiving an object defining interests of an agent from a user, selects a unique agent identifier having a first portion and a second portion, extracts a plurality of features from said agent, fragments each said agent feature into a plurality agent feature fragments, hashes each said agent feature fragment into a hashed agent feature fragment having a first portion and a second portion, transmits agent information to a respective one of said plurality of agent nodes indicated by said first portion of said agent identifier, and transmits each said hashed agent feature fragment to a respective one of said plurality of index nodes indicated by said first portion of said hashed agent feature fragment,

C) wherein the said agent node uses said second portion of said agent identifier to store agent information in a local table, and

D) wherein each said index node uses said second portion of said hashed agent feature fragment to store the agent identifier according to a local hash table located on said index node.

14. A distributed computer database system for registration of agents, comprising:

A) a plurality of examination nodes, a plurality of agent nodes; and

a plurality of index nodes;

said plurality of examination nodes, said plurality of agent nodes and said plurality of index nodes connected by a network,

B) each said examination node, upon receiving a command from a user, enqueuing a predetermined task in response to said command,

C) a registration task enqueued, in response to a registration command from said user, selecting a unique agent identifier having a first portion and a second portion, for the agent contained in said registration command, extracting a plurality of features from said agent, fragmenting each said agent feature into a plurality of agent feature fragments;

hashing each said agent feature fragment into a hashed agent feature fragment having a first portion and a second portion, transmitting an agent message containing agent information to a respective one of said plurality of agent nodes indicated by said first portion of said agent identifier, and transmitting a registration message containing each said hashed agent feature fragment to a respective one of said plurality of index nodes indicated by said first portion of said hashed agent feature fragment,

D) said agent node, upon receipt of said agent message, using said second portion of said agent identifier to store data according to a local table located on said agent node, and

E) said index node, upon receipt of said registration message, using said second portion of said hashed agent feature fragment to store data according to a local hash table located on said index node.