JPH10275102A - Data storing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To eliminate trouble arising when individual users of a family optionally use stored data that all of the family share by adding an erasure mark to a place corresponding to a user identifier in an erasure identifier area and erasing data when erasure marks as many as the members of the family are obtained. SOLUTION: A family information setting means 21 sets family information. A data adding means 22 adds the family information set by the family information setting means 21 and the erasure identifier area to data sent through a public line. A user identifier input means 23 inputs a user identifier specifying a user of the family. An erasure mark adding means 24 adds an erasure mark corresponding to the user identifier inputted by the user identifier input means 23. A data storing means 25 stores the data inputted through the public line, family information, and erasure mark. Then a data erasing means 26 erases the data stored in the data storage means 25. Consequently, the stored data can be protected.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data storage method for storing communication data transmitted through, for example, a public line and displaying the data on, for example, a television receiver or a monitor.

[0002]

2. Description of the Related Art Conventionally, moving pictures, still pictures,
Information such as voices, characters, and programs are exchanged. However, in either case of the Internet or personal computer communication, the information receiver side accesses the information source and selects and downloads (downloads) necessary information from the storage device of the information source. Therefore, the receiver cannot obtain the information without taking any action on the source of the information. That is, unlike a general television broadcast, information cannot be obtained by a simple operation such as simply selecting a channel. As described above, an information communication system that requires an operation on the receiver side cannot be used as information communication means for publicity and publicity.

There is a facsimile service as an information communication service that does not require the receiver to perform any operation. However, data that can be handled is limited to still images, and moving images, voices, programs, and the like cannot be communicated. Therefore, for such a problem of multimedia information communication,
In recent years, a large number of recipients who want to receive information from a source of information have access to the public line, and then send the information to the recipient and store it at the recipient, regardless of whether the recipient (home) needs the information. The receiving side selects the display operation of the data storage device (that is, the data receiving device) so that the information is displayed on the screen by the same operation as, for example, the channel selection of the television broadcast. Information communication systems are being considered.

[0004]

In the information communication system described above, a data storage device (data receiving device) for storing and displaying data may be provided in each household, one for each family member. No, one in the family
It is considered that there is often a setting situation of a table. In such a situation, the entire family shares the stored data, but the use of the stored data, for example, browsing the stored data, is arbitrarily performed, and the stored data shared by the whole family is used. Various inconveniences may occur when the family members freely use the data.

[0005] For example, the stored data is erased before all the family members sharing the stored data use the stored data, and there is a possibility that a person who needs to use the stored data cannot use the stored data. Also, if you do n’t allow data to be erased until everyone in the family has used it,
Unless one of the family members intends to use the data, the data cannot be deleted indefinitely, and a finite data storage area may be wasted and new data may not be stored. .

[0006] Also, when one of the family users wants to use the data once and then save it for re-use, the data is deleted by another user of the family and reused. It may not be possible. Further, if one user changes the name of the stored data without permission in order to facilitate data management such as search of stored data, other users cannot perform data management such as search, and each user is required to change the name. Cannot easily manage data.

[0007] Further, simply accumulating data cannot improve the convenience of reusing the accumulated data. On the other hand, if one of the family users adds related data to the accumulated data, When other users use the stored data, they do not know who added the related data,
This can cause confusion when using the data. In addition, each user of the family has a different position in the family. For this reason, for example, when a case where accumulated data composed of character data is displayed is considered, it is difficult to appropriately cope with all the family users with one type of data display mode. For example, even if character data is displayed in a form that heavily uses kanji to elementary school students who cannot read kanji, information is not effectively transmitted, and even if small people are unable to read small characters, etc. There is a problem that information is not effectively transmitted.

[0008] Further, if the use order of the stored data is not determined, the data is deleted by the previous user, and the user who needs to use the data cannot use the data. In addition, if one of the family users specifies the storage of the stored data so that the stored data cannot be erased, for example, when a child of the family user specifies the storage of the stored data, There is a problem that even when a parent among family users views the stored data and considers it unnecessary, the stored data cannot be deleted.

A first object of the present invention is to provide a data storage method capable of eliminating the inconvenience that occurs when each user of a family uses the stored data shared by the whole family arbitrarily. . A second object of the present invention is to provide a data storage method capable of protecting stored data until all family members sharing the stored data have used the stored data.

A third object of the present invention is to provide a data storage method capable of preventing new data from being unable to be stored due to a shortage of a data storage area. A fourth object of the present invention is to provide a data storage method capable of protecting stored data when at least one of the family users needs to store the stored data.

[0011] A fifth object of the present invention is to provide a data storage method capable of easily performing data management for each family user. A sixth object of the present invention is to provide a data storage method capable of adding arbitrary related data to data stored by respective members of a family and improving the convenience of reusing the data. That is.

[0012] A seventh object of the present invention is to provide a data storage method capable of providing optimum data to a family user. An eighth object of the present invention is to provide a data storage method which allows a family user to browse stored data in a predetermined order. A ninth object of the present invention is to provide a data storage method capable of deleting stored data by a user having a high erasing priority even when at least one of the family users specifies storage of the stored data. That is.

[0013]

According to a first aspect of the present invention, there is provided a data storage method, wherein an erasure identifier area corresponding to the number of family members is added to each data to store the data, and the data is stored in a user of the family. Each time a user browses, a unique user identifier is input, an erasure mark is added to a location corresponding to the user identifier in the erasure identifier area, and data is erased when the number of erasure marks is equal to the number of family members. And

According to this method, an erasure mark is added to a location corresponding to the user identifier in the erasure identifier area,
Since the data is deleted when the erasure marks have been collected for the number of members of the family, it is possible to eliminate the inconvenience that occurs when each member of the family uses the stored data shared by the whole family arbitrarily. Until all the family members sharing the stored data have used the stored data, the stored data can be protected from being deleted.

According to a second aspect of the present invention, there is provided a data storage method comprising:
Each of the data is added with an erasure identifier area for the number of family members, and the data is stored. Each time a user of the family browses the data, a unique user identifier is input, and the user identifier in the erasure identifier area is entered. An erasure mark is added to a location corresponding to the data, and when the remaining storage area of the storage area for storing data becomes smaller than the set amount, the data is displayed as an erasure candidate in ascending order of the number of erasure marks.

According to this method, an erasure mark is added to a location corresponding to the user identifier in the erasure identifier area,
When the remaining storage area of the storage area for storing data becomes smaller than the set amount, the data with the largest number of erasure marks are displayed as erasure candidates in order, so the accumulated data shared by the whole family can be arbitrarily selected by family users. It is possible to solve the inconvenience that occurs when using the data, and it is possible to prevent the new data from being unable to be stored due to the shortage of the data storage area.

According to a third aspect of the present invention, there is provided a data storage method comprising:
Each of the data is added with an erasure identifier area for the number of family members, and the data is stored. Each time a user of the family browses the data, a unique user identifier is input, and the user identifier in the erasure identifier area is entered. When the remaining storage area of the storage area for storing data is smaller than the set amount, erasure marks with different weights are added to locations corresponding to It is characterized by displaying.

According to this method, an erasure mark having a different weight is added to a location corresponding to the user identifier in the erasure identifier area, and the remaining storage area of the storage area for storing data is smaller than the set amount. Sometimes, the data with the largest sum of the erasure marks is displayed as erasure candidates in order, so that it is possible to eliminate the inconvenience that occurs when each family user arbitrarily uses the accumulated data shared by the whole family, In particular, it can be prevented that new data cannot be stored due to a shortage of the data storage area.

According to a fourth aspect of the present invention, there is provided a data storage method comprising:
A storage identifier area corresponding to the number of family members is added to each of the data to accumulate the data, and when the data needs to be stored, a unique user identifier of the family user is input and used in the storage identifier area. A save mark is added to the location corresponding to the user identifier, and when deleting data, if the save mark of another user in the family is added to the save identifier area, the other user's name is displayed and a warning is issued. It is characterized by the following.

According to this method, when data is deleted, if the storage mark of another user of the family is added to the storage identifier area, the name of the other user is displayed and a warning is issued. It is possible to eliminate the inconvenience that occurs when each family user uses the stored data shared by the user at any time, especially when at least one of the family users needs to store the stored data. Data can be protected.

According to a fifth aspect of the present invention, there is provided a data storage method comprising:
An alias area corresponding to the number of family members is added to each of the data and the data is accumulated, and a unique user identifier of the family user is input, and an alias is added to the alias area corresponding to the user identifier, It is characterized in that data management such as retrieval is performed based on an alias added to each family user. According to this method, a unique user identifier of a family user is input, an alias is added to an alias area corresponding to the user identifier, and a search or the like is performed based on the alias added for each family user. Since data management is performed, it is possible to eliminate the inconvenience that occurs when each family user uses the stored data shared by the whole family arbitrarily, and in particular, facilitates data management especially for each family user. be able to.

According to a sixth aspect of the present invention, there is provided a data storage method comprising:
A related data area corresponding to the number of family members is added to each of the data and the data is accumulated, and a unique user identifier of the family user is input, and the related data is stored in the related data area corresponding to the user identifier. It is characterized by being added. According to this method, the unique user identifier of the family user is input and the related data is added to the related data area corresponding to the user identifier. The inconvenience that occurs when each user freely uses the data can be resolved, and in particular, it is possible to add arbitrary related data to the data accumulated by each user of the family and improve the convenience when reusing the data. be able to.

According to a seventh aspect of the present invention, there is provided a data storage method comprising:
The data has an operation area for each family member with a representative family structure, and different family data for each family member is sent together from the transmission side to the reception side, and the data is stored on the reception side, A correspondence between the family structure on the receiving side and a typical family structure assumed on the transmitting side is taken by the receiving side, and an operation according to the user of the family is executed, thereby selecting and displaying any one of the family data. It is characterized by the following.

According to this method, any one of the family data is selected and displayed by executing an operation corresponding to the user of the family, so that the accumulated data shared by the whole family can be obtained by each user of the family. Can be eliminated, and optimal data can be provided particularly for each family user. In the data storage method according to the present invention, a priority area corresponding to the number of family members is added to each of the data, and the browsing priorities of the family users are set in the data priority areas to store the data. In advance,
Refers to the read information of all users of the family when the unique user identifier of the family user is entered, and only when other users with higher browsing priority than the family user are not unread Data is displayed, and when the data is displayed, the read information is set corresponding to the family user.

According to this method, when the user identifier unique to the family user is input, the read information of all the family members is referred to, and the other user having higher browsing priority than the family user is referred to. Data is displayed only when the user is not browsing, and when the data is displayed, the read information is set according to the family user. It can eliminate the inconvenience that occurs when each user voluntarily uses it, especially for family users,
The stored data can be browsed in a predetermined order.

According to a ninth aspect of the present invention, there is provided a data storage method comprising:
A data class is added to the data and sent from the sending side to the receiving side, and the receiving side adds a priority area for each family member to each of the data, and a family user corresponding to the data classification in the data priority area. Set the browsing priority of the family and accumulate the data, and when entering the unique user identifier of the family user, refer to the read information of all family members and browse from the family user It is characterized in that data is displayed only when another user with a high priority is not browsing, and when the data is displayed, the read information is set corresponding to the family user.

According to this method, when the user identifier unique to the family user is input, the read information of all the family users is referred to, and the other users having higher browsing priorities than the family users are referred to. Data is displayed only when the user is not browsing, and when the data is displayed, the read information is set according to the family user. It can eliminate the inconvenience that occurs when each user voluntarily uses it, especially for family users,
The stored data can be browsed in a predetermined order.

According to a tenth aspect of the present invention, in the data storage method, a storage identifier area corresponding to the number of family members is added to each data, and an erasure priority area corresponding to the number of family members is added. Set the erasure priority of the family user in the field and store the data, and when the data needs to be stored, enter the unique user identifier of the family user and enter the user identifier in the storage identifier area. When a save mark is added to the corresponding location and the save mark of another user of the family is added to the save identifier area when deleting the data, When the deletion priority is higher than other users, the data is deleted as it is, and when the data is deleted, the family user is saved if the save mark of the other user of the family is added to the save identifier area mark Other erase priority than the user of the attached family is characterized in that the warning displays the names of other users of the family at the time low.

According to this method, when data is deleted, the storage mark of the other user of the family is added to the storage identifier area, and the user of the family can delete the storage mark of the family. Data is erased as it is when the erasure priority is higher than that of other users, so it is possible to eliminate the inconvenience that occurs when each family member uses the stored data shared by the whole family arbitrarily. When at least one of the users designates storage of the stored data, the stored data can be deleted by a user having a higher erasing priority.

[0030]

Embodiments of the present invention will be described below with reference to the drawings. [First Embodiment: Corresponding to Claim 1] In the first embodiment, data to be stored has an erase identifier data area for the number of family members, and an erase mark is added when an erase operation is performed. A data storage device for implementing a data storage method characterized by having a data protection mechanism that prevents data from being deleted unless the number of erasure marks corresponding to the data is equal to the number of family members. It is. Hereinafter, the configuration and operation will be described in detail.

FIG. 1 is a block diagram showing a hardware configuration of a data storage device according to the first embodiment of the present invention. In FIG. 1, reference numeral 1 denotes a CPU. 2 is DRA
M and other main storage devices. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information such as a family name. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. 6 is VRAM (video RAM)
It is.

The stored data includes a script file, a text file, a still image file, a moving image file, an audio file, a data format information update table indicating a new data format, and the like transmitted through a public line. As shown in FIG. 5, a data part Z1 for storing main information such as a script, a text, a still image, a moving image, and audio, and a header part Z2
And a data format part Z3. The header part Z2, the data format part Z3, the data part Z1
It is arranged in the order of.

In the header part Z2, information relating to communication, for example, "communication protocol version information", "source telephone number", "source name", "source industry (code predetermined for each industry)", " Transmission start date and time ". Further, the data format section Z3 mainly includes data format information indicating a data format format of main information such as a script, text, still image, moving image, audio, and data format information update table.
This data format information has a data structure of, for example, 4 bytes, and a code for distinguishing a media type (type such as script, text, still image, moving image, audio, data format information update table, etc.) is set in the preceding 2 bytes. A code indicating a specific format type of each media type is set in the last two bytes. For example, in the case of a still image, it is a code for distinguishing the Bitmap format, the JPEG format, and the like.
In the case of text, it is a code for distinguishing the Plain format, the HTML format, and the TeX format. In addition, if necessary, the content classification (accumulation information, opening notice, etc.) of accumulated data, data size (size of accumulated data), character code (character code type for displaying comments), comment Related data) and data format part Z3
Is added to

FIG. 2 is a block diagram showing a system configuration of the data storage device according to the first embodiment of the present invention. In FIG. 2, reference numeral 21 denotes family information setting means for setting family information. Reference numeral 22 denotes a data adding unit for adding the family information set by the family information setting unit 21 and the erasure identifier area to the data transmitted through the public line. Reference numeral 23 denotes a user identifier input unit for inputting a user identifier for identifying a family user. Numeral 24 denotes an erasure mark adding means for adding an erasure mark corresponding to the user identifier input by the user identifier input means 23. Reference numeral 25 denotes data storage means for storing data, family information, and erasure marks input through a public line. 26 is a data erasing means for erasing the data stored in the data storing means 25.

FIG. 3 is a flowchart showing a data addition algorithm in the data storage device, and FIG. 4 is a flowchart showing a data deletion algorithm. In the data addition algorithm, it is first determined whether or not family information is set (step A1). If family information is not yet set, family information is set (step A2). An erasure identifier area is created (step A3). Thereafter, family information and an erasure identifier area are added to the data to be stored (step A4), and the process ends. The data to which the family information and the erasure identifier area are added are stored thereafter.

On the other hand, in the data deletion algorithm, the stored data is browsed first (step B1), and then a user identifier is input (step B2). As a result, an erasure mark is added to the area corresponding to the user identifier (step B3). Then, it is determined whether or not the erasure mark of all the family members has been set (step B4).
When the erasure mark of all the family members is given based on the determination result of step 4, it means that all the family members have browsed and given permission for erasure. Therefore, the accumulated data is erased (step B5), and the process is terminated. If there is no erasure mark for all members, the process ends without erasing the corresponding data.

According to this embodiment, an erasure mark is added to a location corresponding to the user identifier in the erasure identifier area, and the data is erased when the number of erasure marks is equal to the number of family members. It is possible to eliminate the inconvenience that occurs when family members use the stored data voluntarily, and protect the stored data until all the family members sharing the stored data use the stored data. To prevent it from being deleted.

[Second Embodiment: Corresponding to Claim 2] In the second embodiment, data to be stored has an erasure identifier data area corresponding to the number of family members, and is erased when an erasing operation is performed. A data storage device for implementing a data storage method characterized in that when a storage area is insufficient, deletion candidates are displayed in order from the one with the largest deletion mark when the storage area is insufficient, and the user is prompted to delete the data. It shows. Hereinafter, the configuration and operation will be described in detail.

FIG. 6 is a block diagram showing a hardware configuration of a data storage device according to the second embodiment of the present invention. In FIG. 6, reference numeral 1 denotes a CPU. 2 is DRA
M and other main storage devices. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information such as a family name. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. 6 is VRAM (video RAM)
It is. Reference numeral 7 denotes an erase candidate display section for displaying erase candidates.

The above stored data is the same as that described in the first embodiment. FIG. 7 is a block diagram showing a system configuration of a data storage device according to the second embodiment of the present invention. In FIG. 7, reference numeral 31 denotes family information setting means for setting family information. Reference numeral 32 denotes a data adding unit for adding the family information set by the family information setting unit 31 and the erasure identifier area to the data transmitted through the public line. 33 is a user identifier input unit for inputting a user identifier for identifying a family user.
Numeral 34 denotes an erasure mark adding means for adding an erasure mark corresponding to the user identifier input by the user identifier input means 33. Reference numeral 35 denotes data storage means for storing data, family information, and erasure marks input through a public line. Numeral 36 denotes an erasure candidate display means for displaying as a erasure candidate in order from a plurality of data accumulated in the data accumulation means 35 with the most erasure marks. 37 is a data erasing means for erasing the data stored in the data storing means 35.

FIG. 8 is a flowchart showing a data addition algorithm in the data storage device, and FIG. 9 is a flowchart showing a data deletion algorithm in the same manner. In the data addition algorithm, it is first determined whether or not family information has been set (step C1). If family information has not been set, family information is set (step C2). An erasure identifier area is created (step C3), and then family information and an erasure identifier area are added to the data to be stored (step C4). Subsequently, it is determined whether or not the remaining storage area in the storage area for data storage is smaller than the set amount (step C5). If the remaining storage area is smaller than the set amount based on the determination result in step C5, an erasure candidate is determined. Is displayed (step C6), the deletion of the data is urged, and the processing ends.
If the remaining storage area is larger than the set amount, the process ends. The data to which the family information and the erasure identifier area are added are stored thereafter. In addition, when displaying the above deletion candidates, “delete”,
By displaying a menu such as "do not erase" or "quit" and designating the above menu by using input means such as a remote controller, one of the above processes can be selectively executed. When the processing is completed for one display data, the next deletion candidate is displayed.

On the other hand, in the data deletion algorithm, the stored data is browsed first (step D1), and then a user identifier is input (step D2). As a result, an erasure mark is added to the area corresponding to the user identifier (step D3). Then, it is determined whether or not the erasure mark of all the family members has been set (step D4).
When the erasure mark of all the family members is given based on the determination result in step 4, the entire family members have been permitted to browse and erase the data, so the accumulated data is erased (step D5), and the process is terminated. If there is no erasure mark for all members, the process ends without erasing the corresponding data.

According to this embodiment, an erasure mark is added to a location corresponding to the user identifier in the erasure identifier area, and when the remaining storage area of the storage area for storing data becomes smaller than the set amount, the erasure mark is added. Since the data with the largest number of data is displayed as erasure candidates in order, it is possible to eliminate the inconvenience that occurs when each family member uses the stored data shared by the whole family arbitrarily. It is possible to prevent data storage from becoming impossible.

[Third Embodiment: Corresponding to Claim 3] In the third embodiment, data to be stored has an erase identifier data area for the number of family members, and is erased when an erase operation is performed. In addition to marking, the deletion mark is given a weight for each family user, and when the storage area is insufficient, the deletion marks are displayed as deletion candidates in descending order of the sum of the deletion mark weights, prompting the user to delete the data. 1 shows a data storage device for implementing a data storage method characterized by the following. Hereinafter, the configuration and operation will be described in detail.

FIG. 10 is a block diagram showing a hardware configuration of a data storage device according to the third embodiment of the present invention. In FIG. 10, reference numeral 1 denotes a CPU. 2 is D
It is a main storage device such as a RAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information such as a family name. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. 6 is a VRAM (video RA
M). Reference numeral 7 denotes an erase candidate display section for displaying erase candidates. Reference numeral 8 denotes a user weight setting unit for setting a weight for each family user.

The above stored data is the same as that described in the first embodiment. FIG. 11 is a block diagram showing a system configuration of a data storage device according to the third embodiment of the present invention. In FIG. 11, reference numeral 41 denotes family information setting means for setting family information. Reference numeral 42 denotes a user-specific weight setting unit that sets a weight for each user. 43 is a family information setting means 41 for data transmitted through a public line.
Data addition means for adding the family information set by the user and the user-specific weight set by the user-specific weight setting means 42 and the erasure identifier area. Reference numeral 44 denotes a user identifier input unit for inputting a user identifier for identifying a family user. 45 is a user identifier input means 4
This is an erasing mark adding means for adding an erasing mark corresponding to the user identifier input by the user. Reference numeral 46 denotes data storage means for storing data and family information input through a public line, an erasure mark, and a weight for each user. Numeral 47 denotes an erase mark weight calculation means for calculating the weight of the erase mark for each of the stored data and obtaining the sum of the weights. Numeral 48 denotes an erasure candidate display means for displaying erasure candidates in order from a plurality of pieces of data stored in the data storage means 46 having a larger sum of the weights of the erasure marks. 49 is a data erasing means for erasing the data stored in the data storing means 46.

FIG. 12 is a flowchart showing a data addition algorithm in the data storage device.
3 is a flowchart showing the data deletion algorithm. In the data addition algorithm, first, it is determined whether or not the family information and the user weight are set (step E1). If the family information and the user weight are not set yet, the family information and the user weight are set (step E1). E
2) When the family information and the user weight are set, an erasure identifier area is created (step E3), and then the family information, the user weight, and the erasure identifier area are added to the data to be stored (step E4). ). Subsequently, it is determined whether or not the remaining storage area in the storage area for data storage is smaller than the set amount (step E5). If the remaining storage area is smaller than the set amount based on the determination result in step E5, the erasure mark is determined. A weight calculation is performed (step E6), erasure candidates are displayed in descending order of the sum of the erasure mark weights (step E7), the data erasure is urged, and the process is terminated. , And the process ends. The data to which the family information and the erasure identifier area are added are stored thereafter.

On the other hand, in the data deletion algorithm, first, the stored data is browsed (step F1), and then a user identifier is input (step F2). As a result, an erasure mark is added to the area corresponding to the user identifier (step F3). Then, it is determined whether or not the erasure mark of all the family members has been set (step F4).
When the deletion mark of all the family members is put on the basis of the determination result of step 4, it means that all the family members have browsed and have given permission to delete them. Therefore, the accumulated data is deleted (step F5), and the processing is ended. If there is no erasure mark for all members, the process ends without erasing the corresponding data.

According to this embodiment, an erasure mark having a different weight is added to a location corresponding to the user identifier in the erasure identifier area, and the remaining storage area of the storage area for storing data is smaller than the set amount. When it becomes, the data with the highest sum of the erasure marks is displayed as erasure candidates in order, so that the inconvenience that occurs when each family member arbitrarily uses the stored data shared by the whole family can be eliminated. In particular, it is possible to prevent new data from being unable to be stored due to a shortage of a data storage area.

[Fourth Embodiment: Corresponding to Claim 4] This fourth embodiment has a storage identifier data area for the number of family members in data to be stored, and is used for storing data. In order to implement a data storage method, a save mark is added, and when a user attempts to delete data with a save mark of another user, a warning is issued with the name of the user. 1 shows a data storage device. Hereinafter, the configuration and operation will be described in detail.

FIG. 14 is a block diagram showing a hardware configuration of a data storage device according to the fourth embodiment of the present invention. In FIG. 14, reference numeral 1 denotes a CPU. 2 is D
It is a main storage device such as a RAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information such as a family name. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. 6 is a VRAM (video RA
M). Reference numeral 9 denotes an erasure warning display section for displaying an erasure warning.

The above stored data is the same as that described in the first embodiment. FIG. 15 is a block diagram showing a system configuration of a data storage device according to the fourth embodiment of the present invention. In FIG. 15, reference numeral 51 denotes family information setting means for setting family information. Reference numeral 52 denotes a data adding unit for adding the family information set by the family information setting unit 51 and the storage identifier area to the data transmitted through the public line. 53 is a user identifier input means for inputting a user identifier for identifying a family user. Reference numeral 54 denotes a storage mark adding unit that adds a storage mark corresponding to the user identifier input by the user identifier input unit 53. Reference numeral 55 denotes data storage means for storing data, family information, and a storage mark input through a public line. Reference numeral 56 denotes an erasure warning display unit that displays an erasure warning (such as the name of a family user) when a user attempts to erase data with a save mark of another user. 57 is a data erasing means for erasing the data stored in the data storing means 55.

FIG. 16 is a flowchart showing a data addition algorithm in the data storage device.
7 is a flowchart showing a data deletion / save algorithm. In the data addition algorithm, it is first determined whether or not family information is set (step G).
1) If family information has not been set yet, family information is set (step G2). If family information is set, a storage identifier area is created (step G3). Is added (step G4), and the processing ends. The data to which the family information and the storage identifier area are added are stored thereafter. On the other hand, in the data deletion / save algorithm, first, the stored data is browsed (step H1), and it is determined whether to delete the data (step H2). If the data is to be deleted based on the determination result in step H2, it is determined whether or not a save mark of another user has been added (step H3). If the save mark has not been added based on the determination result in step H3, the data is deleted (step H4), and the process ends. If the save mark has been added, a warning display (the name of the user who added the save mark is displayed). (Step H5). If the data is not to be deleted based on the determination result of step H2, it is determined whether or not the data is to be further stored (step H6). If the data is to be stored based on the determination result of step H6, the user identifier is to be stored. Is input (step H7). As a result, a save mark is added to the area corresponding to the user identifier (step H8), and the process ends. If the data is not stored, the process ends.

According to this embodiment, when data is deleted, if the storage mark of another user of the family is added to the storage identifier area, the other user's name is displayed and a warning is issued. It is possible to eliminate the inconvenience caused when each family user uses the stored data shared by the whole family voluntarily, especially when at least one of the family users needs to save the stored data, The stored data can be protected.

[Fifth Embodiment: Corresponding to Claim 5] In the fifth embodiment, the data to be stored has alias data areas for the number of family members, and the data to be stored is stored in the user. This figure shows a data storage device for implementing a data storage method characterized by performing data management such as search by adding a different alias for each. Hereinafter, the configuration and operation will be described in detail.

FIG. 18 is a block diagram showing a hardware configuration of a data storage device according to the fifth embodiment of the present invention. In FIG. 18, reference numeral 1 denotes a CPU. 2 is D
It is a main storage device such as a RAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information such as a family name. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. 6 is a VRAM (video RA
M). An alias adding unit 10 adds an alias to the stored data. Reference numeral 11 denotes an alias search condition input unit for inputting a search condition for searching data to which an alias is added. Reference numeral 12 denotes a data display unit for displaying accumulated data.

The above stored data is the same as that described in the first embodiment. FIG. 19 is a block diagram showing a system configuration of a data storage device according to the fifth embodiment of the present invention. In FIG. 19, reference numeral 61 denotes family information setting means for setting family information. Reference numeral 62 denotes a family information storage unit that stores the family information set by the family information setting unit 61. Reference numeral 63 denotes a data adding unit for adding family information and an alias area by the family information storage unit 62 to the data transmitted through the public line. Reference numeral 64 denotes a user identifier input unit for inputting a user identifier for identifying a family user. An alias adding unit 65 adds an alias to the stored data for each user, that is, together with the input of the user identifier. Reference numeral 66 denotes data storage means for storing data, family information, and aliases of data input through a public line. 67 is a data storage means 6
6 is a data display means for displaying the data accumulated in 6.
Reference numeral 68 denotes an alias search unit that searches for an alias associated with the user identifier input by the user identifier input unit 64.

FIG. 20 is a flowchart showing a data addition algorithm in the data storage device.
1 is a flowchart showing the alias addition algorithm, and FIG. 22 is a flowchart showing the data search algorithm. In the data addition algorithm,
First, it is determined whether or not family information has been set (step I1). If family information has not been set, family information is set (step I2). When family information has been set, an alias area is created. (Step I3) Then, the family information and the alias area are added to the data to be accumulated thereafter (Step I4), and the processing is ended. The data to which the family information and the alias area are added are stored thereafter.

In the alias addition algorithm, first, the stored data is browsed (step J1), a user identifier is input (step J2), and an arbitrary alias is added to the browsed data. (Step J
3) End. In the data search algorithm, first, a user identifier is input (step K1), an alias of data to be searched is input (step K2), and data is searched by an alias (step K3). The displayed data is displayed (step K4), and the processing ends.

According to this embodiment, a unique user identifier of a family user is input, an alias is added to the alias area corresponding to the user identifier, and the alias added for each family user is added. Since data management such as search is performed based on this information, it is possible to eliminate the inconvenience that occurs when each family user uses the stored data shared by the whole family arbitrarily. Management can be performed easily.

[Sixth Embodiment: Corresponding to Claim 6] In the sixth embodiment, the data to be stored has a related data area for the number of family members, 1 shows a data storage device for implementing a data storage method characterized by adding different related data every time. Hereinafter, the configuration and operation will be described in detail.

FIG. 23 is a block diagram showing a hardware configuration of a data storage device according to the sixth embodiment of the present invention. In FIG. 23, 1 is a CPU. 2 is D
It is a main storage device such as a RAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information such as a family name. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. 6 is a VRAM (video RA
M). Reference numeral 12 denotes a data display unit for displaying accumulated data. Reference numeral 13 denotes a related data adding unit for adding related data to accumulated data.

The above stored data is the same as that described in the first embodiment. FIG. 24 is a block diagram showing a system configuration of a data storage device according to the sixth embodiment of the present invention. In FIG. 24, reference numeral 71 denotes family information setting means for setting family information. Reference numeral 72 denotes a data adding unit for adding data transmitted through the public line and the family information set by the family information setting unit 71 and a related data area. Reference numeral 73 denotes a user identifier input unit for inputting a user identifier for specifying a family user. 74 is for each user with respect to the stored data,
That is, it is a related data adding unit that adds related data in accordance with the input of the user identifier. Reference numeral 75 denotes data storage means for storing data and family information input through a public line. Reference numeral 76 denotes a data related information storage unit that stores the related data added by the related data adding unit 74. Reference numeral 77 denotes data display means for displaying the data stored in the data storage means 75 and the related data stored in the data-related information storage means 76.

FIG. 25 is a flowchart showing a data addition algorithm in the data storage device.
6 is a flowchart showing the related data addition algorithm. In the data addition algorithm, first, it is determined whether family information is set (step L).
1) If family information has not been set yet, family information is set (step L2). If family information is set, a related data area is created (step L3). And the related data area is added (step L4), and the processing ends. The data in which the family information and the related data area are added are stored thereafter.

On the other hand, in the related data addition algorithm,
First, the stored data is browsed (Step M1), and it is determined whether or not related data is added to the displayed data (Step M2). When the related data is added based on the determination result of Step M2, the user An identifier is input (step M3), and related data is added to the browsed data (step M4), and the process ends. If the related data is not to be added based on the determination result of step M2, the process ends.

According to this embodiment, a user identifier unique to a family user is input and related data is added to a related data area corresponding to the user identifier. It is possible to eliminate the inconvenience that occurs when each member of the family member uses the data arbitrarily, especially when adding any related data to the data accumulated by each member of the family user and reusing the data Convenience can be achieved.

[Seventh Embodiment: Corresponding to Claim 7] In the seventh embodiment, a member of a family having a typical family structure (adult, child, old man, etc.) in data to be stored. Family data (for example, in the case of text display, display with characters of normal size, display with characters larger than normal for people with low vision) , Or various data for displaying information that uses a lot of kana for children who are not familiar with kanji) are sent together from the sending side to the receiving side, and the receiving side takes correspondence with the assumed family structure of the sending side. FIG. 1 shows a data storage device for implementing a data storage method characterized in that data is displayed in an optimal form for each user by executing an operation according to the user.
Hereinafter, the configuration and operation will be described in detail.

FIG. 27 is a block diagram showing a hardware configuration of a data storage device according to the seventh embodiment of the present invention. In FIG. 27, reference numeral 1 denotes a CPU. 2 is D
It is a main storage device such as a RAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information such as a family name. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. 6 is a VRAM (video RA
M). Reference numeral 12 denotes a data display unit for displaying accumulated data. Reference numeral 14 denotes a data receiving unit that receives data transmitted from a transmitting side through a public line.

The above stored data is the same as that described in the first embodiment. FIG. 28 is a block diagram showing a system configuration of a data transmission device and a data storage device according to the seventh embodiment of the present invention. In FIG. 28, reference numeral 81 denotes family data integration means for integrating different family data for each family member having a representative family structure in the data transmission device. Reference numeral 82 denotes a data transmission unit for transmitting data integrated by the family data integration unit 81 to the public line 83 in the data transmission device.

Reference numeral 84 denotes data receiving means for receiving data transmitted from the transmission side via the public line 83 in the data storage device. Reference numeral 85 denotes family information setting means for setting family information. Reference numeral 86 denotes a family information storage unit that stores the family information set by the family information setting unit 85 in the data storage device. Reference numeral 87 denotes a family information storage means 86 for storing data sent through a public line in the data storage device.
Is data addition means for adding family information according to. Reference numeral 88 denotes a user identifier input unit for inputting a user identifier for identifying a family user in the data storage device. Reference numeral 89 denotes data storage means for storing data and family information input through a public line in the data storage device. Numeral 90 denotes data display means for displaying data stored in the data storage means 89 in the data storage device.

FIG. 29 is a flowchart showing a data addition algorithm in the data storage device.
0 is a flowchart showing the data display algorithm. In the data addition algorithm, first, family data is integrated on the transmission side (step N1), and then data is transmitted (step N2). On the other hand, on the receiving side,
Data transmitted from the transmitting side through the public line is received (step N3), and it is determined whether family information is set (step N4). If family information is not set yet, family information is set (step N4). Step N5),
When the family information is set, the family information is added to the data to be stored (step N6), and the process ends. The data to which the family information is added is stored thereafter.

On the other hand, in the data display algorithm, first, a user identifier is input (step O1), and a display operation (display operation corresponding to the user identifier) is determined according to the input user identifier (step O2). The data specified by the user is displayed (step O3), and the process ends. According to this embodiment, any one of the family data is selected and displayed by executing an operation according to the user of the family, so that the accumulated data shared by the whole family can be shared by the family users. It is possible to solve the inconvenience that occurs when using the system arbitrarily, and it is possible to provide optimal data especially for each family user.

[Eighth Embodiment: Corresponding to Claim 8] In the eighth embodiment, the data to be stored has a priority area corresponding to the number of family members, and the browsing priority of the user (for example, ,
1 shows a data storage device for implementing a data storage method characterized in that the order of browsing data is determined by setting a priority order of father, mother, and child.
Hereinafter, the configuration and operation will be described in detail.

FIG. 31 is a block diagram showing a hardware configuration of a data storage device according to the eighth embodiment of the present invention. In FIG. 31, reference numeral 1 denotes a CPU. 2 is D
It is a main storage device such as a RAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. Reference numeral 6 denotes a VRAM (video RAM). 1
Reference numeral 2 denotes a data display unit for displaying accumulated data. Reference numeral 15 denotes a priority setting unit for setting the priority of the user.

The above stored data is the same as that described in the first embodiment. FIG. 32 is a block diagram showing a system configuration of a data storage device according to the eighth embodiment of the present invention. In FIG. 32, reference numeral 91 denotes priority setting means for setting the priority of the user. Reference numeral 92 denotes a priority storage unit that stores the priority set by the priority setting unit 91. Reference numeral 93 denotes a data adding unit for adding the user's priority by the priority storing unit 92 to the data transmitted through the public line. Reference numeral 94 denotes a user identifier input unit for inputting a user identifier for identifying a family user. Reference numeral 95 denotes data storage means for storing data input through a public line and user priorities. 9
Reference numeral 6 denotes data display means for displaying data stored in the data storage means 95.

FIG. 33 is a flowchart showing a data addition algorithm in the data storage device.
4 is a flowchart showing the data display algorithm. In the data addition algorithm, first, it is determined whether or not the priority is set (step P1). If the priority is not set yet, the priority is set (step P2). The priority is added to the data to be provided (step P3), and the process ends. In addition,
The data with the added priority is stored thereafter.

On the other hand, in the data display algorithm, first, a user identifier is input (step Q1), and then it is determined whether or not a high-priority user has not browsed (step Q1).
2), based on the determination result in step Q2, if the data is not browsed, the data is not displayed (step Q3), and the process is terminated. The user who has read the information has already been read, that is, the read information corresponding to the user identifier is set (step Q5), and the process ends.

According to this embodiment, when the unique user identifier of the family user is input, the read priority of all the family members is referred to, and the browsing priority is higher than that of the family users. The data is displayed only when other users are not browsing, and when the data is displayed, the read information is set according to the family user, so the stored data shared by the whole family can be used by the family. The inconvenience that occurs when each user uses the data arbitrarily can be resolved, and in particular, it is possible for a family user to browse the stored data in a predetermined order.

[Ninth Embodiment: Corresponding to Claim 9] In the ninth embodiment, data to be stored has a priority area corresponding to the number of family members, and a data classification added to the data. A data storage method characterized in that the data browsing order is determined by setting the browsing priority of the user (for example, the priority order of father, mother and child) for each data classification using 1 shows a data storage device for performing the above. Hereinafter, the configuration and operation will be described in detail.

FIG. 35 is a block diagram showing a hardware configuration of a data storage device according to the ninth embodiment of the present invention. In FIG. 35, reference numeral 1 denotes a CPU. 2 is D
It is a main storage device such as a RAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. Reference numeral 6 denotes a VRAM (video RAM). 1
Reference numeral 2 denotes a data display unit for displaying accumulated data. Reference numeral 16 denotes a data classification priority setting unit for setting a user priority for each data classification.

The above stored data is the same as that described in the first embodiment. FIG. 36 is a block diagram showing a system configuration of a data transmission device and a data storage device according to the ninth embodiment of the present invention. In FIG. 36, reference numeral 101 denotes a data classification adding unit that adds a data classification to data to be transmitted by the data transmission device.
Reference numeral 102 denotes data transmission means for transmitting data to which data classification is added in the data transmission device to the public line 103.

Reference numeral 104 denotes data receiving means for receiving data transmitted through the public line 103 in the data storage device. Reference numeral 105 denotes priority setting means for setting the priority of a user for each data classification in the data storage device.
Reference numeral 106 denotes a priority storage unit that stores the priority set by the data classification-specific priority setting unit 105 in the data storage device. Reference numeral 107 denotes a data addition unit for adding the user's priority by the priority storage unit 106 to the data sent through the public line in the data storage device. Reference numeral 108 denotes a user identifier input unit for inputting a user identifier for identifying a family user in the data storage device. A data storage unit 109 stores data input through a public line and user priorities in the data storage device. Reference numeral 110 denotes data display means for displaying data stored in the data storage means 109 in the data storage device.

FIG. 37 is a flowchart showing a data addition algorithm in this data storage device.
8 is a flowchart showing the data display algorithm. In the data addition algorithm, first, a data classification is added to data on the transmission side (step R1),
Next, data is transmitted to the public line (step R2).

On the other hand, the receiving side receives the data sent through the public line (step R3), determines whether or not the received data has a priority (step R4), and the priority is still set. If not, the priority is set (step R5). When the priority is set, the priority is added to the data to be stored (step R6), and the process ends. The data with the added priority is stored thereafter.

On the other hand, in the data display algorithm, first, a user identifier is input (step S1), and then it is determined whether or not a high-priority user has not browsed (step S1).
2) If the data is not browsed based on the determination result in step S2, the data is not displayed (step S3) and the process is terminated. If the data is browsed, the data is displayed (step S4) and the input user identifier is displayed. That the user having read the information has already been read, that is, the read information corresponding to the user identifier is set (step S5), and the process ends.

According to this embodiment, when the unique user identifier of the family user is input, the read priority of all the family members is referred to, and the browsing priority is higher than that of the family users. The data is displayed only when other users are not browsing, and when the data is displayed, the read information is set according to the family user, so the stored data shared by the whole family can be used by the family. The inconvenience that occurs when each user uses the data arbitrarily can be resolved, and in particular, it is possible for a family user to browse the stored data in a predetermined order.

[Tenth Embodiment: Corresponding to Claim 10] In the tenth embodiment, data to be stored has a priority area corresponding to the number of family members, and a storage mark is added to the data. However, it shows a data storage device for implementing a data storage method characterized in that data can be deleted when the user has a higher deletion priority than the user to which the storage mark is added. Hereinafter, the configuration and operation will be described in detail.

FIG. 39 is a block diagram showing a hardware configuration of a data storage device according to the tenth embodiment of the present invention. In FIG. 39, reference numeral 1 denotes a CPU. Reference numeral 2 denotes a main storage device such as a DRAM. Reference numeral 3 denotes an external storage device such as a hard disk drive. Reference numeral 4 denotes a family information setting unit for setting family information. Reference numeral 5 denotes a user identifier input unit for inputting a user identifier corresponding to a member of the family. Reference numeral 6 denotes a VRAM (video RAM).
Reference numeral 12 denotes a data display unit for displaying accumulated data. Reference numeral 17 denotes an erase priority setting unit for setting an erase priority. Reference numeral 18 denotes a storage mark adding unit for adding a storage mark to data.

The above stored data is the same as that described in the first embodiment. FIG. 40 shows a tenth embodiment of the present invention.
FIG. 3 is a block diagram showing a system configuration of a data storage device according to the embodiment. In FIG. 40, reference numeral 111 denotes family information setting means for setting family information. A family information storage unit 112 stores the family information set by the family information setting unit 111. Reference numeral 113 denotes an erase priority setting unit that sets a user's erase priority. Reference numeral 114 denotes an erase priority storage unit that stores the erase priority set by the erase priority setting unit 113. Reference numeral 115 denotes data addition means for adding the family information by the family information storage means 112, the deletion priority by the deletion priority storage means 114, and the storage identifier area to the data transmitted through the public line. Reference numeral 116 denotes a user identifier input unit for inputting a user identifier for identifying a family user. Reference numeral 117 denotes a storage mark adding unit that adds a storage mark to the stored data for each user, that is, in accordance with the input of the user identifier. Reference numeral 118 denotes data storage means for storing data, family information, erasure priority, and storage mark input through a public line. 119 is a data storage unit 118
Data display means for displaying the data stored in the memory. 1
Reference numeral 20 denotes data erasing means for erasing data stored in the data storage means 118.

FIG. 41 is a flowchart showing a data addition algorithm in the data storage device.
2 is a flowchart showing a data deletion / save algorithm. In the data addition algorithm, first, it is determined whether or not the family information and the deletion priority are set in the data (step T1). If the family information and the deletion priority are not set yet, the family information and the deletion priority are set. When the family information and the deletion priority are set (step T2), a storage identifier area is created (step T3), and the family information and the deletion priority are added to the data to be stored last (step T4), and the process ends. I do. In addition,
The data to which the family information and the deletion priority are added are accumulated thereafter.

On the other hand, in the data deletion / save algorithm, first, the data is browsed (step U1), then it is determined whether or not the browsed data is to be deleted (step U2), and the data is deleted based on the determination result of step U2. If so, it is further determined whether or not a save mark of another user has been added (step U3). If the storage mark is added based on the determination result of step U3, it is determined whether the user to which the storage mark is further added has a higher erasing priority (step U4).
If the erasure priority is high based on the determination result of step U4, a warning is displayed (step U5), and the process ends. If the erasure priority is not high based on the determination result in step U4, the data is erased (step U6), and the process is terminated. Similarly, the storage mark of another user is added based on the determination result in step U3. If not, the data is erased (step U6) and the process ends. Further, based on the determination result of step U2, if it is not data deletion, it is further determined whether or not data storage is to be performed (step U7). If the data is to be saved based on the determination result of step U7, a user identifier is input (step U8), a save mark is thereby added (step U9), and the process is terminated. If not, the process ends.

According to this embodiment, when data is deleted, the storage mark of another user of the family is added to the storage identifier area, and the family user who has added the storage mark Since the data is deleted as it is when the deletion priority is higher than other users, it is possible to eliminate the inconvenience that occurs when each member of the family arbitrarily uses the stored data shared by the whole family, In particular, even when at least one of the family users designates storage of the stored data, the stored data can be deleted by the user having the higher erasing priority.

[0093]

According to the data storage method of the first aspect of the present invention, it is possible to eliminate the inconvenience caused when each family user uses the stored data shared by all the family members arbitrarily. The stored data can be protected until all the family members sharing the stored data have used the stored data.

According to the data storage method of the second aspect of the present invention, it is possible to eliminate the inconvenience caused when each family member uses the stored data shared by the whole family arbitrarily. It is possible to prevent the new data from being unable to be stored due to the lack of the area. According to the data storage method of the third aspect of the present invention, it is possible to eliminate the inconvenience that occurs when each family user arbitrarily uses the stored data shared by the whole family, and in particular, the shortage of the data storage area. Therefore, it is possible to prevent the new data from being stored.

According to the data storage method of the fourth aspect of the invention, it is possible to eliminate the inconvenience that occurs when each user of the family uses the stored data shared by the whole family arbitrarily. When at least one of the users needs to store the stored data, the stored data can be protected. According to the data storage method of the fifth aspect of the present invention, it is possible to eliminate the inconvenience caused when each family user uses the stored data shared by the whole family arbitrarily. Data management can be easily performed in each case.

According to the data storage method of the invention described in claim 6, it is possible to eliminate the inconvenience caused when each user of the family uses the stored data shared by the whole family arbitrarily. It is possible to improve the convenience of adding any related data to the data accumulated by each user and using the data again. According to the data storage method of the invention described in claim 7, it is possible to eliminate the inconvenience caused when each family user uses the stored data shared by the whole family arbitrarily. Optimal data can be provided for each situation.

According to the data storage method of the invention described in claim 8, it is possible to eliminate the inconvenience that occurs when each user of the family uses the stored data shared by the whole family arbitrarily. The user can browse the stored data in a predetermined order. Claim 9
According to the data storage method of the described invention, it is possible to eliminate the inconvenience caused when each user of the family uses the stored data shared by the whole family arbitrarily. The stored data can be browsed in a predetermined order.

According to the data storage method of the tenth aspect of the present invention, it is possible to eliminate the inconvenience that occurs when each user of the family uses the stored data shared by the whole family arbitrarily. Even when at least one of the users specifies storage of the stored data, the stored data can be deleted by a user having a higher erasing priority.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a hardware configuration of a data storage device in a data storage method according to a first embodiment of the present invention.

FIG. 2 is a block diagram showing a system configuration of a data storage device in the data storage method according to the first embodiment of the present invention.

FIG. 3 is a flowchart showing a data addition algorithm in the data storage method according to the first embodiment of the present invention.

FIG. 4 is a flowchart showing a data deletion algorithm in the data storage method according to the first embodiment of the present invention.

FIG. 5 is a schematic diagram showing a format of accumulated data.

FIG. 6 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a second embodiment of the present invention.

FIG. 7 is a block diagram showing a system configuration of a data storage device in a data storage method according to a second embodiment of the present invention.

FIG. 8 is a flowchart showing a data addition algorithm in the data storage method according to the second embodiment of the present invention.

FIG. 9 is a flowchart showing a data deletion algorithm in the data storage method according to the second embodiment of the present invention.

FIG. 10 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a third embodiment of the present invention.

FIG. 11 is a block diagram showing a system configuration of a data storage device in a data storage method according to a third embodiment of the present invention.

FIG. 12 is a flowchart showing a data addition algorithm in a data storage method according to a third embodiment of the present invention.

FIG. 13 is a flowchart showing a data deletion algorithm in the data storage method according to the third embodiment of the present invention.

FIG. 14 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a fourth embodiment of the present invention.

FIG. 15 is a block diagram showing a system configuration of a data storage device in a data storage method according to a fourth embodiment of the present invention.

FIG. 16 is a flowchart illustrating a data addition algorithm in a data storage method according to a fourth embodiment of the present invention.

FIG. 17 is a flowchart showing a data deleting / saving algorithm in a data storage method according to a fourth embodiment of the present invention.

FIG. 18 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a fifth embodiment of the present invention.

FIG. 19 is a block diagram showing a system configuration of a data storage device in a data storage method according to a fifth embodiment of the present invention.

FIG. 20 is a flowchart showing a data addition algorithm in a data storage method according to a fifth embodiment of the present invention.

FIG. 21 is a flowchart showing an alias addition algorithm in the data storage method according to the fifth embodiment of the present invention.

FIG. 22 is a flowchart showing a data search algorithm in a data storage method according to a fifth embodiment of the present invention.

FIG. 23 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a sixth embodiment of the present invention.

FIG. 24 is a block diagram showing a system configuration of a data storage device in a data storage method according to a sixth embodiment of the present invention.

FIG. 25 is a flowchart showing a data addition algorithm in the data storage method according to the sixth embodiment of the present invention.

FIG. 26 is a flowchart showing a related data addition algorithm in the data storage method according to the sixth embodiment of the present invention.

FIG. 27 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a seventh embodiment of the present invention.

FIG. 28 is a block diagram showing a system configuration of a data storage device in a data storage method according to a seventh embodiment of the present invention.

FIG. 29 is a flowchart showing a data addition algorithm in a data storage method according to the seventh embodiment of the present invention.

FIG. 30 is a flowchart showing a data display algorithm in a data storage method according to the seventh embodiment of the present invention.

FIG. 31 is a block diagram showing a hardware configuration of a data storage device in a data storage method according to an eighth embodiment of the present invention.

FIG. 32 is a block diagram showing a system configuration of a data storage device in a data storage method according to an eighth embodiment of the present invention.

FIG. 33 is a flowchart showing a data addition algorithm in a data storage method according to an eighth embodiment of the present invention.

FIG. 34 is a flowchart showing a data display algorithm in a data storage method according to the eighth embodiment of the present invention.

FIG. 35 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a ninth embodiment of the present invention.

FIG. 36 is a block diagram showing a system configuration of a data storage device in a data storage method according to a ninth embodiment of the present invention.

FIG. 37 is a flowchart showing a data addition algorithm in the data storage method according to the ninth embodiment of the present invention.

FIG. 38 is a flowchart showing a data display algorithm in a data storage method according to the ninth embodiment of the present invention.

FIG. 39 is a block diagram illustrating a hardware configuration of a data storage device in a data storage method according to a tenth embodiment of the present invention.

FIG. 40 is a block diagram showing a system configuration of a data storage device in a data storage method according to a tenth embodiment of the present invention.

FIG. 41 is a flowchart showing a data addition algorithm in the data storage method according to the tenth embodiment of the present invention.

FIG. 42 is a flowchart showing a data deletion / save algorithm in the data storage method according to the tenth embodiment of the present invention.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 CPU 2 Main storage device 3 External storage device 4 Family information setting part 5 User identifier input part 6 VRAM 7 Erasure candidate display part 8 User weight setting part 9 Erasure warning display part 10 Alias addition part 11 Alias search condition input part 12 Data display unit 13 Related data adding unit 14 Data receiving unit 15 Priority setting unit 16 Priority setting unit for each data type 17 Erase priority setting unit 18 Save mark adding unit 21 Family information setting means 22 Data adding means 23 User identifier input Means 24 Erase mark adding means 25 Data storage means 26 Data erasing means 31 Family information setting means 32 Data adding means 33 User identifier input means 34 Erase mark adding means 35 Data storage means 36 Erase candidate display means 37 Data erasing means 41 Family information Setting means 42 Weight setting means for each user 43 Data addition Step 44 User identifier input means 45 Erasure mark addition means 46 Data storage means 47 Erasure mark weight calculation means 48 Erasure candidate display means 49 Data erasure means 51 Family information setting means 52 Data addition means 53 User identifier input means 54 Save mark addition Means 55 Data storage means 56 Erase warning display means 57 Data erasure means 61 Family information setting means 62 Family information storage means 63 Data addition means 64 User identifier input means 65 Alias addition means 66 Data storage means 67 Data display means 68 Alias search means 71 Family information setting means 72 Data addition means 73 User identifier input means 74 Related data addition means 75 Data storage means 76 Data related information storage means 77 Data display means 81 Family data integration means 82 Data transmission means 83 Public line 84 Data Data receiving means 85 Family information setting means 86 Family information storing means 87 Data storing means 88 User identifier input means 89 Data storing means 90 Data display means 91 Priority setting means 92 Priority storing means 93 Data adding means 94 User identifier Input means 95 Data storage means 96 Data display means 101 Data classification addition means 102 Data transmission means 103 Public line 104 Data reception means 105 Data classification priority setting means 106 Priority storage means 107 Data addition means 108 User identifier input means 109 Data storage means 110 data display means 111 family information setting means 112 family information storage means 113 erasure priority setting means 114 erasure priority storage means 115 data addition means 116 user identifier input means 117 storage mark addition means 11 Data storage means 119 data display unit 120 data erasing means

 ──────────────────────────────────────────────────の Continuing on the front page (72) Inventor Joh Imai 1006 Kadoma Kadoma, Osaka Pref. Matsushita Electric Industrial Co., Ltd.

Claims (10)

[Claims] 1. An erase identifier area corresponding to the number of family members is added to each of the data to accumulate the data, and a unique user identifier is input each time the user of the family browses the data. A method of adding an erasure mark to a position corresponding to the user identifier in the erasure identifier area, and erasing the data when the number of erasure marks is equal to the number of family members. 2. An erase identifier area corresponding to the number of family members is added to each of the data to accumulate the data, and a unique user identifier is input every time a user of the family browses the data. An erasure mark is added to a location corresponding to the user identifier in the erasure identifier area, and when the remaining storage area of the storage area for storing the data becomes smaller than a set amount, data is erased in order from the data with the larger erasure mark. A data storage method characterized by displaying as a candidate. 3. The data is stored by adding an erasure identifier area corresponding to the number of family members to each of the data, and a unique user identifier is input each time the user of the family browses the data. An erasure mark having a different weight for each user is added to a location corresponding to the user identifier in the erasure identifier area, and the erasure mark is displayed when the remaining storage area of the storage area for storing the data becomes smaller than a set amount. A data storage method characterized by displaying data as erasure candidates in order from the data having the largest sum of weights. 4. A storage identifier area corresponding to the number of family members is added to each of the data to accumulate the data, and when it is necessary to store the data, a unique user identifier of the family user is stored. A storage mark is added to a location corresponding to the user identifier in the storage identifier area by inputting, and a storage mark of another user of the family is added to the storage identifier area when deleting the data. And displaying a warning by displaying the name of the other user. 5. The method according to claim 5, wherein an alias area corresponding to the number of family members is added to each of the data to accumulate the data, and a unique user identifier of the user of the family is input to correspond to the user identifier. A data storage method, wherein an alias is added to the alias area, and data management such as retrieval is performed based on the alias added to each user of the family. 6. The data is stored by adding a related data area corresponding to the number of families to each of the data, and a unique user identifier of the user of the family is input to correspond to the user identifier. A related data area, wherein related data is added to the related data area. 7. The data is provided with an operation area for each family member having a representative family structure, and different family data for each family member is collectively transmitted from the transmission side to the reception side. The data is stored, and the reception side takes the correspondence between the family configuration on the reception side and the representative family configuration assumed on the transmission side, and performs an operation according to the user of the family, thereby obtaining the family data. And displaying the selected data. 8. A priority area corresponding to the number of family members is added to each of the data, the browsing priority of a family user is set in the priority area of the data, and the data is stored. When a unique user identifier of the user is input, the read information of all the users of the family is referred to, and another user having a higher viewing priority than the user of the family is not unread. A data storage method, wherein only the data is displayed, and when the data is displayed, read information is set corresponding to a user of the family. 9. A data classification is added to data and sent from the transmission side to the reception side. At the reception side, a priority area corresponding to the number of family members is added to each of the data, and the data is added to the priority area of the data. The browsing priority of the family user corresponding to the classification is set and the data is stored, and when the unique user identifier of the family user is input, the read status of all the family users is read. Referring to information, the data is displayed only when another user having a higher browsing priority than the family user is not viewed, and when the data is displayed, the data is displayed in correspondence with the family user. A data storage method characterized by setting read information. 10. A storage identifier area corresponding to the number of family members is added to each of the data, and an erasure priority area corresponding to the number of family members is added. The data is stored by setting a degree, and when it is necessary to store the data, a unique user identifier of the user of the family is input, and a location corresponding to the user identifier in the storage identifier area. When a storage mark is added to the storage identifier area and the storage mark of another user of the family is added to the storage identifier area when the data is deleted, and the user of the family applies the storage mark. When the deletion priority is higher than that of the other users of the family, the data is deleted as it is, and when the data is deleted, the storage mark of the other user of the family is added to the storage identifier area. In the case where the user of the family has a lower erasure priority than the other users of the family with the save mark, the name of the other user of the family is displayed and warned. Accumulation method.