JPH06131220A - Customer master rearranging method - Google Patents

Abstract

PURPOSE:To add new customer information by rearranging a customer information file and automatically deleting old data. CONSTITUTION:Customer information of old writing date is searched for by comparing dates by using a table 1 which contains the writing dates of customer information and the customer information. The searched customer information and date are moved from the table 1 to a temporary saving area 5 and the data in a final date area 3 that a pointer 4 indicates and the data in the final customer information area 2 before the pointer 4 are moved to the table whose data are stored in the temporary saving area 5. Then the data stored in the temporary saving area 5 are moved to the table that the pointer 4 indicates. Consequently, the customer data having the old date to be deleted are saved in the final table, so the data are deleted; and then the address of the last date area 3 is stored in the pointer 4 and preparations for a next deleting process are made.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a customer master organization method.

[0002]

2. Description of the Related Art A conventional method of organizing a customer master is that even if a user manually looks at customer information one by one and deletes it when an area of a table storing customer information is full. The data that looks good is properly selected and deleted.

[0003]

In this conventional customer master organizing method, not only the deletion takes time, but also the customer data is deleted at random, so that the additional data writing area cannot be secured well.

[0004]

A customer master organization method according to the present invention comprises means for retrieving deletable customer information from a table storing customer information, and means for deleting customer data retrieved by this retrieving means. And a means for securing a free area in a table storing customer information.

[0005]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described with reference to the drawings.

FIG. 1 is an explanatory view of an embodiment of the present invention.
FIG. 2 is a flowchart showing the processing of this embodiment.

Referring to FIG. 1, a table 1 is prepared in advance.
Store customer information of multiple customers in customer information area 2,
The stored date is stored in the date area 3 of the table 1.

When the user sets the number of items to be deleted and confirms the execution, the operation is started.

First, it is determined whether or not the number of deletions set by the user is zero in the zero comparison processing 6 of the number of deletions in FIG. If it is not zero, the date comparison process 7 is performed. The address of the first date area and the address of the second date area in Table 1 are comparison data addresses in the date comparison processing 7. The dates that are the contents of these addresses are compared.

Next, in the pointer comparison processing 8, the pointer 4 indicating the address of the date area of the final customer data in the table 1 and the larger address of the dates compared in the date comparison processing 7 are compared. As a result, if the address of the pointer 4 is larger, the process returns to the date comparison process 7. Then, as a result of the previous date comparison processing 7, the content of the address of the old customer data and the address of the date area of the next customer data, in this example, the content of the address of the third date area, the current date. Comparison processing 7 is performed.

This loop is repeated while the address of the pointer 4 is larger.

Then, when the result of the pointer comparison processing 8 becomes equal to the address of the pointer 4, the data replacement processing 9 is performed. In the data exchange process 9,
First, as a result of the date comparison process 7, the data of the customer information area 2 and the data of the date area 3 which have become old customer data are moved from the table 1 to the temporary save area and stored. Then, the data in the customer information area 2 before the address indicated by the pointer 4 and the data in the date area 3 at the address indicated by the pointer 4 are moved to and stored in the customer information area 2 and the date area 3 which are empty in the table 1. . Thereafter, the old customer data stored in the temporary save area 5 is moved to and stored in the customer information area 2 before the address indicated by the pointer 4 and the date area 3 indicated by the pointer 4.

This completes the data exchange processing 9,
Count change processing 10 is performed. Count change processing 10
Then, the customer information area length and the date area length for one customer are calculated from the address of the pointer 4, and the result is stored in the pointer 4. Also, 1 is subtracted from the number of deleted items. Then, in the deletion processing 11, the data in the customer information area after the pointer 4 and the data in the subsequent date area are deleted. With this, one customer data can be deleted.

After that, the process returns to the zero comparison processing 6 of the number of deletions, and this loop is repeated until the number of deletions becomes zero.

[0015]

As described above, according to the present invention, the customer information management table is searched for deletable customer data, and a free area is secured after the deletion, so that the customer information is automatically and easily organized. There is an effect that can be.

[Brief description of drawings]

FIG. 1 is an explanatory diagram of an embodiment of the present invention.

FIG. 2 is a flowchart showing a process of an embodiment of the present invention.

[Explanation of symbols]

 1 Table 2 Customer information area 3 Date area 4 Pointer 5 Temporary save area 6 Zero comparison processing of the number of deletions 7 Date comparison processing 8 Pointer comparison processing 9 Data replacement processing 10 Count change processing 11 Delete processing

Claims (1)

[Claims] 1. A means for retrieving deletable customer information from a table storing customer information, a means for deleting customer data retrieved by this retrieving means, and an empty area for a table storing customer information. A method for organizing a customer master, comprising: