Hypercube topology based advanced search algorithm

• US 20060026153A1
• Filed: 07/27/2004
• Published: 02/02/2006
• Est. Priority Date: 07/27/2004
• Status: Abandoned Application

• Current Assignee: Srikanth P. Soogoor
• Original Assignee: Srikanth P. Soogoor
• Inventors: Soogoor, Srikanth P.
• Application Number:
  US10/899,694
• Publication Number:
  US 20060026153A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24524 Access plan code generation and invalidation; Reuse of access plans

Abstract

The present invention is a system and method of conducting an adaptive search from a plurality of data sources utilizing a hypercube topology. The system includes a search engine which utilizes a hypercube architecture having a plurality of hypercubes. Each hypercube indexes several data sources in a manner such that similar data sources are located in proximity with other similar data sources. In addition, the search engine utilizes a plurality of message passing ants providing a signal of a path taken for other message passing ants to follow.

Claims

1. An adaptive searching system, said system comprising:

a search engine for receiving and processing search queries, the search engine utilizing an adaptive search algorithm;

an interface device for communicating with the search engine, the interface device providing a communication link between a user providing a search query to the search engine; and

a plurality of data sources;

the search algorithm having an index of the plurality of data sources;

whereby the search engine utilizes a plurality of message passing ants, each message passing ant searching the indexed plurality of data sources to answer the search query and depositing a signal of a path traversed, thereby allowing other message passing ants to follow the path taken by a previous message passing ant.

2. The adaptive searching system of claim 1 wherein the search algorithm indexes the plurality of data sources by forming the data sources into a hypercube topology, the hypercube topology including a plurality of cubes associated with one or more data source, whereby data sources are arranged in proximity to other data sources based upon a similarity of the information possessed by each data source.

3. The adaptive searching system of claim 2 wherein each message passing ant provides a results message to the search engine.

4. The adaptive searching system of claim 3 wherein a search by a message passing ant of a cube is terminated when a search result is negative.

5. The adaptive searching system of claim 1 further comprising:

a plurality of corporate databases, each corporate database storing data related to a specific business enterprise;

a business intelligence engine having a process and rules protocol to determine at least one corporate database providing information associated with the search query.

6. The adaptive searching system of claim 1 further comprising a data discovery router for determining the data sources to respond to the search query from the user.

7. An adaptive searching algorithm responding to a search query from a user through an interface device, the algorithm comprising:

a search engine for receiving and processing search queries;

means for indexing a plurality of data sources;

a plurality of message passing ants, each message passing ant providing a signal of a path followed in searching the plurality of data sources in response to the search query;

whereby other message passing ants follow the signal deposited by a previous message passing ant while searching the plurality of data sources.

8. The adaptive searching algorithm of claim 7 wherein:

the means for indexing a plurality of data sources includes utilizing a hypercube architecture having a plurality of hypercubes, each hypercube having a plurality of nodes associated with the data sources; and

the data sources being indexed in a manner where data sources are positioned in proximity to each other based on similarity of information of the data sources.

9. The adaptive searching algorithm of claim 8 wherein:

a scoutmaster directs the plurality of message passing ants;

whereby the message passing ants follow paths having a deposited signal in response to the search query.

10. A method of adaptively searching a plurality of data sources within a network, the method comprising the steps of:

indexing the plurality of data sources;

sending a search query to a search engine by a user;

sending a plurality of message passing ants to the data sources searching an answer to the search query;

depositing a signal by a first message passing ant to indicate a path traversed by the message passing ant during the search;

determining by a second message passing ant the path taken by the first message passing ant in search of an answer to the search query;

following, by the second message passing ant, the path of the first message passing ant to answer the search query; and

providing a response to the search query by at least one message passing ant searching the plurality of data sources.

11. The method of adaptively searching a plurality of data sources of claim 10 wherein the step of indexing the plurality of data sources includes arranging the data sources into a hypercube topology wherein each data source is positioned in proximity to another data source based on the similarity of information possessed by each data source.

12. A searching algorithm providing an indexed hypercube topology, the searching algorithm comprising:

a plurality of data sources;

a plurality of cubes, each cube having a plurality of nodes;

each data source being indexed with a node of a cube;

whereby each data source is positioned in proximity to another data source based on a similarity of information of the data sources.

13. The searching algorithm of claim 12 wherein the plurality of cubes are grouped into a hypercube.

14. The searching algorithm of claim 13 further comprising a search engine for receiving and processing search queries, the search engine utilizing the search algorithm.

15. The searching algorithm of claim 14 further comprising:

a plurality of message passing ants, each message passing ant providing a signal of a path followed in searching the plurality of data sources in response to a search query;

whereby other message passing ants follow the signal provided by a previous message passing ant while searching the plurality of data sources.

16. The searching algorithm of claim 15 wherein the message passing ants continue a heuristic process of searching the data sources, whereby message passing ants follow paths utilized by previous message passing ants.

17. The searching algorithm of claim 16 further comprising a scoutmaster directing the plurality of message passing ants within the search of the hypercube topology.

18. The searching algorithm of claim 17 wherein each message passing ant provides a results message defining the success of the search.

19. The searching algorithm of claim 12 further comprising:

a corporate database associated with a business enterprise; and

a business intelligence controlling search queries associated with the corporate database.

20. The searching algorithm of claim 19 wherein the business intelligence responds to the search query based upon the origin of the search request.