JPH0883284A - Information processing system - Google Patents

Abstract

PURPOSE: To easily predict the response time of an information processing system including a relational data base machine. CONSTITUTION: A front end workstation 2a controlling a relational data base machine 1 preserves a retrieval pattern and response time in a file A when a retrieval is performed. The front end workstation 2a preserves the various kinds of retrieval patterns for the retrievals performed in the past, and the maximum value, the minimum value and the average value of the response time corresponding to each retrieval pattern in a file B, and displays these of data on a terminal 3. Thus, when the retrieval is started, the prediction of the response time required for the retrieval by the retrieval pattern becomes easy.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information processing system for automatically displaying data necessary for predicting a response time required for a search before searching a relational database for a specified item.

[0002]

2. Description of the Related Art FIG. 5 is a block diagram showing the configuration of a conventional information processing apparatus. In FIG. 5, reference numeral 1 is a relational database machine dedicated to a database for extracting data from a relational database at high speed, and 2 is a front-end work connected to the relational database machine 1 for processing information input from the outside and giving it to the relational database machine 1. station,
A terminal 3 is connected to the front-end workstation 2 through a communication network or the like and has a display screen for inputting search conditions and displaying search results.

When performing a search, an operator selects an item using the terminal 3, for example. Data on the input item is transmitted from the terminal 3 to the front-end workstation 2 through, for example, a communication line network.

In the front-end workstation 2, the relational database machine 1 is instructed on the item to be searched based on the data inputted from the terminal 3.

The relational database machine 1 searches for the specified search item. The search result in the relational database machine 1 is displayed on the terminal 3 through the front-end processor 2.

The response time is the time from the input of the item to be selected from the terminal 3 until the display of the result for the selected item.

The response time for each search pattern is measured by a stopwatch. The result of measuring the response time for each search pattern shall be managed in writing.

Then, a graph showing the transition of the response time required for the search is created by the number of extractions for each search pattern and the actual response. Using this graph and the actual response, the response time was predicted at the time of search, and the performance of the relational database machine was evaluated.

[0009]

In the conventional information processing system, the response time of the relational database cannot be predicted and the relational database machine can be evaluated only after the documents are organized as described above. , The more items in the database,
Since there are various search patterns, it is difficult to measure with a stopwatch and create documents, and it is impossible to predict response time or evaluate a relational database machine.

Further, since it is written and managed, it takes a long time to create the document, and there is a problem that an accurate response cannot be predicted at the time of subsequent searches.

[0011]

An information processing system according to a first invention is an information processing system including a relational database machine capable of searching using a search pattern created by selecting an arbitrary item from a plurality of items. In at least, a storage means for storing the search pattern of the search performed in the past and data relating to the response time of the search pattern, and a search pattern input for performing the search using the relational database machine. Display means for displaying data relating to the response time, and the storage means and the display for storing necessary information in the storage means and displaying the information on the display means based on the storage of the storage means. And a control means for controlling the means.

An information processing system according to a second invention is the information processing system according to the first invention, characterized in that the data regarding the response time includes a minimum value, a maximum value and an average value of the response time.

An information processing system according to a third aspect of the present invention is the information processing system according to the first aspect, wherein the storage means further stores the number of extractions according to the search pattern of the search performed in the past, Graph creating means for creating a graph showing the relationship between the number of extracted items and the response time by using the data on the number of extracted items, the search pattern of the search performed in the past, and the response time stored in the storage unit Is further provided, and the created graph is displayed on the display means.

An information processing system according to a fourth aspect of the present invention is the information processing system according to the first aspect of the present invention, wherein the control means includes a search pattern input for performing a search using the relational database machine, When the input search pattern matches the search pattern of the search performed in the past stored in the storage means and the input search pattern matches the search pattern of the search performed in the past, the input search Using the pattern and the response time for the input search pattern,
When the data regarding the response time stored in the storage means is changed and the input search pattern does not match the search pattern of the search performed in the past, the input search pattern and the input search pattern are input. Using the response time for the search pattern, the input search pattern and the response time corresponding to the input search pattern are stored in the storage means.

[0015]

The control means according to the first aspect of the present invention corresponds to the search pattern input for executing the search using the relational database machine among the search patterns of the searches performed in the past stored in the storage means. The response time can be predicted by displaying the data relating to the response time stored in the storage means on the display means.

Since the data relating to the response time in the second aspect of the present invention includes the minimum value, the maximum value and the average value of the response time, these values can be displayed on the display means as the data relating to the response time.
Makes it easy to predict response time.

The graph creating means in the third invention creates a graph showing the relationship between the number of extracted items and the response time for displaying on the display means, facilitating the prediction of the response time and at the same time the relational database machine. To facilitate performance evaluation of.

When the input search pattern is a search pattern that has not been searched in the past, the control means in the fourth invention stores the search pattern and the response for the search pattern in the storage means. Data regarding time can be stored, and data regarding response time stored in the storage unit can be automatically increased.

Further, when the input search pattern is a search pattern that has been searched in the past, the control means changes the data regarding the response time regarding the search pattern stored in the storage means. be able to. Then, when changing, considering the response time at the time of the search for the input search pattern,
The storage means changes the data stored at that time. Therefore, the changed data is more suitable for predicting the response time at the next search than the data before the change.

[0020]

【Example】

Example 1. An embodiment of the present invention will be described below with reference to the drawings. 1 is a block diagram showing the configuration of an information processing system according to a first embodiment of the present invention. In FIG. 1, 2
a is connected to the relational database machine 1,
It is a front-end workstation that has a file A and a file B for storing the data related to the search of the relational database and processes the information input from the outside to give it to the relational database machine 1. The thing shows the part equivalent to the part of FIG.

When a search is performed from the terminal 3, the file A is created in the front end workstation 2a. Table 1 shows the concept of this file A. The file A includes information on a search pattern indicating which item in the relational database is selected and actual response information indicating the response time required by the relational database machine 1 to search for that item. This file A becomes the "input file". As shown in Table 1, in the file A, a selected item is flagged according to a search pattern of which item is searched each time it is searched.

[0022]

[Table 1]

Next, Table 2 shows the concept of the file B created for various search patterns searched by the relational database machine 1. The file B has a history for each search pattern searched in the past. In the file B, the search pattern that has been searched in the past, the number of times each search pattern has been searched, the number of times that each pattern has been extracted, and the minimum and maximum values of the time required for the response, and the past values that have been searched And the average value of the response time is held. This file B becomes a "history file". As shown in Table 2, for example, in the search pattern of the subject P2, items 1 and 3 are search targets, and the number of searches Sa performed in the past is 3 and the number of extractions Sb is 100.
It can be seen that the file B stores that the minimum value Smin of the response time is 3 seconds, the maximum value Smax of the response time is 10 seconds, and the average value Save of the response time is 7 seconds.

[0024]

[Table 2]

Here, the response time varies and the minimum value Smin and the maximum value Smax of the response time occur.
There is a case where one relational database machine 1 is accessed from a plurality of terminals 3 at the same time, and in that case, the processing time per unit changes depending on the number of accessing terminals 3 and the search pattern. This is because
For example, in the case of the subject P2 of the search pattern, the minimum response time Smin is 3 seconds and the maximum response Smax is 10 seconds,
Here, the difference between the maximum value Smax and the minimum value Smin of the response time is 7 seconds. This is considered to be caused by the difference in the number of terminals that accessed at the same time.

The files A and B in Tables 1 and 2 are
Automatically created when defining the relational database item. That is, in the file A, a flag is not set for each item, and a file in which no data is written in the actual result response is created. Further, in the file B, a file is created in which the flags of the items corresponding to the search patterns such as the subject names P1 to P5 and the information such as the number of searches and the number of extracted cases are not written at all.

Then, with the files A and B created, the actual search is repeated to obtain the files A, B.
The contents of file B are rewritten each time.

2 and 3 are flow charts for explaining the processing of files A and B performed by the information processing system according to the first embodiment of the present invention in one search. The operation of the front-end workstation 2a will be described with reference to FIGS. First, in step ST1, a search item input from the terminal 3 is selected, an execution of the search is instructed according to the search pattern, and the relational database machine 1 is caused to execute the search. In step ST2, the front-end workstation 2a sets a flag in the corresponding item of the file A.

In step ST3, the front-end workstation compares the search pattern of the file A with the search pattern of the file B and determines whether there is a match.

If there is no previous search pattern that matches the search pattern input in step 3, the process proceeds to step 4, and the front-end workstation 2a determines how many seconds have elapsed since the search pattern was input. The progress response is displayed on the terminal 3. Then, in step 5, the search pattern is added to the file B and the number of searches Sa and the number of extractions Sb are saved. Furthermore, in step ST6, the minimum response time Smin,
The actual response value is written in the maximum value Smax and the average value Save, and the process ends.

If there is a search pattern that has been performed in the past that matches the search pattern input in step 3, the process proceeds to step ST7, and the front-end workstation 2a determines the search pattern stored in the file B. Minimum response time Smin and maximum response time Smax
And the average value Save is displayed on the screen of the terminal 3. At the same time, the progress response is displayed.

Next, in step ST8, the actual response S00 stored in the file A and the minimum response time value Smin stored in the file B are compared. As a result, if the actual response value S00 is smaller than the minimum response time value Smin, the process proceeds to step ST9, and the minimum response time value Smin of the file B is replaced with the actual response S00. If the result response value S00 is larger than the minimum response time value Smin as a result of the comparison, the process proceeds to step ST10.

At step ST10, the actual response S00 stored in the file A is compared with the maximum response time Smax stored in the file B. As a result, if the actual response value S00 is larger than the maximum response time value Smax, the process proceeds to step ST11.
The maximum response time value Smax of the file B is replaced with the actual response S00. If the result response value S00 is greater than the maximum response time value Smax as a result of the comparison, the process proceeds to step ST12.

At step ST12, the average value Save of response times is updated. The update of the average value Save is performed by obtaining a new average value Save according to Expression 1 and replacing the average value Save stored in the file B with the new average value.

Save = (Save × Sa + S00) / (Sa + 1) ... Formula 1 In step ST13, the number of searches Sa is further increased by 1.

As described above, the stopwatch can display an accurate prediction of the response time corresponding to the search pattern without measuring the search response.
It is efficient.

Further, by displaying the prediction of the response time in advance, the user can cancel the search for his own convenience.

Furthermore, if the response takes a time significantly longer than the maximum value Smax of the response time stored in the file B, it is automatically judged as an abnormality, and a forced termination function at the time over is provided. It becomes possible.

Further, by leaving a history in the file B, it becomes possible to grasp the usage status of which search pattern and how much is searched.

Example 2. Next, a second embodiment of the present invention will be described with reference to the drawings. FIG. 2 is a graph showing the relationship between the number of extractions displayed on the terminal 3 and the average value Save of response times. Front-end workstation 2a
Captures a history file (file B) and automatically creates a graph for each total database number Sc with the number of extracted items Sb as the X axis and the average response Save as the Y axis.

As described above, the search response against the number of extracted items is graphed for each total number of items in the database,
This leads to performance evaluation of the relational database machine 1.

Further, when designing the use of the relational database 1, etc., it becomes possible to use as a standard how many databases should be used, which is effective.

[0043]

As described above, according to the information processing system of the first aspect of the present invention, the storage means is stored in the storage means by the control means with respect to the search pattern input for executing the search using the relational database machine. Data relating to the response time corresponding to the search pattern being displayed can be displayed on the display means, and the response time can be accurately predicted based on the data.

According to the information processing system of the second aspect of the invention, since the display means displays the minimum value, the maximum value and the average value of the response time, there is an effect of facilitating the prediction of the response time.

According to the information processing system of the third aspect of the present invention, the graph showing the relationship between the number of extractions and the response time created by the graph creating means can be displayed on the display means, and the performance of the relational database machine can be displayed. Has the effect of making it easier to evaluate.

According to the information processing system of the fourth aspect of the present invention, the control means includes the search pattern input for performing the search using the relational database machine and the past stored in the storage means. When the input search pattern matches the search pattern of the search performed in the past by comparing with the search pattern of the search performed, the input search pattern and the response time for the input search pattern are compared. Since it is configured to change the data regarding the response time stored in the storage means, there is an effect that the response time can be predicted in accordance with the usage status of the information processing system.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of an information processing system according to a first embodiment of the present invention.

FIG. 2 is a flowchart for explaining the operation of the information processing system according to the first embodiment of the present invention.

FIG. 3 is a flowchart for explaining the operation of the information processing system according to the first embodiment of the present invention.

FIG. 4 is a graph showing an example of display on a terminal of the information processing system according to the second example of the present invention.

FIG. 5 is a block diagram showing a configuration of a conventional information processing system.

[Explanation of symbols]

1 Relational database machine, 2, 2a Front-end workstation, 3 terminals.

Claims (4)

[Claims] 1. An information processing system comprising a relational database machine capable of performing a search using a search pattern created by selecting an arbitrary item from among a plurality of items, at least the search pattern of a search performed in the past, and the search. Storage means for storing data on response time for the pattern, display means for displaying data on the response time corresponding to the search pattern input to perform a search using the relational database machine, In order to store the necessary information in the storage means and to display the information on the display means based on the storage of the storage means,
An information processing system comprising: a control unit that controls the storage unit and the display unit. 2. The data regarding the response time is
The information processing system according to claim 1, including a minimum value, a maximum value, and an average value of response times. 3. The storage means further stores the number of extractions according to a search pattern of a search performed in the past, and stores the number of extractions and the response time data stored in the storage. 2. The information processing according to claim 1, further comprising: a graph creating unit that creates a graph showing a relationship between the number of extracted items and response time, and the created graph is displayed on the display unit. system. 4. The control unit stores the search pattern input for performing a search using the relational database machine and the search pattern of the search performed in the past stored in the storage unit. In comparison, when the input search pattern matches the search pattern of the search performed in the past, the storage is performed by using the input search pattern and the response time for the input search pattern. The data regarding the response time stored in the means is changed, and when the input search pattern does not match the search pattern of the search performed in the past, the input search pattern and the input search pattern Of the input search pattern and the input search time. Wherein the storing the response time corresponding to the pattern in the storage means,
The information processing system according to claim 1.