JP2000268052A - Data processing system and recording medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To avoid the variation of instruction execution by retrieving a request definition table based on a retrieving request to compose an executing sentence, preparing an executable executing instruction from the executing sentence and retrieving a database based on the executing instruction to access. SOLUTION: An inputting means 2 prepares a retrieving request to transmit to a managing server 3, which is connected to a LAN, etc., to manage all the clients 1. Then, based on a retrieving request from the client 1, a sentence composing means 4 retrieves a request definition table 5 to compose an executing sentence and an executing instruction preparing means 7 prepares an executable executing instruction from the composed executing sentence. In addition, based on the executing instruction, a retrieving means 8 retrieves a DB(data base) 9 to access. Thus, it is possible to avoid the variation of the description of the executing instruction.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data processing system for searching a database for processing and a recording medium.

[0002]

2. Description of the Related Art Conventionally, an execution instruction (operation instruction) for a database is described in each processing program. Therefore, when a table name or a physical arrangement position of a table in the database is changed, a related processing is performed. All programs were checked, the descriptions in all the processing programs were individually corrected, and the programs were compiled to re-create executable modules.

[0003] In addition, the person in charge of developing the processing program makes the description of the execution instructions different, which causes variations in the performance of accessing the tables in the database and variations in the quality of the program. It took a lot of time.

[0004]

As described above, according to the conventional mechanism, an execution instruction for a database is described in a processing program. Therefore, when a table name or arrangement position in the database is changed, a related instruction is not executed. It is necessary to check all of the processing programs to be performed and correct the descriptions, and further, it is necessary to recompile, and it is difficult to change the table names in the database.

[0005] In addition, there has been a problem that the execution instructions of the database in the processing program are variously described, causing variations in performance. In order to solve these problems, the present invention refers to a request definition table defined in advance at the time of a search request from a client, issues a corresponding executable statement, and executes an executable instruction executable by the DB server on the receiving side. By performing database search and performing access by converting it to a database, it is possible to deal with changes in the database table name, etc., only by changing the request definition table. The purpose is to avoid this and to stabilize performance and eliminate variations.

[0006]

Means for solving the problem will be described with reference to FIG. In FIG. 1, a client 1 is a terminal operated by a user.
And so on.

The input means 2 is for inputting a search request. The management server 3 collectively manages search requests from the clients 1, and here is composed of a sentence assembling means 4, a request definition table 5, and the like.

The statement assembling means 4 searches the request definition table 5 based on the search request and assembles an execution statement. The request definition table 5 defines and registers an execution statement or the like in association with a search request.

The DB server 6 searches and accesses the DB 9 and includes an execution instruction creating unit 7 and a searching unit 8. The execution instruction creation means 7 creates an executable execution instruction from an execution statement.

The search means 8 is for actually searching and accessing the DB 9. Next, the operation will be described. The input means 2 inputs and transmits a search request, and the sentence assembling means 4 assembles and transmits an executable sentence by referring to the request definition table 5 when a search request is issued, and the execution instruction creating means 7 converts the executable An executable instruction is created, and the search unit 8 searches the DB 9 based on the executable instruction and accesses the DB 9.

At this time, the request definition table 5 and the statement assembling means 4 are provided in a common management server 3 for all clients connected by a network, and the execution instruction creating means 7 and the searching means 8 are provided by a DB server 6 for accessing a database.
Is provided.

Further, definition information such as a table name in a database defined in the request definition table 5 and D
B9 is changed, added or deleted in association with the definition information existing in B9.

Therefore, when a search request from the client 1 is made, a corresponding execution statement is issued by referring to the request definition table 5 defined in advance, and is converted into an execution instruction executable by the DB server 6 on the receiving side. By performing the database search and accessing, even if the database table name or the like is changed, it is possible to cope with only the change in the request definition table 5 and to avoid the situation where the description of the conventional execution instruction is separated. Performance can be stabilized and variations can be eliminated.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the embodiment and operation of the present invention will be described in detail sequentially with reference to FIGS.

FIG. 1 shows a system configuration diagram of the present invention.
In FIG. 1, a client 1 is a terminal connected to a LAN or the like and operated by a user, and here comprises an input unit 2 and the like.

The input means 2 is for inputting a search request, and creates a search request shown in FIG. The management server 3 is a LAN
To manage all the clients 1 by connecting them to each other. Here, it manages the search requests from the clients 1 collectively, and comprises a sentence assembling means 4 and a request definition table 5. It is.

The statement assembling means 4 searches the request definition table 5 based on a search request from the client 1 to assemble an executable statement (see FIG. 3). The request definition table 5 defines and registers an execution statement and the like in association with the search request number (see FIGS. 3 and 4).

The DB server 6 searches and accesses the DB 9 and includes an execution instruction creating unit 7 and a searching unit 8. The execution instruction creation means 7 creates an executable execution instruction from the execution statement notified from the management server 3 (see FIG. 3).

The search means 8 is for actually searching and accessing the DB 9 based on the execution instruction created by the execution instruction creation means 7. The DB 9 is a database in which a large amount of data is registered for easy retrieval.

The gateway server 11 connects a LAN (for example, an in-house LAN) and a client 13 via a router 12 and a line (or a network), and performs secure two-way data communication.

The router 12 connects the LAN with other lines, networks, and the like. Client 13
Is a client connected to a line or a network (for example, the Internet), which is composed of the input means 2 described above.
The DB 9 can be accessed in the same manner as described above.

Next, the operation of the configuration of FIG. 1 will be described in detail according to the order shown in the flowchart of FIG. FIG. 2 is a flowchart illustrating the operation of the present invention. Here, the client 1, the management server 3, and the DB server 6 are the same as those of the same numbers in FIG.

In FIG. 2, S1 issues a search request. This is because the input means 2 constituting the client 1 shown in FIG.
Create and issue 1 search request.

In step S2, an executable statement corresponding to the request is extracted. This is because the statement assembling means 4 constituting the management server 3
Referring to the request definition table 5 based on the request definition number in the search request issued in S1, the corresponding executable statement (for example, S
QL sentence).

In step S3, the executable statement extracted in step S2 is transmitted to the DB server 6. In S4, the DB server 6 receives the executable statement transmitted in S3. S5 is converted into an SQL instruction. This is converted into an SQL command, which is an executable command, based on the execution statement received by the command generator 7 constituting the DB server 6 (described later with reference to FIG. 3).

Step S6 is executed. SQL created in S5
The DB 9 is searched and accessed based on the instruction. S7 is
Submit the result.

In step S8, transmission is performed. This is the management server 3
Sends the result received from the DB server 6 to the client 1. In step S9, the result transmitted in step S8 is received.

At S10, processing is performed based on the result received at S9. As described above, when the client 1 issues a search request, the management server 3 assembles the search request into an executable statement and transmits it to the DB server 6, and the DB server 6 executes the executable statement (eg, an SQL command). The client can automatically receive a search result simply by issuing a search request by searching for and accessing the DB 9. As will be described later, when definition information such as a table name in the DB server 9 is changed, added, or deleted, the corresponding table name in the request definition table 5 may be changed, added, or deleted. It is only necessary for the administrator to manage only the request definition table 5 without having to be aware of the processing program described above, so that extremely high-quality searches can be provided to all clients 1.

FIG. 3 shows an explanatory diagram of the present invention. here,
Upper client 1, management server 3, DB server 6
Are the same as those of the same numbers in FIGS. In FIG. 3, S11 shows an example of a search request. The search request shown below is created by the client 1 in FIG. 1 and transmitted to the management server 2 to request a search of the DB 9.

Request definition number: Return method: Parameter: Here, the request definition number is a number when a search request is made, and is a request definition number registered in a request definition table 5 in FIG. And for performing the search set in the instruction content. The return method specifies a return method when the DB 9 is searched and the search result is obtained. 01 (memory table: set search results in the memory table and return), 02 (data retrieval: search result) Data and return). The parameter is the content to be searched (for example, product code =% 1).

Step S12 shows how the management server 3 that has received the search request in step S11 searches the request definition table 5 for a matching request definition number. S13 is S12
Shows a state in which a matching SQL sentence is retrieved by searching with.

S14 shows a state in which the DB server 6 which has received the notice of the SQL sentence of S13 adds an SQL-MSG (message of the SQL sentence) and converts it into an SQL instruction. S1
5 indicates a converted executable SQL instruction. Here, the conversion is performed as shown below.

The EXEC SQL & SQL-MSG S16 executes the SQL instruction of S15, searches the DB 9 and accesses it. As described above, only when the client 1 issues a search request, the management server 3 automatically
Statement to the DB server 6, and the DB server 6
An SQL instruction is created from the statement, executed, the DB 9 is actually searched and accessed, the result is notified to the client 1 by a specified return method, and the client 1 can receive the result.

In the above-mentioned state of FIG. 3, the name of the product DB in the DB 9 is changed to the result DB, or
In the case where the search is performed from the result DB, the product DB in the corresponding SQL statement in the request definition table 5 uniquely managed by the management server 3 is changed to the result DB in the lower SQL statement. Only by making the changed request definition table 5, it becomes possible to easily change the target of the search request from all the clients 1 from the product DB to the result DB without notifying or making the client aware of it.

FIG. 4 shows an example of a request definition table according to the present invention. This is a table uniquely managed by the management server 3 of FIG. 1, and is used to register and manage the following information shown in the figure.

Request definition number: Processing mode: Return method: Instruction content: Other: The request definition number is a unique number for the client 1 to specify the content of the search request. The processing mode is for setting processing modes such as 01 (immediate processing) and 02 (delayed batch). The return method specifies a method of notifying a search result (for example, setting a search result in a memory table and returning). The instruction content sets the instruction content (SQL sentence) for searching the DB9. Is an instruction content (SQL sentence) for searching the product DB for data in a range in which the product code and the year and month are specified (the range specified by the parameter in the search request in S11 of FIG. 3 from the client).

[0037]

As described above, according to the present invention,
At the time of a search request from the client 1, a corresponding execution statement is issued with reference to a request definition table 5 defined in advance, converted into an execution instruction executable by the DB server 6 on the receiving side, and a database search is performed. Since the access structure is adopted, even if the table name of the database is changed, it is possible to cope with only the change in the request definition table 5 and to avoid the situation where the description of the conventional execution instruction is separated. Performance can be stabilized and variations can be eliminated.

[Brief description of the drawings]

FIG. 1 is a system configuration diagram of the present invention.

FIG. 2 is a flowchart illustrating the operation of the present invention.

FIG. 3 is an explanatory diagram of the present invention.

FIG. 4 is an example of a request definition table according to the present invention.

[Explanation of symbols]

 1, 13: client (terminal) 2: input means 3: management server 4: sentence assembling means 5: request definition table 6: DB server 7: execution instruction creating means 8: search means 9: DB (database)

Claims (4)

[Claims] In a data processing system for searching and processing a database, a table for registering an execution statement in association with a search request, and a statement for assembling an execution statement by referring to the table when a search request is issued. A data processing system comprising: assembling means; execution instruction creating means for creating an execution instruction from the assembled execution statement; and search means for searching and accessing a database based on the execution instruction. 2. The system according to claim 1, wherein said table and said statement assembling means are provided in a common management server for all clients connected via a network, and said execution instruction creating means and said retrieval means are provided in a server accessing a database. The data processing system according to claim 1, wherein: 3. The method according to claim 1, wherein the definition information such as a table name in the database defined in the table and the definition information existing in the database are changed, added or deleted in association with each other. Alternatively, the data processing system according to claim 2. 4. A means for registering an executable statement in a table in association with a search request, a statement assembling means for assembling an executable statement by referring to the table when a search request is made, and executing from the assembled executable statement A computer-readable recording medium that records an execution instruction creating unit that creates an instruction, and a program that functions as a search unit that searches and accesses a database based on the execution instruction.