JPH03296838A - History data managing system - Google Patents

Abstract

PURPOSE:To rapidly execute data retrieval by forming a history file provided with the latest file and a data part having an index are for storing past history data and a pointer pointing out the address of a file storing past history data older than the stored past history data. CONSTITUTION:When the address of an inhabitant is changed, a management program executes change processing 13, forms a history file and stores the file in a data part 19c. When the address of the inhabitant is changed again, the management program forms a history file, stores the personal information of the history file in the data part 19b of the history file and stores the pointer '1111' of the index part 17c of the history file in the index part 17b of the history file 11b.

Description

[Detailed Description of the Invention] [Objective of the Invention] (Industrial Application Field) The present invention is a system for managing arbitrary changes in historical data such as moving in, moving out, birth, death, etc., such as in a resident record system. Regarding data management methods.

(Prior Art) The conventional historical data management method applied to the above resident record system stores personal information of each resident, such as the resident's name, date of birth, address, and permanent domicile, in 11 nodes. There is. Here, when the resident's address changes, the history data management method updates the address area of the resident's personal information stored in the 1-no code to the changed address. Further, in the above-mentioned history data management method, when a resident moves out, the outgoing area of personal information of 1 code is updated to the date and time of the outgoing. In this way, when a resident's address, etc. changes, the historical data management system updates the address, etc. of personal information stored in the record. The above method for managing error history data uses a management program to manage the data, so regardless of the amount of personal information of residents, the unused space is reduced by securing a space for storing resident's personal information. Is that what you're looking for?

(Problems to be Solved by the Invention (7)) Conventional history data management methods ensure the area of the code regardless of the amount of personal information of residents. In some cases, there is a large amount of unused memory space, leading to waste of memory capacity.On the other hand, in cases where there is an extremely large amount of personal information about residents, personal information that cannot be stored in the roux code occurs, causing problems with the resident record system. (-5, there was a risk that system functionality would deteriorate.

The present invention has been made in view of the above, and its purpose is to prevent an increase in the unused area of memory when there is little historical data, and to prevent historical data that cannot be stored in memory due to an increase in historical data. 1-7: Efficient use of memory < L. One object is to provide a data management method that improves the functionality of the system by speeding up the search of the historical data.

[Configuration of the Invention (Means for Solving the Problems)] In order to achieve the above object, the present invention provides att.1. of a file in which the latest historical data is stored. an index area that stores a pointer that points to the current file; and an index area that stores the latest history data and past history data, and has an index area that stores a pointer that points to the current file. The latest file that has been stored, and the index section that stores a pointer that points to the address of the file where past history data is stored in the address pointed by the pointer stored in the index area of the data section of this latest file, and the past history. a history file containing data and a data section having an index area for storing a pointer pointing to an at-1 node of a file that stores historical data even past the past historical data; and a data section of the Kurashin file. When updating the latest history data stored in , a pointer pointing to the address of the latest file that stores the history data to be updated is stored in the index section of the new file, and then stored in the index section of the latest file. means for storing a pointer pointing to the address of the file of the latest historical data stored in the index area of the data section; and a file storing the past historical data stored in the index area of the data section of the latest file. A pointer pointing to the address of the file is stored in the index section of the history file, and a pointer pointing to the address of the file in which past history data stored in the index section is stored is stored in the index area of the data section of the history file. The gist is that the system is equipped with a means for storing the information in the computer, and a means for storing the information in the computer.

(Operation) In the history data management method having the above configuration, when updating the latest history data stored in the latest file, a pointer pointing to the address of the file storing the history data to be updated is moved to the index of the latest file. Store it in the section. A pointer pointing to the address of the file where the latest history data stored in the index section of the latest file was stored is stored in the index area of the data section, and the past data stored in the index area of the data section is stored. A pointer pointing to the address of the file in which the history data of is stored is stored in the index section of the history file.

The history data to be updated is stored in the data section of the latest file. Store the pointer of the file in which the past history data stored in the index part of the above history file is stored in the index area of the data part, and move the latest history data stored in the data part of the latest file to the relevant file. Since history data is managed by storing it in the data section of the history file, memory can be used efficiently.

(Example) Hereinafter, the present invention will be explained in detail using the drawings.

FIG. 1 is a schematic diagram showing an embodiment in which the history data management method of the present invention is applied to, for example, a resident record system.

The pre-transfer 1 current file 3a (latest file) in the resident record system is a towed organization file, and stores the latest personal information such as the name, address, date of birth, and permanent domicile of each resident. The current file 3a has an index section 5a that stores a pointer (index No.) that is the address of the current file at the top address.

In addition, the current file 3a includes a data section 7 that stores the latest personal information of each resident at the next address of the index section 5a.
It has a. Furthermore, the current file 3a has an index area 9a that stores a pointer pointing to the address of a history file l1g that stores history data that is personal information of each resident before the transfer occurs in any area of the data section 7a.
has.

Currently, the index section 5a is a 4-digit character rl
111J is stored.

However, since the file 3a is currently the personal information of the first resident, no data is stored in the history file lla, and no pointer is stored in the index area 9a of the data section 7a.

The history file lla is a traction organization file having the same format as the current file 3a.

The history file 11a is created at the address pointed to by the pointer stored in the index area 9a of the data section 7a of the current file 3a.

Among the residents' personal information stored in the data section 7a of the current file 3a, for example, when the resident's address changes, the transfer process 13 is performed, and the current file 3a and the history file 11a are changed after the transfer shown in the figure. It will be in state 15.

The current file 3a and the history file lla after the above transfer 15 will be explained.

Among residents' personal information, for example, when a change of address occurs, the current file 3a is changed to the data section 7a by the transfer process 13.
The address area of is rewritten to the changed address, and the pointer of rl 111J stored in the index section 5a is stored in the index area 9a of the data section 7a.

Furthermore, a pointer r2222J pointing to the address of the current file 3a after the transfer is stored in the index section 5a of the current file 3a. In addition, the current file 3a is stored in the data section 19a of the history file lla in which personal information 1 before transfer, which was stored in the data section 7a, is stored in the transfer process 15, and the current file 3a
The pointer "1111" stored in the index area 9a of the data section 7a is stored in the index section 17a of the history file IIH.

A case where a plurality of history files are created due to a change in the resident's personal information due to a change in the resident's address will be explained using FIG. 2.

The current file 3a stores a pointer rnJ pointing to the address of the current file 3a in the index section 5a,
The index area 9a of the data section 7a stores a pointer rn-IJ pointing to the address of the history file. A history file is created at the address pointed to by the pointer rn-IJ, and a pointer r3333J is created in the index section 17c of the history file 11C, and the history file 1 is created in the index area 21c of the data section 19c.
A pointer r2222J pointing to the address of the history file llb before the transfer of 7e is stored, and the pointer r2222J is stored. Above pointer r
A history file llb is created in the pointing finger of 2222J, and the corresponding H history file llb is stored in the index area 211'3 of the data section 19b of the history file llb.
Pointer rl that points to the history file lla before the transfer of 1
11J is stored.

As mentioned above, for example, if there is a change of address or Then, sequentially,
Since the personal information of the current file 3a is stored in the history file, even if the number of times due to transfer increases, the personal information of the resident before the transfer can be stored in the history file.

Creation of a history file and the like by the transfer process 13 described above is executed by the management program.

Next, the operation of this embodiment will be explained.

First, the latest resident personal information is stored in the data section 7a of the current file 3a, and a pointer rl 111J pointing to the address of the current file 3a is stored in the index section 5a.

When the address of the above resident is changed, the management program executes the transfer process 13 to create a history file llc, and stores the personal information currently stored in the data section 7a of the file 3a in the pig section 19C of the history file llc. . The management program stores a pointer "2222" pointing to the address of the current file 3a in the index section 5a of the current file 3a, and stores the personal information of the changed address in the data section 7a. The management program also creates a pointer r pointing to the address of the history file llc in the index area 9a of the data section 7a of the current file 3a.
Store llllJ.

Furthermore, the occupation management program for which the resident's address changes creates a history file llb] and stores the personal information of the history file 11c in the data section 19b of the history file 11b, and stores the personal information in the index section of the history file llb], 7
The pointer rl 111J of the index section 17c of the history file llc is stored in b. Also, currently file 3
The pointer r2222J stored in the index section 5a is stored in the index area 9a of the data section 7a of the file 1~, and the pointer r3333J pointing to the address of the current file 3a is stored in the index section 5a.

In this way, personal information such as changed addresses is stored in the history file.

Next 1. When searching for personal information stored in the history file llc, the data section 7a of the current file 3a
By referring to the pointer stored in the index area 9a of 7 and searching for the pointer stored in the index section of the history file of the address pointed to by the pointer, desired employee information can be quickly retrieved. .

As a result, even if personal information such as a resident's address changes due to a transfer, the personal information before the transfer is stored in the history file, so memory can be used efficiently and the functionality of the system is improved.

Further, since the index area of the data section and the like are sequentially referred to when searching for desired personal information, the search process can be executed at high speed.

This example explains the case where it is applied to a resident record system.
．． However, it is of course applicable to systems that handle historical data.

[Effects of the Invention] As explained above, according to the present invention, it is possible to prevent an increase in the unused area of the memory when there is a small amount of history data, and on the other hand, it is possible to prevent the increase in the unused area of the memory when there is a small amount of history data. By preventing this occurrence and using memory efficiently (2), and by speeding up the search of the historical data, it is possible to improve the functionality of the system.

[Brief explanation of drawings]

FIG. 1 is a schematic diagram showing processing of an embodiment of the history data management system of the present invention, and FIG. 2 is a diagram showing a current file and a history file. 3a...Current files 5a, 17a to 17e...Index section 7a, 19a
~19e...Data section 9a, 21a-21c/index area 11a-ll
c...History file

Claims (1)

[Claims] An index section that stores a pointer that points to the address of a file that stores the latest history data, and a pointer that stores a pointer that points to the address of the file that stores the latest history data and past history data. A pointer pointing to the address of a file storing past historical data is set to the address pointed to by the pointer stored in the index area of the data part of this latest file. a history file comprising an index section for storing past history data and a data section having an index area for storing a pointer pointing to an address of a file storing past history data and history data even past the past history data; When updating the latest history data stored in the data section of the latest file, a pointer pointing to the address of the latest file that stores the history data to be updated is stored in the index section of the latest file, and means for storing a pointer pointing to the address of the file of the latest historical data stored in the index section in the index area of the data section; and storage of the past historical data stored in the index area of the data section of the latest file. A pointer that points to the address of the file that is being stored is stored in the index section of the history file, and a pointer that points to the address of the file that stores the past history data that was stored in the index section is stored as the data of the history file. A history data management method characterized by comprising: means for storing data in an index area of a section;