JPH10301824A - Computer readable recording medium recording information management data and information management system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To input the large amount of information to be valid from the certain point of time in the future in advance and to update the large amount of the information without a time lag at the point of time by imparting a field for storing key information for indicating the classification of records and the time when the record becomes valid or the time when it is scheduled to become valid, etc., to the record and holding it in a data base. SOLUTION: In a real file 3, the field for storing the key information for indicating the classification of the record held in the data base, the time when the record becomes valid or the time when it is scheduled to become valid and the time when the record becomes invalid or the time when it is scheduled to become invalid is imparted to the record and held in the data base. In such a manner, since a date when a prescribed record becomes valid is set at the valid time and stored in the real file 3 in advance, at the time when the record actually becomes valid, the real file 3 is updated without changing anything and the large amount of the information is updated without the time lag.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer-readable recording medium on which information management data is recorded and an information management system, and more particularly, to a computer-readable recording medium created using a resource management mechanism such as an SQL database or an indexed file. In the information management system to be performed, operations such as search / update / addition / deletion of current effective information, log information that was effective in the past, and information that will be effective in the future are efficiently performed. The present invention also relates to a database and an information management system that execute without contradiction.

[0002]

2. Description of the Related Art Conventionally, regarding changes in a database or the like,
A temporal database and a working information management system are known.

The above-mentioned temporal database is a system for storing, when data such as a database or a file is updated, an update history of the data (information on what previous information was and when the information was valid). It is. This temporal database, for example,
`` V.Lum et al., Designing DBMS Support for the Tempora
l Dimension, Proc. of ACM SIGMOD Conference, pp.1
15-130, 1984. , "R. Snodgrass et al., The Temporal Q
uery Language TQuel, ACM Transaction on Database
Systems, Vol. 12, No. 2, June 1987, Pages 247-29
8. "It is described in.

In the conventional temporal database disclosed in the above document, for each record corresponding to predetermined data, start time information indicating a time at which the data becomes valid and a time at which the data becomes invalid. The end time information and the update history thereof can be grasped. Further, in this conventional example, since the future expiration date cannot be set in the information field indicating the expiration date, all infinite times are set, and therefore, the information field indicating the expiration date is infinite. By setting the time, you can tell which record is currently valid.

[0005] On the other hand, the in-progress information management system is a system adopted by NTT's customer / rate information system. This system is used to set up a telephone or apply for various services from the start of the actual service. Can be received in advance. The above N
TT's customer and toll system is "Mitsuo Haga,
"Trends in Customer / Price Information Systems-Core Systems Supporting Customer Service Operations", NTT Technical Journal, Vo
l.7, No. 8, Pages 19-22, 1995.

[0006] In an in-progress information management system represented by the above-mentioned NTT customer / charge information system, generally,
Precedent reception is performed in which a service started from a certain date in the future is received prior to the start of the service. Specifically, a service order file, which is a file different from the actual file storing the actual customer service information, is provided, and information that will be effective in the future is stored in the service order file. The actual file is updated on the basis of the pending information stored in the service order file. In this case, the date on which the actual file is updated based on the in-progress information stored in the service order file is the date on which the actual file becomes effective.

[0007]

However, in the above-mentioned conventional temporal database, although past and present records are managed, there is a problem that a plurality of future change information cannot be managed. In other words, in the conventional temporal database, for example, when opening a telephone or applying for various services, a plurality of service contents of subscribing to the first service on the first day of the next month and subscribing to the second service on the first day of the next month are considered. There is a problem that it cannot be accepted.

On the other hand, the above-mentioned conventional in-progress information management system prepares a special file (service order file) for holding change information which becomes effective in the future, triggers a scheduler or the like, Although the database and the like are updated, however, when many people request the start of the service from the same time on the same day (for example, midnight on April 1), the information of all the people is 0
Sometimes it cannot be updated to a real file. That is,
A time lag occurs between the time when the real file should be updated and the time when the real file is actually updated. In other words, the conventional in-progress information management system can handle advance reception, but when updating a large amount of information that is received in advance and becomes effective from a certain time in the future at the certain time, a time lag occurs in the update. There is a problem.

In the above-mentioned conventional work-in-progress information management system, if related information related to the work-in-progress information is corrected between the time when the work-in-progress information is accepted and the time when the work-in-progress information is made valid, the correction is made. In some cases, it is necessary to correct information received earlier than related information, but this correction cannot be systematically arranged. For example, when customer A applies on April 1 to add a contract K indicating that the service will be started on May 1 and the same customer A proposes an address change on April 10 The contract from May 1 needs to be valid. However, if customer A applies for a contract K on April 1 stating that the service will be started on May 1 and that customer A applies for cancellation of all contracts on April 10, May It is necessary to cancel the contract from one day. In this way, in the above-mentioned conventional work-in-progress information management system, when information is added / changed at a certain point in time, including in the future, the work-in-progress information may be affected thereafter. There is a problem that can not be fixed dynamically.

An object of the present invention is to provide an information management system capable of preliminarily inputting a large amount of information valid from a certain point in the future and updating the large amount of information without a time lag at the certain point in the future. It is intended for.

Further, according to the present invention, information valid after a certain time in the future can be inputted in advance, and information valid after a certain time in the future can be re-changed /
It is an object of the present invention to provide an information management system capable of executing cancellation or the like.

Further, the present invention provides a method of receiving information that will become valid in the future, in a period from when the request is received until the request becomes valid, in relation to the previously received information, and Provided is an information management system capable of systematically correcting the previously received information when related information that is information that becomes valid before the time when the received information becomes valid is corrected. It is the purpose.

[0013]

According to the present invention, key information indicating the classification of a record held in a database, the time at which the record becomes effective or scheduled to become effective, and the time at which the record becomes invalid A field for storing the time at which the data becomes invalid or the time at which the data is to be invalidated is added to the above record, the data is retained in the database, and the current information, which is currently valid information, based on the current time and the valid / invalid time. And log information that was valid in the past, and pending information that is scheduled to be valid in the future.

[0014]

DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 is a block diagram showing an information management system IMS1 according to one embodiment of the present invention.

The information management system IMS1 has an application program AP, a real file 3, a log file 4, and a data management unit 5.

The end user 1 uses an information management system IM
The requester accesses the data managed by S1. The application program AP is a program created corresponding to a business system such as a customer management system and a seat reservation system, for example. The real file 3 is a file that stores data used by the application program AP.

The log file 4 is data that is determined by the application program AP from the log information (information that was valid in the past) stored in the real file 3 after a certain period has elapsed and the access frequency has decreased. Is an old information storage file for storing

FIG. 2 shows the actual file 3 in the above embodiment.
It is a figure showing an example of.

The real file 3 includes a plurality of records R1, R
, R3,..., And each record R1, R2, R
3,... Include a start date D1 and an end date D2,
A field for storing the AP data D3 is provided.

The start date D1 is data indicating the date when the record becomes valid or the date when the record becomes valid. The end date D2 is the date when the record becomes invalid or the date when the record becomes invalid. Time data. The AP data D3 is a section for holding information (name, address, telephone number, fax number, work place, date of birth, etc.) identified by the application program AP regarding customer information, contract information, and the like.

The first column of the AP data D3 is key information. In the above embodiment, the key information Key-1 and Key-2 are customer identifiers. In this storage structure, a plurality of records having the same key value are provided. Exists. Value-11, Value-12, Value-13, Value-1 in the second column of the AP data D3
.. Are stored, and Value-21, Value-22, Value-23, Value-24,... Are stored in the third column of the AP data D3. In the above embodiment, Value-11, Value-12, Valu stored in the second column of the AP data D3
e-13, Value-14,... are telephone numbers, and Value-21, Valu stored in the third column of the AP data D3.
e-22, Value-23, Value-24,... are FAX numbers.

A start date D1 and an end date D2
Is used as follows: That is, a plurality of records R
When R1, R2,... Are represented as records Ra, Rb, and Rc, when the AP data D3 is searched by the key information for uniquely identifying the AP data D3, generally, the records Ra, Rb, and Rc are stored. Obtainable. The records Ra, Rb, and Rc are as follows.

Record Ra is 0 or n records (1 ≦ n) satisfying end date time D1 <current date time, and record Rb is defined as start date time D1 <current date time <end date time D2. 0 or 1 record that satisfies, and the record Rc is 0 or n records (1 ≦ n) that satisfy the current date time <the start date time D1. The inequality sign “<” indicating the date and time indicates that the right side is later than the left side. For example, “the end date and time D1 <the current date and time” indicates that the current date and time are later than the end date and time D1. In other words, the end date time D1 is earlier than the current date time.

Then, among these retrieved data, the record R satisfying the end date time D2 <the current date time
a is treated as a log record (a record that is data that is not currently valid but was valid in the past, or data that was canceled before it became valid), and the start date D1 <current date <end date D2 Is treated as the current code (currently valid record), and the record Rc at the current date time <start date time D1 is regarded as a pending record (a record that is not currently valid but will be valid in the future). deal with.

The data management unit 5 includes a time designation search processing unit 5
1, a change processing unit 52, and a pending change processing unit 53
, An addition processing unit 54, a deletion processing unit 55, a pending deletion processing unit 56, a related information change processing unit 5a, and a batch migration processing unit 5b.

The time designation search processing section 51 is a section for searching for a record in the real file 3 which becomes valid at a certain time in accordance with an instruction from the application program AP.
For example, when performing this search, the application program AP specifies information Ia serving as a key of a record and predetermined time information Ib.

The time specification search processing unit 51 obtains a record under the following conditions based on the information Ia serving as a key of the record and the predetermined time information Ib, and returns the record to the application program AP. Condition 1: Record key = Ia Condition 2: Record start date D1 <Ib <Record end date D2 When the predetermined time information Ib is the current time, the current record (currently valid record) is obtained. Will be.

The change processing section 52 is a section that adds a current or future change request specified by the application program AP to the real file 3 and processes the real file 3 so that the change does not cause inconsistency. .

FIG. 3 shows the change processing section 5 in the above embodiment.
FIG.

A predetermined item (for example, telephone number) of information having a predetermined key Ia (for example, customer information) is changed so that it becomes effective after a predetermined time in the future = t2 (the telephone number 0001 is changed to 0002). It is assumed that record 2 is created, and after creating record 2, record 1 is created. Here, record 1 is
Another item of information having the same key Ia as above (eg,
FAX number) at a predetermined time in the future = t1 (time t1 is
This is a record that is changed so that it becomes valid after the current time is closer to the time t2 (changes the FAX number 1000 to 2000).

When the record 1 is created, it is necessary to change the facsimile number in the record 2 (change the facsimile number 1000 to 2000) in accordance with the change by the record 1. This processing is an example of “processing for preventing the real file 3 from causing inconsistency”.

The in-progress change unit 53 executes a future change process stored in the real file 3 so that the real file 3 is not inconsistent by the change process. is there.

The addition processing section 54 is a section for adding a record of a new key value to the actual file 3 in accordance with an instruction from the application program AP.

The deletion processing section 55 is a section for deleting all the current records or the ongoing records after the time designated by the application program AP.

The in-progress deletion processing unit 56 deletes the in-progress record in the real file 3 in accordance with an instruction from the application program AP, and controls the real file 3 so that the deletion does not cause inconsistency. Part.

The related information change processing unit 5a includes the change processing unit 5
2. Called by the in-progress change processing unit 53 and the in-progress deletion processing unit 56, first, in conjunction with the change processing unit 52, the in-progress change processing unit 53, and the in-progress deletion processing unit 56,
Search for a set of records that may need to change values, present the searched set to the application program AP, and, in response to an instruction from the application program AP, if necessary, That record is updated.

The batch migration processing unit 5b, in response to an instruction from the application program AP, elapses a predetermined period of time out of the log information (information stored in the log record) stored in the real file 3. This is a part for executing a process of transferring data determined by the application program AP to have become less frequently accessed to the log file 4.

Next, a more specific operation when the application program AP requests a search or the like will be described.

FIG. 4 is a flowchart showing the operation in the above embodiment when the application program AP requests a search or the like.

First, a time designation search is performed (S51). That is, among the data stored in the real file 3, A
The information for identifying the P data D3 and the search date and time are specified by the application program AP, and a search request is issued. When the data stored in the actual file 3 is, for example, customer information, a search is performed by designating a customer identifier or the like. Generally, a plurality of records satisfying this request are stored in the real file 3, and among them, “Record start time D1 <application program A
Retrieval date specified from P <end date of record D
Record that satisfies "2" in application program A
Return to P.

If the search date is the current date, a current search is performed. If the search date is earlier than the current date, a log search is performed, and the search date is later than the current date. If so, perform an ongoing search.

Then, a change process is performed (S52). That is, the application program AP specifies information for identifying the AP data D3 portion of the real file 3, and a change request is issued. First, the application program AP
The time specification search processing unit 51 issues a time specification search request using the time of the change date specified from, and information for identifying the AP data D3 portion as an argument, and obtains the record Rm to be changed. Then, by copying the record Rm to be changed, a new record Rm-new is created and added to the real file 3, and the start date and time of the new record Rm-new is changed by the change specified by the application program AP. Date time.

Further, the end time of the record Rm to be changed is changed at the change date designated by the application program AP, and the update of the record Rm to be changed and the addition of a new record Rm-new are performed in the real file. 3
Do for Then, using the new record Rm-new as an argument, a related information correction process described below is executed (S5a).

Next, an in-progress change process is performed (S5).
3). That is, the specified record in progress is changed. Specifically, the AP data D3 of the real file 3
The information for identifying the part is transmitted to the application program A
P designates and a pending change request is issued. First, a pending record Rm for which a change is requested is obtained according to a condition designated by the application program AP.
The record Rm to be changed is copied and a new record R
m-new is created and added to the real file 3, the change specified by the application program AP is executed on the new record Rm-new, and the start date and time of the record Rm to be changed are set to infinity; Log code. Then, using the new record Rm-new as an argument, a related information correction process is performed (S5a).

Next, additional processing is performed (S54). That is, a predetermined record is added at the present or future specified time. That is, it has the AP data D3 input from the application program AP, and the start date is the current date or the specified date,
A record R _add with an infinite end date is created, and the created record R _add is added to the real file 3.

Then, a deletion process is performed (S55). That is, information identifying the AP data D3 portion of the real file 3 and a deletion request specifying the time to delete are issued from the application program AP, and first, a time specification search request is issued to the time specification search processing unit 51. The record Rd to be deleted is obtained, and the end date of the record Rd to be deleted is changed to the date specified by the application program AP. Then, a set of pending records that are effective after the designated time is searched, and the date and time designated by the application program AP are
Set to end date and time D2. In this case, start date time D
If 1 and the end date and time D2 are reversed, it can be determined that this reversed record is a log record that was canceled before it became valid.

Next, the in-progress deletion is executed (S5).
6). That is, when the application program AP specifies information for identifying the AP data D3 portion of the real file 3, a pending deletion request is issued. That is, first, according to the condition specified by the application program AP, a pending record Rm for which deletion is requested is obtained, and the end date and time is set to the record R to be deleted.
m is searched for the in-progress or current record Rm-1 that is the same as the start date of m, and the end date D2 of the in progress or current record Rm-1 is changed to the end date D2 of the record Rm to be changed The date and time specified by the application program AP is set to the end date and time D2 of the record Rm to be changed, and the record Rm to be changed is assumed to be a log record canceled before becoming effective, and the current record The related information correction process is performed using Rm-1 as an argument (S5a).

In the related information correction processing (S5a), the start date time D1 is a record that is temporally later than the start date time D1 of the record Ra specified by the argument, and the AP data A search is made for a record in which the key information of the D3 part is the same as the record Ra specified by the argument, and a set S _inf1 of the _pending records is obtained.
A process request is made to the application program AP to determine whether or not to reflect the value of the record Ra added this time for each record in the set of in-progress records S _inf1 . The AP data D3 added this time and one AP data D of the set S _inf1 of the _pending records
_inf is passed to the application program AP, and if it needs to be modified, the AP data D3 to be modified is returned. If it is not required to be modified, one AP data D _inf of the set S _inf1 of the ongoing records is returned. .

The logic of the application program AP depends on the system. For example, it is necessary to inquire the user who has requested the addition or to determine whether or not the correction is necessary based on the knowledge accumulated in the application program AP. And get The AP data D3 is updated for the record that needs to be updated according to the correction information thus obtained.

Then, a batch transfer process (S5b) is performed.
In other words, the records that have passed the predetermined period Time are moved from the real file 3 to the log file 4, and this predetermined period Time is
The application program AP specifies. For all the records stored in the real file 3, it is checked whether or not the current date and time has passed a predetermined period Time or more from the end date and time D2. If so, a set _Slog of records in which the current date and time have passed a predetermined period Time or more from the end date and time D2 is obtained. Then, all records in the set _Slog of records are deleted from the real file 3 and written to the log file 4. Note that, depending on needs, all records in the record set S _log may be deleted from the real file 3 without writing to the log file 4.

In the above embodiment, the key information indicating the classification of the record held in the database, the time when the record becomes valid or the time when the record is scheduled to be valid, the time when the record becomes invalid, Alternatively, a field for storing the scheduled time to be invalidated is added to the record, and the record is retained in the database. Based on the current time and the valid / invalid time, the current valid information and the valid information in the past are used. The log information, which is the information that was previously, and the pending information, which is the information that will become effective in the future, are determined. This is a method in which the concept of the conventional temporal database is extended not only in the past and present but also in the future, and the date when a given record becomes valid is set to the valid time and stored before the actual file. At the time when the record is actually valid, the real file can be updated without any change, and a large amount of information can be updated without a time lag.

Further, in the above-described embodiment, in a state where a plurality of pieces of information to be made effective in the future are stored in the database, a predetermined information (a predetermined request) of the plurality of pieces of information is received until it becomes effective. In the meantime, if the related information related to the predetermined information is modified, or if a request to modify the related information is applied, the in-progress information group must be searched and related modified. Automatically collects possible information, and if the pending record is changed or deleted, it has the same key information as the above record, and it is longer than the scheduled time when the changed or deleted record becomes effective Records that will be activated at a later time
There is a related information correction unit that fetches all the records from the database and corrects the fetched records in accordance with the contents of the changed or deleted pending records. Thus, when certain information is changed, it may be necessary to correct it in connection with the change, and the information in progress can be collected without omission, for example, by showing this to the end user and interacting with it. In this way, necessary corrections can be made to the ongoing information. Therefore, information which is input in advance and becomes effective from a certain point in the future can be corrected without contradiction.

Further, in the above embodiment, since the log information after a predetermined period is transferred to another file by the batch processing, it is possible to prevent the performance deterioration due to the increase of the history information.

The key information, which is the first column of the AP data D3, may be an identifier of information managed by a record held in the database, such as a contract identifier or a service identifier, instead of the customer identifier.

[0055]

According to the present invention, it is possible to preliminarily input a large amount of information valid from a certain point in the future, and to update the large amount of information without a time lag at a certain point in the future. Play.

[Brief description of the drawings]

FIG. 1 is an information management system IMS according to an embodiment of the present invention.
FIG.

FIG. 2 is a diagram showing an example of a real file 3 in the embodiment.

FIG. 3 is a diagram illustrating a change processing unit 52 in the embodiment.

FIG. 4 is a flowchart showing an operation in a case where an application program AP requests a search or the like in the embodiment.

[Explanation of symbols]

 IMS1: information management system, AP: application program, 3: actual file, 4: log file, 5: data management unit, 51: time designation search processing unit, 52: change processing unit, 53: working change processing unit, 54: Addition processing unit, 55: Deletion processing unit, 56: In-progress deletion processing unit, 5a: Related information change processing unit, 5b: Batch transfer processing unit

Claims (6)

[Claims] 1. Key information indicating a classification of a record held in a database; a time when the record becomes valid or a time when the record is scheduled to be valid; and a time when the record becomes invalid or invalid. A computer-readable recording medium on which information management data is recorded, wherein a predetermined scheduled time and; are added to each of the records. 2. The record according to claim 1, wherein the record is current information that is currently valid information, log information that is information that was valid in the past, and pending information that is information that is scheduled to be valid in the future. And a computer-readable recording medium on which information management data is recorded. 3. The computer according to claim 1, wherein the record classification is an identifier of information managed by the record, such as a customer identifier, a contract identifier, and a service identifier. A readable recording medium. 4. Key information indicating a classification of a record held in a database, a time at which the record becomes valid or scheduled to become valid, and a time at which the record becomes invalid or invalid. Field assigning means for assigning a field for storing the time of the record to the record; a current time, a time at which the record becomes valid or scheduled to become valid, and a time at which the record becomes invalid or invalid Is determined based on the scheduled time to be used, current information that is currently valid information, log information that is valid in the past, and pending information that is scheduled to be valid in the future. An information management system comprising: a determination unit; 5. Classification of records held in a database is performed using key information, and among records held in the database, a pending record which is scheduled to be valid in the future is changed or deleted. Records that have the same key information as the key information of the changed or deleted record, and are scheduled to become effective at a later time than the scheduled time at which the changed or deleted in-process record becomes effective From the database; and related information modifying means for modifying a record retrieved by the retrieval means in accordance with the contents of the changed or deleted in-progress record. An information management system characterized by the following. 6. An invalid time adding means for adding a time at which the record becomes invalid or a time at which the record is to be invalid to a corresponding record; A record fetching unit that fetches all records whose elapsed time from the invalidation time is equal to or longer than a predetermined time from the database; and records fetched by the record fetching unit.
A batch migration processing means for batch migration to a file different from the database.