JPH09282332A - Data base management system and retrieval method therein - Google Patents

Abstract

PROBLEM TO BE SOLVED: To evade such a state that it takes a too long time to smoothly advance subsequent processes when retrieval is a data base is processed and as a result, the response of the whole processes becomes worse. SOLUTION: A retrieval part 2 generates retrieval result data once having retrieved one record from the data base. The retrieval result data has the retrieved record set as head information and information, indicating whether or not there is an unretrieved record, set as tail information. Then, a processing part 5 performs a process based upon a program for the record in the retrieval result data and sends the retrieval result data back to the retrieval part 2 while passing the result of the process to an output part 8. The retrieval part 2 judges whether or not retrieval should be done again from the tail information in the retrieval result data.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a database management system for searching a plurality of records for a record matching a search condition and executing a predetermined process on the searched record.

[0002]

2. Description of the Related Art Conventionally, in one database,
A database management system is widely used in which a search is performed under a certain search condition and a process based on another database or program is performed on the searched record. In such a database management system, first, one database is searched under desired conditions, and when all the searches are completed, other databases and programs are used to retrieve those searched records. On the other hand, the desired processing is executed. After the processing is completed for all the retrieved records, the result of the processing is displayed on the display or printed by the printer device.

[0003]

However, in the conventional database management system, when searching one database, the number of records stored as a database is extremely large, or the number of records matching the search condition ( So-called number of hit records)
If the number is too large, it takes a lot of time to start the subsequent processing. In addition, the results of search / processing are displayed or printed only after the processing based on other subsequent databases or programs is performed, so if the former search processing takes a long time, the database management You can't know to what extent the system is actually processing. Therefore, there is a problem that the operator of the system cannot determine how long it takes to complete all the processes, or whether the system itself is operating normally.

[0004]

The present invention employs the following structure in order to solve the above problems. <Structure 1> A database storage unit that stores a database including a plurality of records, a program storage unit that stores a program instructing a process to be performed on records retrieved from the database, and search conditions for records to be retrieved Input section for inputting, a search section for searching records matching the search condition in the database, a record management section for checking whether or not one corresponding record has been searched, and a record that has not been searched yet. Search management section to check if there is, and the searched 1
A database management system comprising: a processing unit that executes a process based on the program for one record; and an output unit that outputs one record processed based on the program.

<Content of structure> A record is data composed of various items. A database is a set of records. The program only needs to be subjected to some processing with respect to the record retrieved on the database, and it does not matter whether it is an operation flowchart or a database.

<Operation and Effect> In this system, the search unit searches the database stored in the database storage unit for a record that matches the input search condition. During the search, when the record management unit confirms that only one record has been searched, the processing unit further advances the search for a record that matches the search condition and the processing unit does not search the one record. On the other hand, the processing based on the program stored in the program storage unit is executed. Then, the output unit outputs the result of the processing. Therefore, after searching all the records that match the search condition on the database, the operation based on the program is not performed on all the records. Therefore, a large amount of memory for temporarily storing all retrieved records is not required. Further, since it is not necessary to write or read a large number of retrieved records in the memory, it is possible to reduce the overall processing time. Furthermore, since the contents of the records that have been searched and subjected to a predetermined process can be sequentially confirmed, it is possible to easily determine whether or not the system is operating normally.

<Structure 2> In the database management system of Structure 1, search result data is exchanged between the search unit and the processing unit, and the search result data is composed of head information and tail information, and the head information is The database management system is a searched record, and the tail information is information regarding whether or not there is a record that has not been searched yet.

<Contents of Configuration> The search result data is data exchanged between the search unit and the processing unit. When the search result data is transferred from the search unit to the processing unit, When it is a command signal requesting execution of processing based on a program, but when it is passed from the processing unit to the search unit, the processing for that record is completed, and search can be restarted as necessary. Is a command signal for requesting.

<Operation and Effect> In this system, when a record matching the search condition is searched for in the database, the record and a record that matches the search condition but is not searched at that time are searched. Search result data, which includes information indicating whether or not there is, is transferred from the search unit to the processing unit. Further, at the time when the processing based on the program is executed on the record delivered to the processing unit, the search result data at that time is directly transferred from the processing unit to the searching unit. This makes it possible to ensure that the processing unit executes the processing based on the program only for the record located in the head information, and the search unit is based on the information regarding the presence or absence of the unsearched record located in the tail information. Thus, it is possible to easily determine whether or not the search should be restarted.

<Structure 3> A search condition for a search in a database composed of a plurality of records is input, a record matching the search condition is searched in the database, and only one record satisfying the search condition is searched. Is detected, the process based on the program is executed for the one record, one record processed according to the program is output, and the input search condition is satisfied again in the database. A method for searching a database management system, characterized by searching for records. <Content of Configuration> This is a search method corresponding to the database management system of Configuration 1.

<Structure 4> In the search method of the database management system of Structure 3, search result data is exchanged between the search process in the database and the execution process based on the program, and the search result data is transferred to the head information. And a tail information, the head information is a searched record, and the tail information is information regarding whether or not there is a record that has not been searched yet. <Content of Configuration> This is a search method corresponding to the database management system of Configuration 2.

[0012]

BEST MODE FOR CARRYING OUT THE INVENTION Next, a database management system of the present invention will be described with reference to embodiments. <Structure of Concrete Example> FIG. 1 is a block diagram of this database management system. This system includes an input unit 1, a search unit 2, a record management unit 3, a search management unit 4, a processing unit 5,
Database storage unit 6, program storage unit 7, output unit 8
It is composed of The input unit 1 has a function of inputting search conditions and a command for this system. Under the search condition input from the input unit 1, the search unit 2 searches for a record that satisfies the condition in a database stored in a database storage unit 6 described later. At this time, the record management unit 3 manages whether or not only one record is searched, and the search management unit 4 satisfies the search condition,
It manages whether there is a record that has not been searched yet. The processing unit 5 executes a process based on the program stored in the program storage unit for the retrieved record. The output unit 8 displays or prints the record processed by the processing unit 5.

<Operation of Specific Example> Next, the operation of the database management system will be described. FIG. 2 is an operation flowchart of this system. In addition, FIG. 3 shows one of the databases stored in the database storage unit 6.
"Employee information database", which is shown in Fig. 4.
One of the programs stored in the program storage unit 7 is a “commemorative gift presentation program for 10 years of permanent work”. "Employee information database" is the employee number of all employees. , Information such as name, gender, affiliation, position, date of joining the company, date of birth, etc.
"Souvenir donation program for the year" is a program that determines what kind of souvenir to be presented according to gender and the like. The operation of this system will be described below with reference to the operation flowchart and the contents of those databases and programs.

Step S10: The input unit 1 is input with information such as a database to be searched, a search condition, a program to be executed, and the like. For example, <Employee information database> as the “database to be searched”
Enter as "Search condition"<10 years of service>
(More specifically, the date of joining the company is 10 years ago) is input, and as a "program to be executed", a "souvenir donation program for 10 years of permanent work" is input. Step S11: The search unit 2 specifies a database “employee information database” based on the input information.
Above, the applicable record is searched under the search condition.

Step S12: The record management section 3
The search unit 2 monitors whether or not one corresponding record has been searched. Here, <Taro Yamada> is searched first in the <Employee Information Database>. Step S13: When the record management unit 3 confirms that only one corresponding record has been retrieved, as shown in FIG. 5, the retrieved record <Taro Yamada> is used as the head information in the retrieval result data A. Set. Step S14: The search management unit 4 checks whether there is a record that has not been searched yet. From this, it is learned that there is <Kobayashi Hanako> as a record that has not been searched yet.

Step S15: When it is known that there is a record that has not been searched yet, the search management unit 4, as shown in FIG. 5, as tail information in the search result data A, includes a record that has not been searched. The information indicating that it is set is set. In this way, the nested search result data A is created. Then, the search unit 2 delivers the search result data A to the processing unit 5. When all the records have been searched, that is, when there is no record that matches the search condition but has not been searched yet, the search management unit 4 notifies the tail information in the search result data. As, information indicating that all records have already been searched is set.

Step S16: The processing section 5 executes a predetermined process for the retrieved one record <Taro Yamada> based on the designated program “a souvenir presenting program for 10 years of permanent work”. This allows
A souvenir <tie> will be presented to the retrieved record <Taro Yamada>. Step S17: The processing section 5 records the record <Taro Yamada>.
And deliver the two results of souvenir <tie> to the output unit 8. At the same time, the processing unit 5 returns the search result data A to the search unit 2 as it is. Step S18: The output unit 8 displays the received result on a display not shown or prints it by a printer device not shown.

Step S19: The search unit 2 includes the processing unit 5
When the search result data A is received from
Analyze the tail information in. As a result, it is known that there is a record that has not been searched yet. If information indicating that all records have already been searched is set, the search will not be restarted. Step S20: The search unit 2 restarts the search in the database <employee information database> under the search condition input in step S10, as in step S11. As a result, the next record <Hanako Kobayashi> that satisfies the search condition is searched. Hereinafter, step S
Similar to the operation after 12, the search result data B is created based on one searched record <Hanako Kobayashi>. Also, regarding the record <Hanako Kobayashi> himself,
A souvenir <scarf> will be presented by executing the processing of the “souvenir donation program for 10 years of permanent work”.

In the above-mentioned specific example, the case where a souvenir is presented to an employee himself who has been a permanent employee for 10 years has been described. However, the present invention can also be applied to a case where a family member of an employee who has achieved permanent work is presented with a souvenir. For example, the child of an employee who has achieved 30 years of permanent work is presented with a souvenir <gift certificate>, and the grandchildren of the employee are presented with a souvenir <stationery>. Based on the program “A program for presenting souvenirs to the families of employees who have worked for 30 years of permanent work”, the process of presenting souvenirs will be described with reference to the tree structure diagram of FIG.

First, the database <employee information database> is searched for an employee <Shotaro Takahashi> who has achieved 30 years of permanent work, and the process of presenting a souvenir <watch> to the employee <Shotaro Takahashi> is completed. Next, in the database <Employee family information database>, the child <Ichiro Takahashi> is searched by searching the family of the employee <Shotaro Takahashi>, and a souvenir <gift certificate> is given to this child <Ichiro Takahashi>. Complete the gifting process. Similarly, in the database <employee family information database>, by searching for the child of the child <Ichiro Takahashi>, the grandchild <Momoko Takahashi> is searched, and the grandchild <Momoko Takahashi> is a souvenir <stationery>. Complete the process of presenting. When executing these searches, in the first search, the employee <Shotaro Takahashi> is set as the head information of the search result data, and the information indicating that there is a child <Ichiro Takahashi> etc. is set as the tail information. . Similarly, in the next search, the child <Ichiro Takahashi> is set as the head information of the search result data, and the grandchild <Momoko Takahashi> is set as the tail information.

When the processing up to the grandchild <Momoko Takahashi> is completed,
By searching for the child of the employee <Shotaro Takahashi> again, the child <Jiro Takahashi> is searched, and this child <Jiro Takahashi>
The process of presenting a souvenir <gift certificate> is completed. In this way, when the search / processing is performed with priority given to the depth of the search, that is, what is presented to what family of which employee rather than what is presented to which employee. When the present invention is applied to a search / processing that prioritizes the clarification of the above, the search result (in this example, a family such as Shotaro Takahashi and Ichiro Takahashi) and the result of the processing for the search result (In this example, souvenirs such as watches and products)
And can be sequentially confirmed. After the search and processing for employee <Shotaro Takahashi> is completed, the search and processing for another employee <Kazuo Sasaki> will be performed.

[Brief description of drawings]

FIG. 1 is a block diagram of the present invention.

FIG. 2 is an operation flowchart of the present invention.

FIG. 3 is a diagram showing a database.

FIG. 4 is a diagram showing a program.

FIG. 5 is a diagram showing search result data.

FIG. 6 is a tree structure diagram of a search / process that prioritizes depth.

[Explanation of symbols]

 1 input section 2 search section 3 record management section 4 search management section 5 processing section 6 database storage section 7 program storage section 8 output section

Claims (4)

[Claims] 1. A database storage unit for storing a database composed of a plurality of records, a program storage unit for storing a program for instructing processing to be performed on the records retrieved from the database, and retrieval of records to be retrieved. An input section for entering conditions, a search section for searching records matching the search conditions in the database, a record management section for checking whether or not one corresponding record has been searched, and a search section that has not been searched yet. A search management unit that confirms whether there is a record, a processing unit that executes processing based on the program for one searched record, and an output unit that outputs one record processed based on the program A database management system comprising: 2. Search result data is exchanged between a search unit and a processing unit, and the search result data is composed of head information and tail information, the head information being a searched record, and the tail information being The database management system according to claim 1, which is information regarding whether or not there is a record that has not been searched yet. 3. A search condition for a search in a database composed of a plurality of records is input, a record matching the search condition is searched for in the database, and only one record satisfying the search condition is searched. Is detected, the process based on the program is executed for the one record, and one record processed according to the program is output, and another record that satisfies the input search condition is again in the database. A method for searching a database management system, characterized by searching for. 4. Search result data is exchanged between a search process in a database and an execution process based on a program, and the search result data comprises head information and tail information, and the head information is searched. 4. The database management system according to claim 3, wherein the tail information is information regarding whether there is a record that has not been searched yet.