Database search path designation method

• US 20040193585A1
• Filed: 01/20/2004
• Published: 09/30/2004
• Est. Priority Date: 03/28/2003
• Status: Abandoned Application

• Current Assignee: Hitachi Software Engineering Co., Ltd. (Hitachi, Ltd.)
• Original Assignee: Hitachi Software Engineering Co., Ltd. (Hitachi, Ltd.)
• Inventors: Tago, Shigeru
• Application Number:
  US10/759,100
• Publication Number:
  US 20040193585A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24542 Plan optimisation

Abstract

A search path can be easily designated between a plurality of databases for retrieving search keys and records from related databases in a chain-reactive manner. Databases that are potential search targets are displayed on a two-dimensional screen in the form of figures. Individual figures are designated using a pointing device and then key database A and terminal database D are designated out of databases A to F corresponding to the designated figures. Search keys and records are retrieved in a chain-reactive manner by following designated one or more of possible paths 302a and 302b that pass through the databases that exist between key database A and terminal database D designated on the screen.

Claims

1. A method of designating a database search path:

the method comprising;

a first step of displaying databases that can be search targets, in the form of figures on a screen;

a second step of designating individual figures and designating the databases corresponding to the designated figures as the first database and the terminal database; and

a third step of carrying out a chain-reactive retrieval of search keys and records by following two steps, one of said two steps comprising retrieving records by using a search key that is entered into a database and another of said two steps comprising entering a next search key contained in said retrieved records into next database through the search path candidates.

2. The method according to claim 1, wherein the third step includes the step of displaying the search path candidates in the form of figures by which the figures indicating the individual databases are connected.

3. The method according to claim 1, wherein the third step includes the step of narrowing the search path candidates down to only those that pass through all of the databases corresponding to designated figures other than the first database and terminal database.

4. The method according to claim 2, wherein the third step includes the step of narrowing the search path candidates to only those that pass through all of the databases corresponding to designated figures other than the first database and terminal database.

11. The method according to claim 1, wherein the third step includes the step of narrowing the search path candidates to only those that do not pass through any of the databases corresponding to designated figures other than the first database and terminal database.

12. The method according to claim 2, wherein the third step includes the step of narrowing the search path candidates to only those that do not pass through any of the databases corresponding to designated figures other than the first database and terminal database.

13. The method according to claim 1, further comprising either one or both of the following steps:

displaying, upon designation of the first database, only those figures corresponding to databases that can be designated as the first database, on the screen, preferably with a feature distinguishing them from other figures; and

displaying, upon designation of the terminal database, only those figures corresponding to databases that can be designated as the terminal database, on the screen, preferably with a feature distinguishing them from other figures.

14. The method according to claim 2, further comprising either one or both of the following steps:

displaying, upon designation of the first database, only those figures corresponding to databases that can be designated as the first database, on the screen, preferably with a feature distinguishing them from other figures; and

displaying, upon designation of the terminal database, only those figures corresponding to databases that can be designated as the terminal database, on the screen, preferably with a feature distinguishing them from other figures.

15. The method according to claim 4, further comprising either one or both of the following steps:

displaying, upon designation of the first database, only those figures corresponding to databases that can be designated as the first database, on the screen, preferably with a feature distinguishing them from other figures; and

displaying, upon designation of the terminal database, only those figures corresponding to databases that can be designated as the terminal database, on the screen, preferably with a feature distinguishing them from other figures.

16. The method according to claim 11, further comprising either one or both of the following steps:

displaying, upon designation of the first database, only those figures corresponding to databases that can be designated as the first database, on the screen, preferably with a feature distinguishing them from other figures; and

displaying, upon designation of the terminal database, only those figures corresponding to databases that can be designated as the terminal database, on the screen, preferably with a feature distinguishing them from other figures.

19. The method according to claim 12, further comprising either one or both of the following steps:

displaying, upon designation of the first database, only those figures corresponding to databases that can be designated as the first database, on the screen, preferably with a feature distinguishing them from other figures; and

displaying, upon designation of the terminal database, only those figures corresponding to databases that can be designated as the terminal database, on the screen, preferably with a feature distinguishing them from other figures.

5. (Canceled)

6. A program for causing a computer to carry out a method of designating a database search path comprising steps of:

a first step of displaying databases that can be search targets, in the form of figures on a screen;

a second step of designating individual figures and designating the databases corresponding to the designated figures as the first database and the terminal database; and

a third step of carrying out a chain-reactive retrieval of search keys and records by following two steps, one of said two steps comprising retrieving records by using a search key that is entered into a database and another of said two steps comprising entering a next search key contained in said retrieved records into next database through the search path candidates.

7. The program according to claim 6, wherein the third step includes the step of displaying the search path candidates in the form of figures by which the figures indicating the individual databases are connected.

8. The program according to claim 6, wherein the third step includes the step of narrowing the search path candidates down to only those that pass through all of the databases corresponding to designated figures other than the first database and terminal database.

9. The program according to claim 7, wherein the third step includes the step of narrowing the search path candidates down to only those that pass through all of the databases corresponding to designated figures other than the first database and terminal database.

10. The program according to claim 6, further comprising either one or both of the following steps:

displaying, upon designation of the first database, only those figures corresponding to databases that can be designated as the first database, on the screen, preferably with a feature distinguishing them from other figures; and

displaying, upon designation of the terminal database, only those figures corresponding to databases that can be designated as the terminal database, on the screen, preferably with a feature distinguishing them from other figures.

17. The program according to claim 6, wherein the third step includes the step of narrowing the search path candidates to only those that do not pass through any of the databases corresponding to designated figures other than the first database and terminal database.

18. The program according to claim 7, wherein the third step includes the step of narrowing the search path candidates to only those that do not pass through any of the databases corresponding to designated figures other than the first database and terminal database.