Abstract:
A recording medium includes a program causing a computer to execute the steps of (a) predicting a data storage condition of a database from a record operation, (b) computing a number of relocatable areas and a number of areas in an expansion direction based on the data storage condition predicted in the step (a), and (c) detecting operation timing with respect to the database based on the numbers computed in the step

Description:
BACKGROUND OF THE INVENTION  
         [0001]    1. Field of the Invention  
           [0002]    The present invention generally relates to recording media recorded with a program for detecting database operation timing such as timing of performing page relocation in a database or timing of performing the capacity expansion of the database, methods of detecting database operation timing, and apparatuses for detecting database operation timing, and more particularly to a recording medium recorded with a program for detecting database operation timing, a method of detecting database operation timing, and an apparatus for detecting database operation timing which program, method, and apparatus detect timing of performing page relocation in a database or timing of performing the capacity expansion of the database.  
           [0003]    A network structure database employs prime pages and overflow pages, which are used when the prime pages have no space, so as to enable a high-speed access thereto.  
           [0004]    Once on-line operations start, such a database requires page (record) relocation since record addition, deletion, or update creates fragmentary spaces in the prime and overflow pages. Further, if the database seems to run out of its capacity, the capacity of the database has to be expanded.  
           [0005]    Timing of performing the page relocation in or the capacity expansion of such a database should be detected accurately with a minimum influence on the on-line operations.  
           [0006]    2. Description of the Related Art  
           [0007]    Conventionally, a system administrator has judged the necessity of page relocation in or the capacity expansion of a database based on the analysis results of a job executed to recognize the storage condition of data in the database, that is, based on analysis results as to whether the number of regions that are not reusable due to fragmentation is large or small.  
           [0008]    Then, if the system administrator determines, based on the analysis results, that the number of reusable regions is so large that the database requires page relocation, the system administrator performs the page relocation during a jog execution by activating a program configured in accordance with an invention disclosed in Japanese Laid-Open Patent Application No. 6-110743.  
           [0009]    Further, if the system administrator determines, based on the analysis results, that such page relocation does not allow the database to store further data, the system administrator activates a program for implementing the capacity expansion of the database so as to expand the capacity of the database.  
           [0010]    Thus, according to a conventional method, the system administrator judges the necessity of page relocation in or the capacity expansion of the database by executing the job for recognizing the data storage condition of the database. This job is executed at a timing when the on-line operations are stopped.  
           [0011]    The job executed at this timing is input to and output from the entire database so as to recognize the data storage condition of the database.  
           [0012]    According to such a conventional method, however, the on-line operations should be stopped in order to judge the necessity of the page relocation in or the capacity expansion of the database, thus causing a problem that a request for an on-line operation hour extension cannot be answered. Especially, this is a problem in 24-hour continuous on-line operations.  
           [0013]    Further, according to the conventional method, the system administrator, based on her/his experience, judges the necessity of the page relocation in or the capacity expansion of the database, referring to the analysis results of the above-described job.  
           [0014]    However, this does not mean that the page relocation in or the capacity expansion of the database is always performed at an appropriate timing.  
           [0015]    Therefore, in the worst case, the conventional method causes the shortage of the capacity of the database so that an on-line program is prevented from storing records to end abnormally.  
         SUMMARY OF THE INVENTION  
         [0016]    It is a general object of the present invention to provide a recording medium recorded with a program for detecting database operation timing, a method of detecting database operation timing, and an apparatus for detecting database operation timing in which the above-described disadvantage is eliminated.  
           [0017]    A more specific object of the present invention is to provide a recording medium recorded with a program for detecting database operation timing, a method of detecting database operation timing, and an apparatus for detecting database operation timing which program, method, and apparatus accurately detect timing of performing page relocation in a database or timing of performing the capacity expansion of the database with a minimum influence on on-line operations.  
           [0018]    The above objects of the present invention are achieved by a recording medium including a program causing a computer to execute the steps of (a) predicting a data storage condition of a database from a record operation, (b) computing a number of relocatable areas and a number of areas in an expansion direction based on the data storage condition predicted in the step (a), and (c) detecting operation timing with respect to the database based on the numbers computed in the step (b).  
           [0019]    The above objects of the present invention are also achieved by a recording medium including a program causing a computer to execute the steps of (a) determining whether a new overflow area is generated by a record operation, (b) determining whether fragmentation is generated in a prime area or overflow areas including the new overflow area linked thereto by the record operation if it is determined in the step (a) that the new overflow area is generated, (c) computing a number of relocatable areas and a number of areas in an expansion direction based on a result of the step (b), and (d) detecting operation timing with respect to the database based on the numbers computed in the step (c).  
           [0020]    The above objects of the present invention are also achieved by a method of detecting database operation timing which method includes the steps of (a) determining whether a new overflow area is generated by a record operation, (b) determining whether fragmentation is generated in a prime area or overflow areas including the new overflow area linked thereto by the record operation if it is determined in the step (a) that the new overflow area is generated, (c) computing a number of relocatable areas and a number of areas in an expansion direction based on a result of the step (b), and (d) detecting operation timing with respect to the database based on the numbers computed in the step (c).  
           [0021]    The above objects of the present invention are further achieved by an apparatus for detecting database operation timing which apparatus includes a first determination part for determining whether a new overflow area is generated by a record operation, a second determination part for determining whether fragmentation is generated in a prime area or overflow areas including the new overflow area linked thereto by the record operation if it is determined by the first determination part that the new overflow area is generated, a computation part for computing a number of relocatable areas and a number of areas in an expansion direction based on a determination result of said second determination part, and a detection part for detecting operation timing with respect to the database based on the numbers computed by the computation part.  
           [0022]    According to the above-described recording media, method, and apparatus, the necessity of page relocation in or the capacity expansion of the database can be judged without executing a job for recognizing the data storage condition of the database. Therefore, on-line operations are prevented from a stoppage, thus minimizing influence thereon.  
           [0023]    Further, the necessity of page relocation in or the capacity expansion of the database can be judged without depending on a system administrator, thus preventing unnecessary page relocation in the database or an unnecessary capacity expansion thereof from being performed. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0024]    Other objects, features and advantages of the present invention will become more apparent from the following detailed description when read in conjunction with the accompanying drawings, in which:  
         [0025]    [0025]FIG. 1 is a diagram showing a structure of a computer system according to the present invention;  
         [0026]    [0026]FIG. 2 is a diagram showing a program structure of a DB management mechanism shown in FIG.  
         [0027]    [0027]FIG. 3 is a diagram for illustrating an NDB shown in FIGS. 1 and 2;  
         [0028]    [0028]FIG. 4 is a diagram showing embodiments of a prime area and an overflow area of the NDB;  
         [0029]    [0029]FIG. 5 is a diagram for illustrating an operation of an overflow management page shown in FIG. 4;  
         [0030]    [0030]FIG. 6 is a diagram showing an embodiment of prediction management information of each prime page shown in FIGS. 4 and 5;  
         [0031]    [0031]FIG. 7 is a diagram for illustrating an overflow page management operation performed by an overflow management page shown in FIGS. 4 and 5;  
         [0032]    [0032]FIGS. 8A and 8B are flowcharts of an operation performed by a database access program shown in FIGS. 2 and 3;  
         [0033]    [0033]FIGS. 9 and 10 are flowcharts of an operation performed by an overflow prediction management program shown in FIG. 2;  
         [0034]    [0034]FIG. 11 is a diagram showing cases to which a record operation corresponds in step S 5  of FIG. 9;  
         [0035]    [0035]FIG. 12 is a diagram for illustrating a prediction management update operation performed in step  6  of FIG. 9;  
         [0036]    [0036]FIG. 13 is a diagram for illustrating a method of determining timings to perform page relocation in the NDB and an expansion thereof in steps  7  through  14  in FIGS. 9 and 10;  
         [0037]    [0037]FIG. 14 is a diagram for illustrating the page relocation in and the expansion of the NDB; and  
         [0038]    [0038]FIGS. 15A through 17B are diagrams for illustrating an operation of a system of FIG. 14 according to the present invention. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0039]    A description will now be given, with reference to the accompanying drawings, of an embodiment of the present invention.  
         [0040]    [0040]FIG. 1 is a diagram showing a structure of a computer system according to the present invention. As shown in FIG. 1, the computer system includes an operating system (OS)  1 , an application program  2 , a terminal  3 , a network structure database (NDB)  4 , an expansion NDB  5  capacity-expanded from the NDB  4 , a terminal control mechanism  6  operating under the OS  1  to control the terminal  3 , a database (DB) management mechanism  7  operating under the OS  1  to manage the NDB  4  and the expansion NDB  5 , and a transaction control mechanism  8  for controlling transactions.  
         [0041]    [0041]FIG. 2 is a diagram showing a program structure of the DB management mechanism  7 .  
         [0042]    As shown in FIG. 2, the DB management mechanism  7  includes an overflow prediction management program  11  provided to realize the present invention as well as a conventionally provided database access program  10 .  
         [0043]    As will be described later, the overflow prediction management program  11  updates prediction management information  400  recorded in prime pages, performs an addition operation of an overflow page, and posts an instruction for page relocation in the NDB  4  or the expansion NDB  5 , and an instruction for the generation of the expansion NDB. The overflow prediction management program  11  can be stored in an appropriate recording medium such as a computer-readable semiconductor memory.  
         [0044]    [0044]FIG. 3 is a diagram for illustrating the NDB  4 .  
         [0045]    The NDB  4  is accessed by the record, and, as shown in FIG. 3, employs two types of pages (input/output units) of the prime pages loaded into a prime area  40  and overflow pages loaded into an overflow area  41 . The NDB  4  uses the prime pages prior to the overflow pages. If there is no space in the prime pages, the NDB  4  uses the overflow pages. If there is no space in the overflow pages, the NDB  4  allocates the next overflow page from the overflow area  41 . Thereby, the NDB  4  enables a high-speed access thereto.  
         [0046]    If the NDB  4  is filled to its capacity, overflow pages loaded into an overflow area  50  of the expansion NDB  5  are used.  
         [0047]    [0047]FIG. 4 is a diagram showing embodiments of the prime area  40  and the overflow area  41  of the NDB  4 .  
         [0048]    The overflow area  50  of the expansion NDB  5  has the same structure as the overflow area  41  of the NDB  4 .  
         [0049]    As shown in FIG. 4, each prime page loaded into the prime area  40  has the two-bit prediction management information  400 . On the other hand, an overflow management page  410  is provided in the overflow area  41  to manage the numbers of expansion pages (pages in an expansion direction) and relocation (relocatable) pages.  
         [0050]    [0050]FIG. 5 is a diagram for illustrating an operation of the overflow management page  410 .  
         [0051]    In addition to the management of the numbers of expansion pages and relocation pages, the overflow management page  410  identifies an overflow page in use by using a link as shown in FIG. 5.  
         [0052]    A record to be stored in a prime page identifies overflow pages linked to the prime page by using a pointer, which is not shown in FIG. 5.  
         [0053]    [0053]FIG. 6 is a diagram showing an embodiment of the prediction management information  400  of each prime page.  
         [0054]    As shown in FIG. 6, the prediction management information  400  is formed of two bits, and manages a value “00” in an initial state, a value “10” if a prime page having the prediction management information  400  and overflow pages linked to the prime page are relocatable, and a value “11” if the prime page and the overflow pages linked thereto are in the expansion direction.  
         [0055]    That is, the values “10” and “11” of the prediction management information  400  indicate, respectively, that a page set of the prime page and the overflow pages linked thereto has fragmentation and thus is relocatable, and that the page set has no fragmentation and thus is in the expansion direction.  
         [0056]    [0056]FIG. 7 is a diagram for illustrating an overflow page management operation.  
         [0057]    For instance, as shown in FIG. 7, if the prediction management information  400  of a prime page i is recorded with the value “10”, it is indicated that a page set of the prime page i and overflow pages linked thereto has fragmentation, and thus is relocatable. If the prediction management information  400  of a prime page p is recorded with the value “11”, it is indicated that a page set of the prime page p and overflow pages linked thereto has no fragmentation, and thus is in the expansion direction.  
         [0058]    The number of expansion pages managed by the overflow management page  410  is the total number of the overflow pages of the page set in the expansion direction. In FIG. 7, the overflow management page  410  manages the number “4” as the number of expansion pages.  
         [0059]    On the other hand, the number of relocation pages managed by the overflow management page  410  is the total number of the overflow pages of the relocatable page set. In FIG. 7, the overflow management page  410  manages the number “3” as the number of relocation pages.  
         [0060]    If fragmentation is generated in the page set in the expansion direction, the page set becomes relocatable. In this case, the prediction management information  400  has the value “11” updated to the value “10” as shown in FIG. 6.  
         [0061]    If the fragmentation disappears in the relocatable page set, the page set is to be in the expansion direction. However, this seldom happens and is quite exceptional. Therefore, the page set in which fragmentation is once generated is considered as relocatable even if a new overflow page is added to the page set after the generation of the fragmentation. Consequently, as shown in FIG. 6, once the prediction management information  400  is set to the value “10”, the value “10” is never updated to the value “11”.  
         [0062]    [0062]FIGS. 8A and 8B are flowcharts of an operation performed by the database access program  10 , and FIGS. 9 and 10 are flowcharts of an operation performed by the overflow prediction management program  11 .  
         [0063]    Next, a description will be given of the present invention in accordance with these flowcharts.  
         [0064]    First, a description will be given of the operation performed by the database access program  10 .  
         [0065]    As shown in FIG. 8A, the database access program  10  performs an initialization operation to reserve a work area when a transaction starts.  
         [0066]    On the other hand, when the transaction ends, as shown in FIG. 8B, the database access program  10  first determines in step S 1  whether or not the prediction management information  400  of a prime page is updated and/or the number of expansion pages and/or the number of relocation pages managed by the overflow management page  410  are/is updated by a record operation in the transaction.  
         [0067]    If it is determined in step S 1  that such a prediction management update operation, which is performed by the overflow prediction management program  11  as will be described later, is not performed, the operation proceeds to step S 2 . In step S 2 , the prime page and the overflow pages read in response to the issuance of the macro instruction for the record operation are written to the NDB  4  in a direct access storage device (DASD), and then the operation ends.  
         [0068]    On the other hand, if it is determined in step S 1  that a prediction management update operation is performed, the operation proceeds to step S 3 . In step S 3 , the updated prediction management information  400  of the prime page is written to the NDB  4  in the DASD, and in step  4 , the updated number of expansion pages and/or the updated number of relocation pages managed by the overflow management page  410  are/is written to the NDB  4  in the DASD.  
         [0069]    Next, in step S 5 , the rest of the prime page and the overflow pages are written to the NDB  4  in the DASD, and then the operation ends.  
         [0070]    Thus, when the transaction ends, the database access program  10  writes to the NDB  4  in the DASD the prime page and overflow pages read in response to the issuance of the macro instruction for the record operation, and the overflow management page  410 . Thereafter, the database access program  10  terminates the operation.  
         [0071]    Next, a description will be given of the operation performed by the overflow prediction management program  11 .  
         [0072]    If the database access program  10  issues a macro instruction for a record operation in response to a request from the application program  2  in a transaction, the overflow prediction management program  11  first determines in step S 1  whether the issued macro instruction is of an update type as shown in FIG. 9.  
         [0073]    If it is determined in step S 1  that the issued macro instruction is not of an update type, that is, if it is determined that the issued macro instruction is for a record retrieval, it is determined that a below-described prediction management is unnecessary, the operation ends without performing further steps.  
         [0074]    On the other hand, if it is determined in step S 1  that the issued macro instruction is of an update type, such as a record addition, deletion, or update, the operation proceeds to step S 2 . In step S 2 , a predicted size of a record (a record length) processed by the macro instruction is obtained from the database access program  10 .  
         [0075]    Next, in step S 3 , it is determined whether the database access program  10  performs the record operation on an overflow page in response to the issuance of the macro instruction. If it is determined in step S 3  that the record operation is not performed on the overflow page, that is, if it is determined that the record operation is performed on a prime page, it is determined that a below-described prediction management is unnecessary, and the operation ends without performing further steps. This is because, at this stage, no relocatable or capacity expansion state is generated, that is, no page set is relocatable or in the expansion direction.  
         [0076]    On the other hand, if it is determined in step S 3  that the database access program  10  performs the record operation on the overflow page, the operation proceeds to step S 4 . In step S 4 , it is determined whether the database access program  10  allocates a new overflow page during the transaction in process. If it is determined in step S 4  that a new overflow page is not allocated in the transaction, it is determined that a below-described prediction management is unnecessary, and the operation ends without performing further steps. This is because, at this stage, no relocatable or capacity expansion state is generated.  
         [0077]    On the other hand, if it is determined in step S 4  that a new overflow page is allocated in the transaction, the operation proceeds to step S 5 . In step S 5 , it is determined which case the record operation performed by the database access program  10  this time corresponds to based on record operation types and predicted sizes of records (record lengths) of last time and this time.  
         [0078]    [0078]FIG. 11 is a diagram showing cases to which the record operation corresponds. For convenience of description, a description will be given of typical six cases.  
         [0079]    If a record length deleted by the last operation is equal to that added by this operation, it is determined that this operation corresponds to CASE  1  having a future prediction of NO CHANGE.  
         [0080]    If a record length deleted by the last operation is longer than that added by this operation, it is determined that this operation corresponds to CASE  2  having a future prediction of EXPANSION DIRECTION.  
         [0081]    If a record length deleted by the last operation is shorter than that added by this operation, it is determined that this operation corresponds to CASE  3  having a future prediction of RELOCATABLE indicating generation of fragmentation.  
         [0082]    If a record length updated by the last operation is equal to that updated by this operation, it is determined that this operation corresponds to CASE  4  having the future prediction of NO CHANGE.  
         [0083]    If a record length updated by the last operation is longer than that updated by this operation, it is determined that this operation corresponds to CASE  5  having the future prediction of EXPANSION DIRECTION.  
         [0084]    If a record length updated by the last operation is shorter than that updated by this operation, it is determined that this operation corresponds to CASE  6  having the future prediction of RELOCATABLE indicating generation of fragmentation.  
         [0085]    Next, in FIG. 9, after it is determined in step S 5  which case the record operation performed by the database access program  10  this time corresponds to, in step S 6 , a prediction management update operation is performed to update the prediction management information  400  of the prime page and/or the number of expansion pages and/or the number of relocation pages managed by the overflow management page  410  based on the case to which the record operation corresponds.  
         [0086]    [0086]FIG. 12 is a diagram for illustrating the prediction management update operation.  
         [0087]    For instance, if the record operation performed by the database access program  10  corresponds to CASE  1  or  4 , the value of the prediction management information  400  of the prime page is not updated as shown in FIG. 12.  
         [0088]    In this case, if the value of the prediction management information  400  indicates “10 (RELOCATABLE)”, the number of relocation pages managed by the overflow management page  410  is incremented by one, and if the value of the prediction management information  400  indicates “11 (EXPANSION DIRECTION)”, the number of expansion pages managed by the overflow management page  410  is incremented by one.  
         [0089]    In the case where the record operation performed by the database access program  10  corresponds to CASE  2  or  5 , as shown in FIG. 12, the value of the prediction management information  400  is updated to “11 (EXPANSION DIRECTION)” if the value indicates “00 (INITIAL STATE)”, but is not updated for the reason previously described with reference to FIG. 6 if the value indicates “10 (RELOCATABLE)”. The value is not updated either if the value indicates “11 (EXPANSION DIRECTION)”, for there is no change in the future prediction.  
         [0090]    At this point, if the value of the prediction management information  400  is updated from “00 (INITIAL STATE)” to “11 (EXPANSION DIRECTION)”, a value “1” is entered in the number of expansion pages managed by the overflow management page  410 . In the case where the value is not updated, the number of relocation pages managed by the overflow management page  410  is incremented by one if the value indicates “10 (RELOCATABLE)”, and the number of expansion pages is incremented by one if the value indicates “11 (EXPANSION DIRECTION)”.  
         [0091]    In the case where the record operation performed by the database access program  10  corresponds to CASE  3  or  6 , as shown in FIG. 12, the value of the prediction management information  400  of the prime page is updated to “10 (RELOCATABLE)” if the value indicates “00 (INITIAL STATE)” or “11 (EXPANSION DIRECTION)”, is not updated if the value indicates “10 (RELOCATABLE)”, for there is no change in the future prediction.  
         [0092]    At this point, if the value is updated from “00 (INITIAL STATE)” to “10 (RELOCATABLE)”, a value “1” is entered in the number of relocation pages managed by the overflow management page  410 . If the value is not updated, the number of relocation pages is incremented by one. If the value is updated from “11 (EXPANSION DIRECTION)” to “10 (RELOCATABLE)”, the number of all the overflow pages linked to the prime page is entered in the number of relocation pages, and the number of expansion pages is reset to an initial value “0”.  
         [0093]    Thus, in step S 6 , the prediction management update operation is performed so that the overflow management page  410  manages the numbers of expansion and relocation pages as described above in FIG. 7.  
         [0094]    Next, in step S 7 , based on the total number of overflow pages (TN) loaded into the overflow area  41 , which number is entered in the overflow management page  410 , and the numbers of expansion and relocation pages (NE and NR) managed by the overflow management page  410 , the rate of use of overflow pages (RU) is given by the following equation  
           RU =( NE+NR )/ TN,    
         [0095]    and the ratio of relocatable overflow pages (RR) and the ratio of overflow pages in the expansion direction (RE) are given by the following equations  
         
       RR=NR/TN  
     
         
       RE=NE/TN  
     
         [0096]    Next, as shown in FIG. 10, it is determined in step S 8  whether the rate of use of overflow pages is higher than 90%. If it is determined in step S 8  that the rate of use of overflow pages is higher than 90%, the operation proceeds to step S 9 . In step S 9 , an instruction is issued to expand the NDB  4 , and then the operation ends.  
         [0097]    That is, if the rate of use of overflow pages is higher than 90%, the NDB  4  is almost filled to its capacity. Therefore, the instruction is issued to expand the NDB  4  irrespective of the ratio of relocatable overflow pages or overflow pages in the expansion direction.  
         [0098]    On the other hand, if it is determined in step S 8  that the rate of use of overflow pages does not exceed 90%, the operation proceeds to step S 10  to determine whether the rate of use is higher than 70% and lower than or equal to 90%, whether the rate of use is higher than 50% and lower than or equal to 70%, and whether the rate of use is lower than or equal to 50%.  
         [0099]    If it is determined in step S 10  that the rate of use is lower than or equal to 50%, the operation ends without providing an instruction to expand the NDB  4  or perform page relocation therein.  
         [0100]    That is, if the rate of use is lower than or equal to 50%, the NDB  4  has sufficient space in its capacity. Therefore, no instruction is issued to expand the NDB  4  or perform page relocation therein.  
         [0101]    On the other hand, if it is determined in step S 10  that the rate of use is higher than 70% and lower than or equal to 90%, the operation proceeds to step S 11  to determine whether the ratio of overflow pages in the expansion direction (RE) is higher than 80%. If it is determined in step S 11  that the RE is higher than 80%, the operation proceeds to step S 12  to issue an instruction to expand the NDB  4 , and then the operation ends.  
         [0102]    That is, if the rate of use is higher than 70% and lower than or equal to 90% and the RE is higher than 80%, the NDB  4  is almost filled to its capacity. Therefore, the instruction is issued to expand the NDB  4 .  
         [0103]    On the other hand, if it is determined in step S 11  that the RE is lower than or equal to 80%, or if it is determined in step S 10  that the rate of use is higher than 50% and lower than or equal to 70%, the operation proceeds to step S 13  to determine whether the ratio of relocatable overflow pages (RR) is higher than 30%.  
         [0104]    If it is determined in step S 13  that the RR is higher than 30%, the operation proceeds to step S 14  to issue an instruction to perform page relocation in the NDB  4 , and then the operation ends. On the other hand, if it is determined in step S 13  that the RR is lower than or equal to 30%, the operation ends without providing an instruction to perform page relocation in the NDB  4 .  
         [0105]    That is, if the rate of use is higher than 50% and lower than or equal to 70% and the RR is higher than 30%, it is desirable to lower the rate of use by page relocation in the NDB  4 . Therefore, the instruction is issued to perform page relocation in the NDB  4 .  
         [0106]    If the rate of use is higher than 50% and lower than or equal to 70%, the RE is lower than or equal to 80% so that the expansion of the NDB  4  is not necessary, and the RR is higher than 30%, it is desirable to lower the rate of use by page relocation in the NDB  4 . Therefore, the instruction is issued to perform page relocation in the NDB  4 .  
         [0107]    Thus, the overflow prediction management program  11  predicts the data storage condition of the NDB  4  from a record operation performed in a transaction so as to compute the rate of use of overflow pages, the ratio of relocatable overflow pages, and the ratio of overflow pages in the expansion direction, base on which the overflow prediction management program  11  issues an instruction to expand the NDB  4  or perform page relocation therein in accordance with, for instance, a determination method as shown in FIG. 13.  
         [0108]    In the above-described steps, steps S 1  through S 4  form a first determination step, step  5  forms a second determination step, step  6  forms a computation step, and steps  7  through  14  form a detection step of a method of detecting database operation timing.  
         [0109]    Further, in the above-described steps, steps S 1  through S 4  form a first determination part, step  5  forms a second determination part, step  6  forms a computation part, and steps  7  through  14  form a detection part of an apparatus for detecting database operation timing.  
         [0110]    [0110]FIG. 14 is a diagram for illustrating page relocation in and the expansion of the NDB  4 .  
         [0111]    In response to the instruction to perform page relocation in the NDB  4  issued by the overflow prediction management program  11 , a relocation program  100 , for instance, is activated as shown in FIG. 14 so as to perform page relocation in the NDB  4 . At this point, it is desirable that the object of page relocation should not be limited to the relocatable overflow pages, but include all the overflow pages and all the prime pages,  
         [0112]    On the other hand, in response to the instruction to expand the NDB  4  issued by the overflow prediction management program  11 , a DB expansion program  200 , for instance, is activated as shown in FIG. 14 so that the expansion NDB  5  is generated to expand from the NDB  4 .  
         [0113]    According to a system shown in FIG. 14, the relocation program  100  or the DB expansion program  200  is activated in response to the instruction issued by the overflow prediction management program  11  so as to automatically perform page relocation in the NDB  4  or the expansion thereof. On the other hand, in some cases, a message to instruct page relocation in the NDB  4  or the expansion thereof is output on the display screen of the terminal  3  shown in FIG. 1.  
         [0114]    Next, a description will be given, with reference to FIGS. 15A through 17B, of an operation of the system of the above-described structure.  
         [0115]    If the database access program  10 , during the execution of a transaction, receives an addition request of a record B of a record length of 400 after deleting a record A of a record length of 400 stored in a prime page as shown in FIG. 15A, the database access program  10  store the record B in the prime page having a space of the record length of 400 as shown in FIG. 15B.  
         [0116]    Thereafter, if the database access program  10  receives an addition request of a record C of a record length of 500, the database access program  10  allocates a new overflow page to store the record C therein since the prime page is full as shown in FIG. 15C.  
         [0117]    The overflow prediction management program  11  determines the case of this record operation (the case of a series of additions) in this transaction so as to determine that the NDB  4  is in the expansion direction. Then, as shown in FIG. 16A, the overflow prediction management program  11  sets the value of the prediction management information  400  of the prime page to “11 (EXPANSION DIRECTION)”, and increment the number of expansion pages managed by the overflow management page  410  by one to set the number of expansion pages to “1”. Thereafter, at the end of the transaction, the overflow prediction management program  11  writes the updated value of the prediction management information 400 and the updated number of expansion pages to the NDB  4  in the DASD.  
         [0118]    Next, the database access program  10  fills the allocated overflow page by executing several transactions as shown in FIG. 16B.  
         [0119]    Thereafter, if the database access program  10 , while executing a transaction following the preceding transactions, receives an addition request of a record E of a record length of 500 after deleting a record D of a record length of 400 as shown in FIG. 16C, the database access program  10  allocates a new overflow page to store the record E therein since the allocated overflow page is full as shown in FIG. 17A.  
         [0120]    The overflow prediction management program  11  determines the case of this record operation (the case of adding a record of a record length longer than a space produced by deleting a record) in this transaction so as to determine that the NDB  4  is in condition to have page relocation. Then, as shown in FIG. 17B, the overflow prediction management program  11  sets the value of the prediction management information  400  of the prime page to “10 (RELOCATABLE)”, and sets the numbers of expansion and relocation pages managed by the overflow management page  410  to “0” and “2”, respectively. Thereafter, at the end of the transaction, the overflow prediction management program  11  writes the updated value of the prediction management information  400  and the updated numbers of expansion and relocation pages to the NDB  4  in the DASD.  
         [0121]    Thus, the overflow prediction management program  11  detects the numbers of expansion and relocation pages indicating the data storage condition of the NDB  4  from record operations in transactions.  
         [0122]    As previously described in FIGS. 9 and 10, the overflow prediction management program  11  issues an instruction to perform page relocation in the NDB  4  or the expansion thereof based on the predicted data storage condition of the NDB  4 .  
         [0123]    The present invention is not limited to the specifically disclosed embodiment, but variations and modifications may be made without departing from the scope of the present invention.  
         [0124]    The present application is based on Japanese priority application No. 2000-288116 filed on Sep. 22, 2000, the entire contents of which are hereby incorporated by reference.   
     
       
       
         1 
         
           
             
4 
 
           
           
             
               327 base pairs  
               nucleic acid  
               double  
               linear  
             
             
               DNA (genomic)  
             
             
               CDS  
                10..312 

 
             
              1 

CGATCGAAG CTT GGT AAA TTC TCC CAG ACC TGC TAC AAC TCC GCT ATC         48 
          Leu Gly Lys Phe Ser Gln Thr Cys Tyr Asn Ser Ala Ile 
            1               5                  10 

CAG GGT TCC GTT CTG ACC TCC ACC TGC GAA CGT ACC AAC GGT GGT TAC       96 
Gln Gly Ser Val Leu Thr Ser Thr Cys Glu Arg Thr Asn Gly Gly Tyr 
     15                  20                  25 

AAC ACC TCC TCC ATC GAC CTG AAC TCC GTT ATC GAA AAC GTT GAC GGT      144 
Asn Thr Ser Ser Ile Asp Leu Asn Ser Val Ile Glu Asn Val Asp Gly 
 30                  35                  40                  45 

TCC CTG AAA TGG CAG CCG TCC AAC TTC ATC GAA ACC TGC CGT AAC ACC      192 
Ser Leu Lys Trp Gln Pro Ser Asn Phe Ile Glu Thr Cys Arg Asn Thr 
                 50                  55                  60 

CAG CTG GCT GGT TCC TCC GAA CTG GCT GCT GAA TGC AAA ACC CGT GCT      240 
Gln Leu Ala Gly Ser Ser Glu Leu Ala Ala Glu Cys Lys Thr Arg Ala 
             65                  70                  75 

CAG CAG TTC GTT TCC ACC AAA ATC AAC CTG GAC GAC CAC ATC GCT AAC      288 
Gln Gln Phe Val Ser Thr Lys Ile Asn Leu Asp Asp His Ile Ala Asn 
         80                  85                  90 

ATC GAC GGT ACC CTG AAA TAC GAA TAACTCGAGA TCGTA                     327 
Ile Asp Gly Thr Leu Lys Tyr Glu 
     95                 100 

 
           
           
             
               101 amino acids  
               amino acid  
               linear  
             
             
               protein  
             
              2 

Leu Gly Lys Phe Ser Gln Thr Cys Tyr Asn Ser Ala Ile Gln Gly Ser 
  1               5                  10                  15 

Val Leu Thr Ser Thr Cys Glu Arg Thr Asn Gly Gly Tyr Asn Thr Ser 
             20                  25                  30 

Ser Ile Asp Leu Asn Ser Val Ile Glu Asn Val Asp Gly Ser Leu Lys 
         35                  40                  45 

Trp Gln Pro Ser Asn Phe Ile Glu Thr Cys Arg Asn Thr Gln Leu Ala 
     50                  55                  60 

Gly Ser Ser Glu Leu Ala Ala Glu Cys Lys Thr Arg Ala Gln Gln Phe 
 65                  70                  75                  80 

Val Ser Thr Lys Ile Asn Leu Asp Asp His Ile Ala Asn Ile Asp Gly 
                 85                  90                  95 

Thr Leu Lys Tyr Glu 
            100 

 
           
           
             
               327 base pairs  
               nucleic acid  
               double  
               linear  
             
             
               DNA (genomic)  
             
             
               CDS  
                1..327 

 
             
              3 

GAC TAC AAG GAC GAC GAT GAC AAG CTT GGT AAA TTC TCC CAG ACC TGC       48 
Asp Tyr Lys Asp Asp Asp Asp Lys Leu Gly Lys Phe Ser Gln Thr Cys 
  1               5                  10                  15 

TAC AAC TCC GCT ATC CAG GGT TCC GTT CTG ACC TCC ACC TGC GAA CGT       96 
Tyr Asn Ser Ala Ile Gln Gly Ser Val Leu Thr Ser Thr Cys Glu Arg 
             20                  25                  30 

ACC AAC GGT GGT TAC AAC ACC TCC TCC ATC GAC CTG AAC TCC GTT ATC      144 
Thr Asn Gly Gly Tyr Asn Thr Ser Ser Ile Asp Leu Asn Ser Val Ile 
         35                  40                  45 

GAA AAC GTT GAC GGT TCC CTG AAA TGG CAG CCG TCC AAC TTC ATC GAA      192 
Glu Asn Val Asp Gly Ser Leu Lys Trp Gln Pro Ser Asn Phe Ile Glu 
     50                  55                  60 

ACC TGC CGT AAC ACC CAG CTG GCT GGT TCC TCC GAA CTG GCT GCT GAA      240 
Thr Cys Arg Asn Thr Gln Leu Ala Gly Ser Ser Glu Leu Ala Ala Glu 
 65                  70                  75                  80 

TGC AAA ACC CGT GCT CAG CAG TTC GTT TCC ACC AAA ATC AAC CTG GAC      288 
Cys Lys Thr Arg Ala Gln Gln Phe Val Ser Thr Lys Ile Asn Leu Asp 
                 85                  90                  95 

GAC CAC ATC GCT AAC ATC GAC GGT ACC CTG AAA TAC GAA                  327 
    Asp His Ile Ala Asn Ile Asp Gly Thr Leu Lys Tyr Glu 
            100                 105 

 
           
           
             
               109 amino acids  
               amino acid  
               linear  
             
             
               protein  
             
              4 

Asp Tyr Lys Asp Asp Asp Asp Lys Leu Gly Lys Phe Ser Gln Thr Cys 
  1               5                  10                  15 

Tyr Asn Ser Ala Ile Gln Gly Ser Val Leu Thr Ser Thr Cys Glu Arg 
             20                  25                  30 

Thr Asn Gly Gly Tyr Asn Thr Ser Ser Ile Asp Leu Asn Ser Val Ile 
         35                  40                  45 

Glu Asn Val Asp Gly Ser Leu Lys Trp Gln Pro Ser Asn Phe Ile Glu 
     50                  55                  60 

Thr Cys Arg Asn Thr Gln Leu Ala Gly Ser Ser Glu Leu Ala Ala Glu 
 65                  70                  75                  80 

Cys Lys Thr Arg Ala Gln Gln Phe Val Ser Thr Lys Ile Asn Leu Asp 
                 85                  90                  95 

Asp His Ile Ala Asn Ile Asp Gly Thr Leu Lys Tyr Glu 
            100                 105