JP3501968B2 - Database management device and recording medium on which the program is recorded - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a database management device capable of making the contents of data the same as that of the other party by communication, and in particular, a database management device capable of reducing the amount of data communicated or processed during synchronization processing, and The present invention relates to a recording medium on which the program is recorded.

[0002]

2. Description of the Related Art Conventionally, information processing devices have been widely spread, and in recent years, for example, high-performance information processing devices such as desktop personal computers and information processing devices having excellent portability such as personal digital assistants. It is not unusual for individuals to own multiple information processing devices. Here, when managing personal information such as a schedule or an address book by these plural information processing devices, it is required that the databases provided in any of the information processing devices have the same data. To be done. Therefore, for example, in the case of managing personal information between a personal computer and a portable information terminal, for example, a personal database is managed by a personal computer, and the data of the master database is transferred to a portable information processing device database (portable database). I copy and carry my personal information with me.

As described above, when the same data is managed by a plurality of database management devices, when the data is changed by a certain database management device, all the database management devices also need to update the databases. Here, if each database management device can always communicate,
If the updated database management device notifies another database management device of the data change, the data change can be immediately reflected. However, each database management device cannot always communicate, for example, when the database management device is a portable information terminal. In this case, when the data is changed, the data change cannot be reflected in the database of another database management device. Therefore,
In order to maintain the sameness of the databases, a process for making the contents of the database the same as that of the other party, that is, a synchronization process is required when each database management device becomes communicable.

Explaining in the above example, when data is changed in the portable information terminal, synchronization processing is performed when the portable information terminal is moved back to the home or office, and the portable database of the portable information terminal and the master on the personal computer. The data will be the same with the database.

Here, download / upload can be given as an example of the conventional synchronization processing. In particular,
When the data is changed on the personal computer, the contents of the master database are copied to the mobile information terminal (download). On the other hand, when the data is changed on the mobile information terminal, the contents of the mobile database are copied (uploaded) to the personal computer.

[0006] Another conventional example is synchronization processing using a union. In this synchronization processing, when the two database management devices can communicate with each other, the contents of both databases are compared, and a new set is created as a union set containing all the information added to each database. To be done. After that, the created database is stored in both database management devices.

For example, both databases initially contain data "A", and one database management device X
When the data of “B” is added in the above, and the data of “C” is added in the other database managing apparatus Y, the database managing apparatus X sends the content “A + B” held by itself to the database managing apparatus Y. To do. On the other hand, the database management device Y creates a union “A + B + C” of the received “A + B” and the content “A + C” held by itself,
Store as your own database. Further, the database management device Y determines that the contents of the database “A + B +
"C" is sent back to the database management device X. As a result, the database management device X sets the contents of its own database to the same “A + B + C” as the database management device Y.
Can be updated.

[0008]

However, in the conventional database management apparatus which performs the above-mentioned synchronization processing, the amount of data (communication amount) transmitted between both database management apparatuses and each database management in the synchronization processing. This causes a problem that the amount of data calculated by the device is extremely large.

Specifically, in downloading / uploading, all the contents of one database are transmitted to the other database management device regardless of the number of changed data. For example, in the case of a database having 1000 data, even if one data is changed, 10
00 data is transmitted. As a result, the amount of communication transmitted between both database management devices increases. At the same time, in the database management device on the receiving side, the contents of the database are replaced by the database on the transmitting side, so that the data change on the receiving side is lost.

Further, in the synchronous processing using the union, one database is transmitted to the other in order to create the union, and the created union is sent back as a new database. As described above, in the synchronization processing, all the contents of the database have to be reciprocated between the two database management devices, which further increases the communication amount during the synchronization processing.

In addition, when the data is deleted in only one side, the data remains in the other side database. Therefore, the new database contains the data again and the data is not deleted. As a result, the amount of memory required to store the database increases and the amount of communication during synchronization processing further increases.

In order to solve these problems, for example,
Japanese Patent Laid-Open No. 9-6693 describes, as another example of the synchronization process, a database management device in which update information indicating whether or not there is a change is added to all data included in the database. Specifically, each database management device stores, for each data included in the database, ID information for identifying the data and update information indicating no change / correction / addition / deletion. When the data is changed, the update information corresponding to the data is updated. Furthermore, at the time of synchronization processing, each database management device notifies the other party of ID information and update information of all data. On the other hand, the counterpart database management device searches the data corresponding to the data in its own database based on the received ID information and compares the update information of both. Furthermore, when only one is changed, the unchanged data is replaced with the changing data. If both have been changed, the other party's data is added to its own database, and its own data is added to the other party's database. As a result, when the data is not changed in any of the database management devices, the sending of the data can be omitted, and the communication amount at the time of synchronization processing can be reduced.

However, even with the above configuration, it is necessary to send and receive the ID information and the update information in the entire database. Furthermore, if the data is corrected by both parties, each must be added to the other party's database.
As a result, it is hard to say that the amount of communication during synchronization processing has been sufficiently reduced. In addition, when the data is corrected on both sides, the number of data contained in the database increases, so that the amount of memory required for storing the database increases, which may increase the communication amount during synchronization processing. There is.

The present invention has been made in view of the above problems, and an object of the present invention is to reduce the amount of memory required to store the presence or absence of changes, and to reduce the amount of data to be communicated and processed during synchronization processing. It is to realize a database management device that can be further reduced and a recording medium in which the program is recorded.

[0015]

In order to solve the above-mentioned problems, a database management apparatus according to the invention of claim 1
At least one database management device is provided to configure a database system including a plurality of database management devices and a synchronization processing unit that matches the contents of corresponding data between the databases stored in the database management devices that can communicate with each other. A database management device having two databases is characterized by taking the following means.

That is, as a shared range with the partner database, a subset setting means for setting a subset in its own database, and at least the data included in the subset at the end of the previous synchronization process are synchronized with the previous synchronization. Status information including update information indicating whether or not updated during an asynchronous period from a process to the next synchronous process and movement information indicating whether to move inside or outside the subset during the asynchronous period is stored. State information storing means and state information updating means for monitoring the respective data stored in the state information storing means for corresponding state information during the asynchronous period and updating the respective state information.

Since the state information indicates the state of each of the above-mentioned data during the asynchronous period, even if the same data is stored in its own database, the synchronization processing with the partner's data is different from each other. , Are stored as different status information. Here, normally, each database management device can determine the time point at which the synchronization process with the other database management device is performed regardless of the other database management devices. Therefore, in many cases, the status information of each data is provided for each partner. However, if the synchronization processing time is always the same, the status information of each data can be shared even if there are a plurality of parties.

According to the above configuration, the state information storage means is
The state information of the data existing in the subset at the time of the previous synchronization processing is stored. During the asynchronous period, the state information is retained even if the data no longer exists in the subset due to, for example, moving or deleting the data. Further, the status information updating means monitors the data corresponding to the status information and updates the status information as long as the status information is stored in the status information storage means.

Therefore, by referring to the state information at the time of the next synchronization processing, even if the data is moved inside or outside the subset, it is included in the subset both at the time of the previous synchronization processing and at the time of the next synchronization processing. It is possible to reliably identify data that exists and whose content has not been updated (changed) between the two points of time. Here, the data is the same as the data that has not been moved or updated within the shared range as seen from the database management apparatus of the other party, and updating of the other party's data by the data is unnecessary. As a result, by identifying the data, it is possible to reduce the amount of data to be communicated to the partner database management device, and to reduce the amount of data processed during the synchronization processing.

Further, by referring to the state information, it is possible to reliably identify the data that has moved inside and outside the subset in its own database. Therefore, unlike the case where the movement is not identified, the problem that the data is erroneously identified as another data and the number of data included in the database is increased does not occur. As a result, it is possible to prevent an undesired increase in the amount of data in the database, and reduce the amount of memory required to store the database and the amount of data that is communicated and processed in the next synchronization process.

In addition, the above-mentioned state information may be stored at least only for the data included in the subset at the end of the previous synchronization processing. The state information is composed of update information, movement information, etc., and can be represented by a data amount that is extremely smaller than the content of data, for example, about 2 to 3 bits. Therefore, the amount of memory for storing the state information and the amount of calculation for processing the state information can be kept at a sufficiently low level.

In the database system, if at least one database management device stores the status information, the amount of data sent from the database management device to the other party can be reduced, so that the above-mentioned respective effects can be obtained.

According to a second aspect of the present invention, there is provided the database management device according to the first aspect of the present invention, further comprising the synchronization processing means, wherein the synchronization processing means stores each data within its own shared range. , The association means for associating each data within the shared range of the other party with each other, and the status information stored in the own status information storage means for each associated data set, and received from the other party's database management device. It is characterized in that a determining means for determining whether or not it is necessary to transmit the content of the data based on the information is provided.

According to the above configuration, the determination means, at the time of the synchronization processing, determines the content of the data based on at least the status information stored in its own status information storage means and the information received from the partner database management device. Determine the need for transmission. With this, the determination means determines whether or not the content transmission is necessary at a time point before the content transmission of the data, based on the information having a smaller data amount than the content of the data itself such as the above-mentioned status information and the presence / absence of update. it can. As a result, during synchronization processing,
The amount of data transmitted between each database management device and the amount of data processed by each can be reduced.

Further, in the database management apparatus according to the third aspect of the present invention, in the configuration of the second aspect of the present invention, the determination means moves to the subset for each data set associated with each other. , If the state information indicating that it currently exists in the subset is stored in at least one database management device, and the state information of its own indicates in the subset, and from the other database management device, If it is notified that the data that makes up the data set is within the shared range, the status information corresponding to the data set is set in the subset, and if it is the rest, it is set outside the subset. The inside / outside determination synchronization means is provided.

According to the above construction, the inside / outside determination synchronizing means responds at the time of synchronization processing based on at least the state information stored in its own state information storage means and the other party's state information or the presence / absence of update. It is determined whether the data set exists within the shared range, and the status information corresponding to the data set, such as its own status information and the status information of the other party if it exists, is in the subset or a subset. Set it outside.
Thereby, the synchronization processing means can determine whether or not each data exists within the shared range based on the above-mentioned state information and information with a small data amount such as the presence or absence of update. As a result,
At the time of synchronization processing, the amount of data transmitted between the database management devices and the amount of data processed by each can be reduced.

Further, the result of determination as to whether or not it is within the subset is stored for each data set as state information and the like. Also,
The amount of data transmitted during the determination is extremely small compared to the content of the data itself, and the determination of each data set is completed in an extremely short time. Therefore, even if the synchronization process is interrupted by the time the determination of all the data sets is completed due to, for example, disconnection of communication, the determination results up to that point are saved. Furthermore, even if it is judged again based on the status information after judgment, the judgment result does not change, so
The inside / outside determination synchronization means can restart the synchronization processing without any trouble regardless of whether the synchronization processing is interrupted. In this way, since the independence of each judgment is high, it is possible to ensure the consistency between the databases even in a database system in which the synchronization process may be interrupted, as in the case where the synchronization process is performed by communication. Can be kept.

On the other hand, in the database management apparatus according to a fourth aspect of the present invention, in the configuration of the second or third aspect of the invention, the determining means shares at least at least one of the data sets corresponding to each other after the synchronization processing. For each data set existing in the range, if the status information corresponding to the data set indicates an update, and if the other database management device notifies the update of the data that constitutes the data set. A priority side determination means for determining which data of the data set has priority,
When the prioritized side determination means determines the data to be prioritized, the data content synchronization means for replacing the content of the data on the non-priority side with the content of the prioritized data is provided.

According to the above configuration, in the synchronization processing, the priority side determination means determines at least the status information stored in the status information storage means of itself and the status information of the other party or the presence / absence of update of the data set. Based on this, it is determined whether the priority side needs to be determined, and the priority side is determined. Therefore, it is possible to determine the necessity of the priority side determination with an extremely small amount of data. Further, when the priority side can be determined, the data content synchronization means replaces the content of the non-priority side data with the content of the priority side data. Therefore, even if the corresponding data is updated in each database management device (when the data collide), if the priority side can be determined, the increase in the data contained in the database can be suppressed. Further, since the determination is made for each data set, the amount of data can be significantly reduced as compared with the case of communicating all the data in the database. Furthermore, replacement of data only requires sending the data from one database management device,
Two-way communication becomes unnecessary. As a result, it is possible to reduce the amount of data to be communicated or processed during the synchronization processing.

Here, since the data content has a relatively large amount of data as compared with the above-mentioned status information, if the synchronization process is interrupted during the transfer, the data content on the non-priority side may be lost. is there. However, even in this case, the data content on the priority side and the information referred to by the priority determination unit, such as the state information, are held. Therefore,
If the data content of the priority side is retransmitted after the synchronization processing is restarted, the synchronization processing can be performed without any trouble. As a result, even in a database system in which the synchronization process may be interrupted, the consistency between the databases can be reliably maintained.

When the priority side determination means determines the priority side, if data other than status information such as data content is referred to, the amount of data to be communicated increases and the time required for the determination tends to increase. Is. In this case, if the priority side is determined only for the data sets existing within the shared range after the synchronization processing, the time required for the determination can be shortened compared to the case where the priority side is determined for all the data sets.

Further, in the database management apparatus according to a fifth aspect of the present invention, in the configuration of the third aspect of the invention, the determination means is within the shared range after the synchronization processing based on the setting by the inside / outside determination synchronization means. If the status information corresponding to the data set indicates an update for each of the data set, and
A priority side determination means for determining which data in the data set is to be prioritized when the update of the data forming the data set is notified from the partner database management device, and the priority side determination means When the means determines the data to be prioritized, a data content synchronization means for replacing the content of the data on the non-priority side with the content of the prioritized data is provided.

According to the above configuration, the priority side determination means can determine the priority side only for the data set existing within the shared range after the synchronization processing. Further, the priority side determination means identifies the data set based on the determination result of the inside / outside determination synchronization means. Therefore, the determination time can be shortened as compared with the case where the priority side is determined for all the corresponding data sets, or the case where it is determined whether or not it exists within the shared range separately from the determination by the inside / outside determination synchronization means.

On the other hand, in order to solve the above-mentioned problems, a database management apparatus according to a sixth aspect of the present invention corresponds to a plurality of database management apparatuses and a database stored in the database management apparatus which can communicate with each other. The database management apparatus is provided for constructing a database system having a synchronization processing means for matching the contents of data to be processed, and is characterized in that the following means are taken in a database management device having at least one database.

That is, at least the order of data included in its own shared range is stored, and in the previous synchronization processing, the order storage means for setting the order of each data to be the same as that of the other party, and the above order. , The processed order storing means for storing the processed order indicating the last order in the previous synchronization processing, and the order stored by the order storage means during the asynchronous period from the previous synchronization processing to the next synchronization processing. Among them, the above-mentioned corresponded rank and the order prior to the corresponding rank are maintained, and the data newly included in its own shared range during the non-synchronization period is set so as to come after the corresponding rank. An order management means for managing the order of the data is provided.

As in the case of the status information described in claim 1, even if the data is the same in its own database, it will be in a different order from each other if the points of time for synchronous processing with the data of the other party are different. Is memorized. Further, the order storage method may be any storage method that can specify the data of each rank, and for example, may be stored as the order in which the information indicating the data is stored, or the information indicating the order for each data. May be added. Further, information indicating data can be stored in a list.

According to the above arrangement, the order storage means of each database management device is arranged so that the order of the corresponding data will be the same when the synchronization processing is completed.
The order of each of the above data is stored. In addition, the order of the last data is stored in the corresponding order storage means.

On the other hand, in the asynchronous period, the order management means of each database management device may be in the case where the data corresponding to the order stored in the order management means does not exist in the shared range due to, for example, deletion or movement. However, if the rank of the data is the same as the corresponding rank or earlier, the order of the data is maintained. Also, the order of each data is managed such that the data newly included in the shared range due to new creation or movement is after the corresponding order. Thus, even during the asynchronous period, the order of corresponding data is kept the same among the order storage means of each database management device.

In the above configuration, each database management device stores the correspondence as the order of the data stored in itself. Therefore, unlike the case where the correspondence relationship is stored with the correspondence information indicating the corresponding data, each database management apparatus uses the storage method suitable for itself, regardless of the data storage method in the other database management apparatus. Can remember As a result, it is possible to reduce the amount of memory required to store the correspondence relationship and the amount of calculation during the synchronization processing, as compared with the case of storing the correspondence information.

In addition, at the time of synchronization processing, for example, information indicating a sequence or information indicating data (state information, etc.)
The correspondence relationship can be notified to the other party by the order of sending the. Therefore, the correspondence relationship can be specified without transmitting the correspondence information, and the amount of data to be transmitted or processed can be reduced as compared with the case of transmitting the correspondence information.

Further, a database management apparatus according to the invention of claim 7 is the configuration of the invention of claim 6, further comprising the synchronization processing means, wherein the synchronization processing means corresponds to a partner in which the database of the partner is stored. The synchronization processing means communicates with the database management device and performs synchronization processing, and the synchronization processing means stores data existing in the shared range of itself that has a rank stored in the order storage means after the corresponding rank. For the data adding means added to the partner's shared range and the data added to the partner's shared range, the rank stored in the own order storage means and the rank stored in the partner's order storage means match, In addition, at least one of the order storage means of itself and the other party is arranged so that the respective ranks come before the ranks of the data that are not yet associated.
It is characterized in that it is provided with an additional data associating means for updating one of the two and a corresponding rank updating means for updating the corresponding rank. Note that the number of data to be added to the other party in one processing may be one or all.

According to the above configuration, data newly added to the shared range during the asynchronous period due to, for example, new creation or movement into the shared range, is shared by other database management devices during the synchronous processing. Added to range. further,
The additional data associating means and the associated rank updating means control the order of the added data and the associated rank so as to be the same among the database management devices. As a result, data can be added without inconsistency in order or supported order.

Further, in the database management apparatus according to the invention of claim 8, in the configuration of the invention of claim 6 or 7, the data is not included in its own shared range in a rank after the above-mentioned corresponding rank. It is characterized in that a first order deleting means for deleting the order of from the order storing means is provided.

According to the above configuration, the order of data that is not included in the shared range after the corresponding order is deleted at an arbitrary time point, for example, during the asynchronous period or during the synchronous processing. Here, these orders are the data deleted after the new synchronization range is included in the shared range during the asynchronous period in which the other database management device cannot synchronize, that is, other database management. It corresponds to the data that is not reflected in the device. Therefore, by deleting the sequence, it is possible to reduce the amount of memory required to store the sequence, the amount of calculation at the time of managing the sequence, and the amount of data to be communicated or calculated at the next synchronization processing.

On the other hand, the database management apparatus according to the invention of claim 9 has the structure of the invention according to claim 6, 7 or 8 in the order stored in the order storage means during synchronization processing. It is characterized in that a second order deleting means for deleting the order corresponding to the data not included in any of the shared ranges of the other party from the respective order storing means is provided.

According to the above configuration, for example, the order of data that is not included in any of the shared ranges at the end of the synchronization processing, such as the order of data that has been deleted or moved out of the shared range, is as follows. It is deleted from each order storage means. This gives you the amount of memory needed to store the sequence,
It is possible to reduce the amount of calculation when managing the sequence and the amount of data that is communicated or calculated in the next synchronization processing.

Further, the database management apparatus according to the invention of claim 10 is, in the configuration of the invention of claim 6, 7, 8 or 9, at least for data included in its own shared range at the end of the previous synchronization processing. A state information storage means for storing state information including update information indicating whether or not the state information has been updated during the asynchronous period, and each data in which corresponding state information is stored in the state information storage means during the asynchronous period. And status information updating means for monitoring each status information and updating each status information, and the order storage means stores each order as an order of storing status information corresponding to each data. Is characterized by. It should be noted that the state information may or may not include movement information as long as it includes update information.

In the above configuration, each order is stored as the order of storing the state information. Therefore, as compared with the case where the order and the state information are stored separately, the amount of memory required for the storage can be reduced and the order of transmitting the state information during the synchronization processing can be easily determined.

Further, a database management apparatus according to the invention of claim 11 is the structure of the invention of claim 10, wherein
As a shared range shared with the other party's database, it is provided with a subset setting means for setting a subset in its own database, and in the above status information, the corresponding data moved inside and outside the above described subset during the asynchronous period. It is characterized by including movement information indicating whether or not.

Therefore, as in the tenth aspect, it is possible to reduce the amount of memory required for storage, and it is not only easy to determine the order of transmitting the state information at the time of the synchronization processing, but also in the same way as the first aspect, only the movement is performed. It is possible to identify the performed data and reduce the amount of data that is communicated or processed during the synchronization processing.

Further, a database management apparatus according to the invention of claim 12 is the configuration of the invention according to claim 10 or 11, comprising the synchronization processing means, wherein the synchronization processing means stores the database of the other party. It is characterized in that the synchronization processing means communicates with a counterpart database management device to perform synchronization processing, and the synchronization processing means transmits status information of corresponding data in an order according to the order stored in the order storage means.

In the above configuration, during the synchronization processing, the state information is transmitted in the order according to the order stored in the order storage means. As a result, at the time of the synchronization processing, the correspondence relationship can be transmitted only by transmitting the status information, and the amount of data transmitted or processed between the database management devices can be reduced.

By the way, in each of the above database systems, the synchronization processing means operates when each of the database management devices becomes communicable. Therefore, if at least one database management device has the synchronization processing means, not all database management devices need to have the synchronization processing means. Further, the database management apparatus according to claim 1 having a state information storage means, etc., even if the other party does not have the state information storage means,
It is possible to reduce the amount of data that is communicated or processed during the synchronization processing. Therefore, even if the database management device communicating with claim 1 is provided with the synchronization processing means according to claim 2, the effect is sufficiently exerted.

Specifically, a database management apparatus according to the invention of claim 13 is between a communication means for communicating with the database management apparatus according to claim 1 and a database stored in the database management apparatus and its own database. In order to solve the above-mentioned problems, a database management device having a synchronization processing unit that matches the contents of corresponding data, wherein the synchronization processing unit includes each data within its own shared range and the partner. The associating means for associating each data within the shared range with each other, the status information stored in the status information storage means of the other party, and the information received from the other party's database management device for each of the associated data sets. On the basis of this, there is provided a determining means for determining whether or not the content transmission of the data is necessary.

When the counterpart database management apparatus has the configuration of claim 1, the synchronization processing means of the above configuration performs the synchronization processing by referring to the status information of the database management apparatus. Therefore, similarly to the second aspect, it is possible to reduce the amount of data transmitted between the database management devices and the amount of data processed by each in the synchronization process.

By the way, according to the configuration of the invention described in claim 1, by monitoring the movement and update of the data and updating the status information of the data, the data which need not be transmitted in the next synchronization processing is transmitted. That is, the data that has not been updated is identified only by moving in and out of the subset. However, if it is attempted to omit the content transmission for all of these data, each database management device determines that each user decides that the data is unnecessary, and even if the data is ejected out of the subset or deleted, It is necessary to continue holding the contents of these data during the asynchronous period, which may increase the amount of memory required to be installed in each database management device. In addition, if each database management device carelessly deletes the contents of these data, as a result of the next synchronization processing, the data is arranged in the subset, and
If it is determined that the content transmission is unnecessary, the consistency of the data between the databases will be lost.

On the other hand, according to the database management apparatus of the fourteenth aspect of the present invention, in the configuration of the first aspect of the invention, the data and the status information about the data arranged outside the subset during the asynchronous period. Corresponding data information storage means for storing whether or not and, among the data arranged outside the subset during the asynchronous period, the data and the status information which are determined to be unnecessary by the respective database management device. And a data deleting means for deleting the contents of the data not associated with the status information. .

The presence / absence of correspondence may be a part of the state information, or may be provided separately. Further, if the presence or absence of the association can be determined, for example, only the combination of the associated data and the state information, or only the combination without the association may be stored.
On the other hand, the association canceling unit may cancel the association according to the user's instruction, or depending on the amount of free memory,
The association may be canceled spontaneously. Whether or not it is unnecessary can be determined by an instruction from the user of each database management device, the access frequency to the data, or the like.

According to the above configuration, the corresponding data information storage means stores data that is not judged to be very important by each database management device, that is, data that is not included in the subset and status information. It is stored whether or not there is any, and when the content of the data is deleted, the association between the data and the state information is canceled.

As a result, even when each database management device deletes unnecessary data contents to reduce the required memory amount during the asynchronous period, the correspondence information storage means is referred to in the synchronization process. For example, the database management device having the association information storage means can reliably identify the data whose contents are deleted during the asynchronous period.

As a result, for example, appropriate measures can be taken, such as transmitting the contents of the data at the time of synchronization processing. When the data content is not deleted, the data transmission amount at the time of synchronization processing can be reduced as in the first aspect. Therefore, it is possible to reduce the data transmission amount in the synchronous processing without compromising the consistency between the databases and with a relatively small memory amount.

Since it is possible to determine whether or not each database management device needs data, the association canceling means cannot communicate with other database management devices at any time during the asynchronous period. Even during the period, the association can be resolved without any trouble. However, if the data content and the association are stored, the content transmission can be omitted when it is determined that the content transmission of the data is unnecessary by exchanging the state information during the synchronization processing. Therefore, in order to suppress the data transfer amount in the synchronization processing, it is desired to eliminate the association between the data content and the association as late as possible. On the other hand, if the content of data is kept held, the amount of free memory decreases, which may hinder the updating or addition of data. On the contrary, if the data contents are deleted at an early stage, the amount of free memory can be increased, but the amount of data transfer at the time of synchronization processing will increase.

On the other hand, in the database management apparatus according to the fifteenth aspect of the present invention, in the configuration of the invention according to the fourteenth aspect, the association canceling means preliminarily sets the free memory amount of the database management apparatus including itself in advance. It is characterized in that the above-mentioned association is canceled when the threshold value becomes equal to or lower than a predetermined threshold value. The threshold value may be a free memory amount as long as it can be compared with the free memory amount, or may be set as a ratio of the free memory amount to the installed memory amount.

According to the above configuration, when the free memory amount of the database management device decreases and becomes less than or equal to the threshold value, the association canceling means cancels the association and the data deleting means determines the association. Delete the contents of the resolved data. As a result, the required free memory amount can be secured without unnecessarily increasing the data transfer amount during the synchronization processing.

According to the database management apparatus of the sixteenth aspect of the invention, in the configuration of the invention of the fourteenth aspect or the fifteenth aspect, the associating means eliminates the unnecessary data at the next synchronization processing. It is characterized in that the possibility of transferring the data contents from the other party's database management device is estimated and compared, and the above-mentioned association is canceled in order from the data with the lowest possibility. Note that the transfer possibility of the data content may be determined from the history of the synchronization processing so far, for example, and it is estimated that the transfer possibility is higher when the data is ejected than when it is deleted. It may be estimated based on the operation by the user of his / her own database management device.

According to the above configuration, the content of the data is retained while the content of the data is highly likely to be transferred from the database management apparatus of the synchronization processing partner during the synchronization processing. The association can be canceled at this point.
As a result, it is possible to efficiently reduce the data transfer amount during the synchronization processing.

Furthermore, the database management apparatus according to the invention of claim 17 is the configuration of the invention of claim 3, further comprising a correspondence data information storage means, a correspondence elimination means and a data deletion means similar to those of claim 14. , The synchronization processing means, if the correspondence between the status information set in the subset by the inside / outside determination synchronization means and the data is not stored in the corresponding data information storage means, from the counterpart database management device, It is characterized by receiving the contents of data corresponding to the data.

According to the above configuration, when performing the synchronization processing, the synchronization processing means refers to the corresponding data information storage means, and when data having no correspondence between the state information and the data is arranged in the subset, The contents of the data are replaced with the contents of the data received from the other database management device. As a result, even if the content of data is deleted by a certain database management device, the consistency between the databases can be restored by the synchronization processing.

By the way, the data deleting means described in claims 14 to 16 deletes the contents of the data during the asynchronous period in order to reduce the amount of memory required for storing the database, but at the end of the synchronous processing. Even if the contents of data are deleted, the amount of memory can be similarly reduced .

[0070] and in time, such as a database management apparatus according to claim 5, wherein, when processing synchronize a set of corresponding data between the database, based on the movement information, whether disposed within the subset And the priority side of the data content is determined based on the update information, the database management apparatus prioritized in determining the data arrangement may be different from the database management apparatus prioritized in determining the content. is there. Therefore, if the user misunderstands that the priority side is the same in both the arrangement and the content of the data, the user may be confused.

On the other hand, in the database management apparatus according to the eighteenth aspect of the present invention, in the configuration of the second aspect of the invention, the determination means has its own status information for each set of associated data. Based on the status information stored in the storage means and the information received from the other party database management device, when it is determined that the data sets are within their respective shared ranges, the status information corresponding to the data sets Regardless of the update information, within-range priority means is provided for giving priority to the content of data existing in the shared range in the relevant data set over the content of data not existing in the shared range. It is characterized by being.

According to the above arrangement, the contents of data existing within the shared range are prioritized during the synchronization processing. As a result, the side prioritized in determining the arrangement of data and the side prioritized in determining the content of data can be matched. As a result, it is possible to realize a database management device that is unlikely to be misunderstood by the user.

Further, in the database management apparatus according to the invention of claim 19 , in the structure of the invention of claim 18 , the same inside / outside determination synchronizing means as in claim 3 is provided, and the inside / outside priority means is the inside / outside It is characterized in that the update information of the state information changed in the subset by the determination synchronization means is changed without update, and the update information of the state information not changed is changed with update.

According to the above arrangement, the within-range priority means updates the movement information as the movement information is updated by the inside / outside determination synchronizing means. Here, similarly to claim 3, when the inside / outside determination synchronization means and the within-range priority means update the state information, the amount of data transmitted between the database management devices is extremely small compared to the content of the data itself. , The determination result of each data set is stored as state information. Therefore, even if the synchronization process is interrupted by the inside / outside determination synchronization means and the within-range priority means until the status information of all data sets is updated due to communication disconnection or the like, there is no problem. , The synchronization process can be restarted. As a result, even in a database system in which the synchronization process may be interrupted as in the case of performing the synchronization process by communication, the consistency between the databases can be reliably maintained.

The database management apparatus according to the invention of claim 20 is, in the configuration of the invention of claim 18 or 19 , provided with priority selection means for selecting whether or not the in-range priority means operates. Is characterized by.

According to the above configuration, it is possible to select whether or not the in-range priority means operates, so that it is possible to make settings according to the user's preference, and it is possible to realize a database management device that is easier to use.

In order to solve the above-mentioned problems, a recording medium according to a twenty-first aspect of the present invention is a recording medium in which a program for managing the same contents of data corresponding to each other among a plurality of databases is recorded. , Claim 1
A program for operating a computer is recorded as the described subset setting means, status information storage means, and status information updating means.

When the program is executed by a computer, the database management device according to claim 1 is realized.
Therefore, similarly to the first aspect, it is possible to reduce the amount of data processed during the synchronization processing.

In order to solve the above-mentioned problems, a recording medium according to a twenty-second aspect of the present invention is a recording medium in which a program for managing the contents of data corresponding to each other among a plurality of databases is recorded in the same manner. A program for operating a computer is recorded as the order storage means, the corresponding order storage means, and the order management means according to claim 6.

When the program is executed by a computer, a database management device according to claim 6 is realized.
Therefore, as in the sixth aspect, it is possible to reduce the amount of memory required for storing the correspondence relationship and the amount of calculation at the time of synchronization processing, and to perform communication or processing at the time of synchronization processing, as compared with the case where the correspondence information is stored. The amount of data used can be reduced.

Further, in order to solve the above-mentioned problems, a recording medium according to a twenty- third aspect of the present invention is a recording medium in which a program for managing the contents of corresponding data among a plurality of databases is recorded in the same manner. Claim 13
A program for operating a computer is recorded as the synchronization processing unit including the associating unit and the determining unit described above, and the communication unit.

When the program is executed by a computer, the database management device according to claim 13 is realized. Therefore, as in the case of claim 13, when the partner database management device has the configuration of claim 1, the amount of data transmitted between the database management devices at the time of synchronization processing, and the processing by each The amount of data used can be reduced.

A database management device according to the present invention
In order to solve the above problems, multiple database
Management device and database management device that can communicate with each other
Of the corresponding data between databases stored in
A database system having a synchronization processing means for matching the contents.
At least one device provided to configure the stem.
In a database management device that has a database,
During the period process is completed, the corresponding data between the database
If the attachment is canceled, the content of the data is
A configuration that includes data deleting means for deleting from the database
May be

Correspondence is provided by the synchronization processing in the above configuration.
Data whose injuries have been eliminated is data that does not require consistency.
The data content is converted during the subsequent synchronization processing.
Not sent. Therefore, the data deletion means
By deleting the contents of the data from
Database without increasing data transfer amount
The amount of free memory in the management device can be expanded.

Furthermore, the database management system according to the present invention
Oki can communicate with multiple database management devices.
Database stored in the database management device
Synchronization process to match the contents of the corresponding data between
It is designed to configure a database system with
Data having at least one database
At the base management device, the database
If the data correspondence between the source and
Data deletion to delete the contents of the data from the database
Remover is provided, and the data deleter
Is equipped with a delete selection means for selecting whether or not to delete
It may be configured. In addition, between each database,
If there are multiple sets of associations,
They may be selected or set collectively.

According to the above configuration, for example, outside the subset,
If you want to reuse the distributed data, delete the data
Choose not to increase free memory over reuse.
If you want a large amount, choose to delete the data, etc.
Whether or not the data deletion means deletes the data
It is possible to make a setting according to the user's request.

The recording medium according to the present invention has the above-mentioned problems.
Multiple databases to solve each other
A program for managing the contents of data
In the recorded recording medium, a plurality of database management
Device and database management device that can communicate with each other
Corresponding data contents between databases stored in
Database system having synchronous processing means for matching
System to configure at least one
Database, and between the databases at the end of the synchronization process
If the correspondence of the data in the
Data deletion means to delete the contents of
Data deletion in the provided database management device
As a removal method, a program for operating a computer
The configuration may be such that the ram is recorded.

The above program is executed by a computer
Then, the above-mentioned database management device is realized. It
Therefore, in the same way as above, increase the amount of data transfer during synchronization processing.
Free database management device memory
The amount can be expanded.

[0089]

BEST MODE FOR CARRYING OUT THE INVENTION [First Embodiment] The following will describe one embodiment of the present invention with reference to FIGS. 1 to 61 and FIGS. 64 to 72. That is, the database system according to the present embodiment is limited to a plurality of data management devices that manage individual information and the like by a plurality of database management devices and have a limited period during which they can communicate with each other and can update data independently. It is a system suitably used when it is required to keep the contents of corresponding data identical between the databases. Although various system configurations are conceivable, the present embodiment will be described by taking a database system including database management devices, which are equal to each other, as in the case of a mobile information terminal, as an example.

Specifically, for example, as shown in FIG.
The database system 1 according to the present embodiment is an information processing device (database management device) that stores a database.
Each information processing device 2 includes a communication device (communication means) 3 for communicating with the information processing device 2 of the other party.
And a display device 4 and an input device 5 for processing input / output with the user are connected.

The communication device 3 is, for example, an interface such as a LAN interface or an RS232C interface, a modem, an infrared transmitter / receiver, or a wireless transmitter / receiver, and a cable or a public telephone according to an instruction from the information processing device 2. Via at least one of various communication media, such as a network, infrared or wireless,
The communication device 3 of the other party can communicate with each other. The display device 4 is a CRT display, a liquid crystal display, or the like, and displays various information such as the contents of the database of the information processing device 2 or the operation result on the database.
It can be displayed according to an instruction from the information processing device 2. Further, the input device 5 is a keyboard, a mouse, a pen, a touch panel arranged on the display device 4, or the like,
The user's instruction can be input to the information processing device 2.

On the other hand, as shown in FIG. 1, the information processing device 2 according to the present embodiment is connected to the communication device 3 and communicates with another information processing device 2 via the communication device 3. The user operation unit 2 which is connected to the display unit 4 and the input device 5 and serves as an interface with the user.
2, the database management unit 23 that stores the database DB, the database processing unit 24 that controls the database management unit 23, the communication unit 21 and the database management unit 23 according to instructions from the user operation unit 22, A synchronization unit 25 that performs processing related to synchronization with another database DB is provided. Each of the above-mentioned members may be realized by hardware, or may be a functional block realized by the CPU executing a predetermined program. In the latter case, each member can be realized only by distributing a recording medium in which the program is stored and executing the recording medium on a computer that can read the recording medium.
Distribution is easy. The database management unit 23
Corresponds to the database, the state information storage means, the order storage means, and the associated order storage means described in the claims, and the database processing unit 24 corresponds to the state information update means and the order management means.

In the present embodiment, as shown in FIG. 3, the database DB is managed in units of a tip T indicating one piece of data and a bag F which is a population of the tips. A tip management unit 31 and a bag management unit (subset setting means) 32 for storing a database are provided. Further, the database processing unit 24 includes a tip update processing unit 41, a tip addition processing unit 42, a tip deletion processing unit 43, etc. that respectively update / add / delete the tip T. The database processing unit 24 also includes members related to other operations of the database DB, such as searching and displaying the tip T or changing the inclusion relationship with the bag F. As a result, a tip T that satisfies a desired condition, such as a tip T having a predetermined content, is searched to generate the bag F, or a desired tip T is selected from the displayed tips T to select a desired tip T. It can be inserted into the F bag.

Further, the synchronizing section 25 includes a synchronizing processing section 51 for performing the synchronization processing of the tip T and a sharing setting processing section 52 for performing a sharing setting described later prior to the synchronization processing.
Further, for example, a sharing cancellation processing unit 53 that cancels the sharing setting when synchronization processing becomes unnecessary is provided. In addition, the synchronization processing unit 51 includes the synchronization processing unit, the association unit, the determination unit, the internal / external synchronization processing unit, the priority side determination unit, the data content synchronization unit, the data addition unit, and the additional data correspondence described in the claims. It corresponds to the means, the corresponded rank updating means, and the first and second order deleting means. Further, the configurations of the database processing unit 24 and the synchronization unit 25 are closely related to the data stored in the database management unit 23, and the operation based on the data has a great feature. Therefore, hereinafter, only the configuration of the database management unit 23 will be described, and the configurations of the database processing unit 24 and the synchronization unit 25 will be described in detail together with the operation.

Specifically, the tip management section 31 is
Data for one case is managed by a data structure called a tip. Each tip T is a tip I for uniquely identifying itself from other tips T in the database DB.
D and an attribute list LA in which data for one case is stored. In the attribute list LA, as shown in FIG. 4, the attribute name NA indicating the type of the attribute A and the tip T
The combination with the attribute value VA indicating the value of the attribute A in the data stored in is stored in a list.

For example, the case of storing the address book in the database DB will be described as an example.
It corresponds to one address data. If each address data is composed of three types of data, that is, data indicating a name, data indicating an address, and data indicating a telephone number, each tip T
Has _three attributes A _{1 to} A _{3 of} name, address and telephone number.
Attribute list LA of each tip T defined as a set of
As shown in FIG. 4, the combination of the attribute name NA and the attribute value VA is expressed as a list arranged in order. For example, in the attribute list LA of the first tip, a combination of an attribute name NA ₁ of “name” and an attribute value VA _{1 of} “○ yama × husband” is stored as the attribute A ₁ of the name. Similarly, a combination of "address" and "Tokyo city, Tokyo ...", and "phone number" and "0123 -..."
And a combination of are stored.

The bag management unit 32 stores the bag F included in the database DB and the inclusion relation between the tips T and the bag F. As shown in FIG. 5, one information processing device 2 has a plurality of database DBs.
_{The case where 1} , DB ₂ , and DB ₃ are stored will be described as an example. The relationship of the information processing device 2∋database DB∋float F∋tip T is established. The bag management unit 3
2 stores this relationship as a tree structure S as shown in FIG.

In the tree structure S, like the tip T ₂ , it may be contained in a single bag (F ₁ ),
Like the tip T ₁ , it may be included in a plurality of bags (F ₁ · F ₂ ). As a result, as shown in FIG.
The tip T ₁ included in the plurality of bags F ₁ and F ₂ can be expressed.

If the tree structure S can be stored,
The entire tree structure S may be stored, or the tree structure S may be divided into a plurality of lists and a list of database DBs included in the information processing device 2 and a list of bag F for each database DB may be stored. It may be stored as a list of tips T for each bag F. In the present embodiment, as in the case of the tip T, an ID for uniquely identifying each information processing device 2, each database DB, and each bag F is assigned, so that each list above
It is stored as a list of the ID. When stored as each of the above lists, the tip T included in a certain bag F is immediately found by referring to the list. On the contrary, the bag F including the tip T is the worst case. , I need to search all the lists. therefore,
When the search time is required to be shortened, the bag F including the tip T for each tip T, apart from the above-mentioned lists.
It is better to have a list of.

Database system 1 according to the present embodiment
Then, as shown in FIG. 7, the range (shared range) that is the target of the synchronization processing is determined in units of the F bags F, and whether or not a certain tip T is shared between other database DBs is shared in advance. Then the set bag (shared bag S
It is determined by whether or not it belongs to F).

Here, normally, access to the other information processing equipment 2 via the communication device 3 or the like is extremely slow as compared with access within the information processing equipment 2 of its own, and the time required for the synchronization processing increases. It tends to be. Therefore, there is a strong demand for shortening the required time, and it is desired to reduce the amount of data transmitted between the information processing devices 2a and 2b. Since the access to the information processing device 2 is relatively fast, even if the processing during the period between the previous synchronization processing and the next synchronization processing (during the asynchronous period) increases, the processing time is Not too long.

In order to reduce the amount of data, the bag management unit 32 according to this embodiment stores a dirty bit list LD consisting of dirty bits D indicating the state of each tip T during the asynchronous period. . Dirty
In the bit list LD, the order of the dirty bits D is managed so that the dirty bit D of the tip T corresponding to each other in the self and the opponent is the same.
As will be described later, the correspondence relationship between tips T is also shown. Further, the pocket management unit 32 stores a sync limit Lim indicating the number of tips T already associated with the previous synchronization process, and the tip T corresponding to the dirty bit D is shared by the partner. It can be determined whether or not it is already associated with the tip T in the SF.

For example, as shown in FIG. 8, in the previous synchronization processing, three tips (T _{1a to} T _3a and T _{1b to} T _3b ) are associated with each other between both shared bags SF _a and SF _b . In this case, “3” is stored as the sync limit Lim in both the information processing devices 2a and 2b. Furthermore, as shown in FIG. 9, the dirty bit list LD _a of the information processing apparatus 2a, the dirty bits D _1a to D _6a corresponding to the tip T _1a through T _6a is stored in this order . Similarly, the dirty bit of the information processing device 2b
In the list LD _b , dirty bits D _{1b to} D _3b , D _7b and D _8b corresponding to the respective tips T _{1b to} T _3b , T _7b and T _8b are stored in this order. In this case, since the sync limit Lim is “3”, the tips T _{4a to} T _6a in which the dirty bit D is stored after the third bit,
And, T _7b through T _8b are not associated with the tip T in the shared bag SF of the other party. Note that FIG. 9 shows an example of a method of storing the dirty bit list LD in which a combination of a dirty bit D and a tip ID corresponding to the dirty bit D is sequentially stored.

Hereinafter, for convenience of explanation, the order of the dirty bits D in the dirty bit list LD is referred to as a sync tag, and is represented as a number in [] in the figure. Also, Dirty Bit D and Tip T, etc.
Corresponding data are denoted with the same subscript, for example, dirty bit D _1a and tip T _1a . Further, the information stored in one of the information processing devices 2a is attached with _a subscript _a such as, for example, tip T _1a to be distinguished from the information stored in the other information processing device 2b (subscript _b is attached). . The subscripts are omitted when it is not necessary to specify the correspondence or when the names are collectively referred to.

The dirty bit D is created corresponding to each of the tips T existing in the shared bag SF even at least once during the asynchronous period, and whether or not the corresponding tip T is updated during the asynchronous period. It has an update parameter that indicates and a movement parameter that indicates whether the tip T has moved inside or outside the shared bag SF during the asynchronous period. The update parameter takes a value of "m" indicating update or "p" indicating maintenance, and the value of the movement parameter is "X" indicating stillness, "I" indicating insertion, or "I" indicating ejection. It is either "O". More specifically, "X" is
It has been shown that it has continued to exist in the shared bag SF since the last synchronization process, and "I" has been put in the shared bag SF since the last synchronization process or has been returned. . Similarly, “O” has been extracted from the shared bag SF since the previous synchronization processing, or
It shows that it was inserted once and then removed again. The movement parameter is stored, for example, as shown in FIG. 10, as a combination of an addition bit BI indicating addition to the shared bag SF and a deletion bit BO indicating deletion from the shared bag SF. Further, for example, when it is determined as a result of the synchronization processing that the tip T exists outside the shared bag SF, and thereafter, when it is unnecessary to monitor the state of the tip T, both bits BI and BO are set to ON. Hereinafter, this state is referred to as invalid "K" regardless of the value of the update parameter. Therefore, the states of the tip T which can be identified from the dirty bit D are the static maintenance "Xp", the static update "Xm", and the insertion maintenance "I".
There are seven: p ”, insert update“ Im ”, discharge maintenance“ Op ”, discharge update“ Om ”, and invalid“ K ”.

By the way, even if the same shared bag SF is used, if the partner shared bag SF is different, the asynchronous period with each is usually different from each other. Therefore,
In the present embodiment, the dirty bit list LD and the sync limit Lim are provided for each combination of the shared bag SF of itself and the shared bag SF of the other party.

For example, as shown in FIG. 11, the shared bag SF _a has three different shared bags SF _b , SF _c , S.
When it corresponds to F _d , as shown in FIG. 12, the corresponding dirty bit list LD _ab and LD _ac
・ LD _ad and sink limit Lim _ab・ Lim
_ac · Lim _ad is provided. As shown in FIGS. 11 and 12, each dirty bit list LD may be in the same order as the dirty bit list LD of the other party, and the dirty bit list (LD _ab
The order or value of the dirty bit D or the sync limit Lim may be different between LD _ac ). For example, in the dirty bit list LD _ab , the dirty bit D _2ab (whose value is Im) indicating the tip T _2a is stored second, but the dirty bit
In the bit list LD _ac , dirty bit D
_2ac (value is Xp) is stored first. However, dirty bit list LD of shared bag SF _{b
In b} , the dirty bit D _2b indicating the tip T2 _b is stored second, and the dirty bit list L
In D _c , the dirty bit D _2c is stored first.

The bag management unit 32 according to the present embodiment includes:
In addition to each of the above lists, a sharing partner list LS indicating a sharing partner of the sharing bag SF is provided for each sharing bag SF. By referring to this list LS, it is possible to easily search all the sharing partners of a certain shared bag SF, so that, for example, a change such as addition, deletion, or content update is made to the tip T in the shared bag SF. In this case, all the dirty bits D corresponding to the tip T can be updated in a shorter time.

The operation of the database system 1 having the above configuration will be described with reference to FIGS. 13 to 61. That is, as roughly shown in FIG. 13, the sharing setting is performed prior to the actual synchronization processing, and for example, the setting of the shared bag SF of itself and the other party, the dirty bit list LD, and the sync limit Lim are set. The processing required for the synchronization processing, such as the generation of (S1), is performed (S1). At this stage, as shown in FIG. 14, both sharing bags SF _a · SF _b
It is only registered in both the information processing devices 2a and 2b that the range is a shared range, and the contents of both shared bags do not match until the synchronization process is performed.

After that, the dirty bit list LD is updated during the asynchronous period, based on the operation to the database DB of itself, regardless of whether the both information processing devices 2a and 2b can communicate. (S2). Further, during a period in which both the information processing devices 2a and 2b can communicate, a synchronization process is performed, and as shown in FIG.
Aligned with reference to bit list LD and sync limit Lim, and dirty bit list L
D and sync limit Lim are also updated (S
3). When the communication path between the information processing devices 2a and 2b is intermittently connected, the shared bag whose consistency is maintained by the intentional synchronization process as in S3 is very useful.

Note that since the tip T can be put in a plurality of pockets F, if the synchronization processing related to any of the sharing settings is executed, the pockets F not related to the synchronization processing are executed.
Tip T belonging to may be changed. However, the tip T is not inserted into or removed from the bag F other than the shared bag SF regardless of which sharing setting is performed.

The processing of S2 and S3 described above is repeated as necessary, and when the subsequent synchronization processing becomes unnecessary, S
In 4, the sharing setting is canceled. Although FIG. 13 describes that step S2 is first performed after step S1, but if both steps S2 and S3 are alternately repeated, the order of both steps S2 and S3 may be exchanged. .

Here, the sharing cancellation basically only cancels the correspondence between the sharing bags SF, and the sharing bag S
The contents of F do not necessarily match each other. Therefore, when the contents of the shared bag SF are made to coincide with each other, the synchronization process may be performed immediately before the cancellation of sharing, or automatically according to a user's instruction.

Although the sharing setting and the synchronizing process are separately described above, the synchronizing process can be performed simultaneously with the sharing setting. In this case, for example, the contents of both shared bag SFs match at the end of sharing setting. However, in the present embodiment, the sharing setting and the synchronization process are separated to reduce the time required for the sharing setting. Accordingly, at the time of sharing setting, both information processing devices 2 confirm with each user whether sharing setting is possible, and at the time of synchronization processing, when only the user of one information processing device 2 operates, The total operation time by both users can be shortened. As a result,
Both improvement of safety and reduction of operation time can be realized.

In the following, as an example of the processing of the above S1,
The sharing setting of the bag fusion type model will be described in detail. As shown in FIG. 14, the sharing settings of the fusion type are as follows.
A balloon F _{a that is} present in advance in both information processing devices 2a and 2b
- a shared settings between F _b, as shown in FIG. 16, when both the information processing devices 2a, 2b is communicable, in S11, the shared setting processing unit 52 provided on one of the information processing apparatus 2a , And sends a sharing setting request to the other information processing device 2b. To the request includes a machine ID showing an information processing apparatus 2a, a bag ID showing the bag F _a of the information processing apparatus 2a, bag F of an information processing apparatus 2b to the desired share
_It includes a bag ID indicating _b . In the following, the side that sends the sharing setting request is referred to as the sharing setting activation side, and the side that receives the sharing setting request is referred to as the sharing setting passive side.

Further, the sharing setting processing unit 52 on the sharing setting starting side registers the same information as the sharing setting request as the sharing information in S12. Further, the sharing setting processing unit 52 causes the sharing partner list L corresponding to the own bag F _a.
Create S and register the opponent's bag ID. As a result, the bag F _a becomes the shared bag SF _a . In addition, a dirty bit list LD and a sync limit Lim corresponding to the combination of the shared bag SF _a and the partner bag F _b are created.

On the other hand, the information processing device 2b on the sharing setting passive side
Then, when the sharing setting processing unit 52 receives the sharing setting request in S13, the sharing information is registered based on the sharing setting request in S14. The shared information includes a machine ID indicating its own information processing device 2b, a bag ID to be shared by the information processing device 2a, a bag ID to be shared by the information processing device 2b, and determined at the time of sharing setting. Options are included. Furthermore, sharing setting processing unit 52, similarly to the sharing setting initiator, the shared contact list LS that corresponds to his bag F _b, and registers the bag ID of the other party, to generate a shared bag SF _b, itself The shared scrounger SF _b and the other's shared scrounger SF _a
Dirty bit list L corresponding to the combination with
Create D and Sync Limit Lim.

Database system 1 according to the present embodiment
Then, various types of information processing devices 2 may be used, for example, whether the priority side determination rule or the download process is necessary in the synchronization process of S3, the necessity of copying at the time of collision, the model adopted in the sharing cancellation of S4, or the like. Options (see below)
If the option is selectable, the option is set at the stage of sharing setting, and the sharing setting request also includes information indicating the option. Thereby, the setting time of each option can be limited to the sharing setting time.

Here, if each information processing device 2 can set an option at an arbitrary time, the priority side determination rule or the like is changed according to the operation on one of the information processing devices 2 and the other information processing device 2 is processed. There is a risk that the user of the device 2 may make undesired settings. However, in the above configuration, the option is changed only at the time of sharing setting at which each information processing device 2 can communicate, so that the above-mentioned undesired setting can be rejected.

Although the step of authenticating the sharing partner is not shown in FIG. 16, whether or not the sharing setting passive side makes the sharing setting according to the contents of the sharing setting request such as the sharing setting option. May be determined. In this case, the information processing device 2 on the sharing setting passive side may store, for example, a receivable sharing setting request in advance, and determine the necessity based on the stored sharing setting request.

The initial values of the dirty bit list LD and the sync limit Lim are as follows:
_It depends on the correspondence of the tip T included in a.SF _b . For example, when sharing settings, both sharing bags SF _a · S
When the tips T in F _b are determined to be different tips T, the initial value of the sync limit Lim becomes 0, and the dirty bit D corresponding to each tip T is set to the insertion update “Im”. It Further, for example, in the case of associating the tip T with reference to the content of the tip T, the sync limit Lim is the number of the tips T that have been successfully associated, and the dirty bit D corresponding to the tip T is It is stored so that the ranks in both dirty bit lists LD are the same. It should be noted that if the contents of both tips T are the same, the value of the dirty bit D becomes the still maintenance "Xp", and if it is not clear whether they are the same or not, it is set to the still update "Xm".

The model of sharing setting is not limited to the bag fusion type model, but one of the sharing bags S at the time of sharing setting like the bag taking-in model shown in FIG.
F may be newly created, or both information processing devices 2a and 2b may be created as in the new bag creation model shown in FIG.
Alternatively, a new shared bag SF may be created. In these cases as well, a process substantially similar to the process shown in FIG. 16 is performed, and the shared information, the dirty bit list LD and the sync limit Lim, the shared information, etc. are registered in each of them. However, a new sharing bag SF is added to the sharing setting passive side.
When a new item is created, the bag ID of the shared bag SF is returned to the sharing setting activation side when the shared information is registered.

Next, the process of S2 shown in FIG. 13, that is, the process during the asynchronous period will be described in detail. During the asynchronous period, the operation to the tip T, the dirty bit list LD and the sync limit L at the time of the operation are performed.
Based on im, the dirty bit D corresponding to tip T is updated as shown in FIG.

Specifically, when the content update of the tip T is instructed, the tip update processing section 41 (see FIG. 1) receives the instruction from the user operation section 22 in S21 shown in FIG. Accordingly, the content of tip T is updated. Further, in S22, the update parameter is set to "m" for the dirty bit D corresponding to the tip T. The movement parameter is kept as it is.

The tip T is a plurality of shared bag SFs.
, And each shared bag SF may be shared with a plurality of opponents. As a result, as a whole of the information processing device 2, there may be a plurality of dirty bits D corresponding to the tip T. Therefore, all the dirty bits D corresponding to the tip T are searched and each is updated. For searching the corresponding dirty bit D, for example, all the dirty bit lists LD may be referred to, or in order to shorten the search time, the dirty bit D corresponding to each tip T may be searched.
The list may be created in advance, and the search may be performed by referring to the list.

In any case, in this embodiment, the tip T that belongs to the shared bag SF even once in the asynchronous period is used.
, The dirty bit D is created, the operation to the tip T is monitored, and the dirty bit D is updated. Therefore, even if the tip T is not present in the shared bag SF at the present time due to, for example, the movement of the tip T, the dirty bit D is surely updated.

On the other hand, new creation of tip T or tip T
When the tip T is inserted into the shared bag SF due to the movement of the tag or the like, as shown in FIG. 21, the tip addition processing unit 42 (see FIG. 1) causes the bag management unit 42 to respond to the instruction from the user operation unit 22. 32 to control the tip T
Belong to the shared bag SF (S31). Further, in S32, the tip addition processing unit 42 determines whether or not the dirty bit list LD indicating the shared bag SF includes the dirty bit D corresponding to the tip T.

Here, when the dirty bit D is included, it indicates that the content update of the tip T is already monitored, for example, when the tip T in the shared bag SF is taken in and out. Therefore, the tip addition processing unit 42 sets the movement parameter of the dirty bit D to "I" in S33. On the other hand, when it is not included, for example, when it is not included in the shared bag SF once, when a tip T is newly created, and the like, it is determined whether the content of the tip T is updated during the asynchronous period. Indicates that it cannot be identified. Therefore, in S34, the tip addition processing unit 42, for example, the dirty bit D indicating the tip T with a value of “Im” in the order after the sync limit Lim, such as the end of the dirty bit list LD. To add. When there are a plurality of dirty bit lists LD corresponding to the shared bag SF, the processes of S32 to S34 are performed for all dirty bit lists LD.

Furthermore, for example, when the tip T is discharged from the shared bag SF by deleting or moving the tip T, as shown in FIG. 22, as shown in FIG.
3 (see FIG. 1) controls the bag management unit 32 according to an instruction from the user operation unit 22 to remove the tip T from the shared bag SF (S41). Here, in the present embodiment, the dirty bit D is held for the tip T included in the shared bag SF even once in the asynchronous period. Therefore, the tip deletion processing unit 43 causes the S42.
In, all the dirty
In the bit list LD, the movement parameter of the dirty bit D corresponding to the tip T is changed to "O". The update parameter is kept as it is.

For example, at the end of the synchronization process, FIG.
As shown in FIG. 5, all the tips T in both shared pockets SF _a and SF _b are in a one-to-one correspondence with each other, and the contents of the corresponding tips T are set to be the same. Therefore, as shown in FIG. 24, the sink limit Li
m is the same as the length of the dirty bit list LD (the number of dirty bits D), and both dirty bits
In the list LD, the corresponding dirty bit D _a
D _b is stored so as to have the same rank. Further, the value of each dirty bit D is set to "Xp".

Furthermore, during the asynchronous period, both information processing devices 2
Then, when the respective databases DB are operated independently, the respective processing units 41 to 43 of the respective information processing devices 2 update the respective dirty bit lists LD. As a result, during the asynchronous period, the value of dirty bit D always indicates the state of the corresponding tip T. As a result, when the respective databases DB are independently updated, both dirty bit lists LD do not match at the time immediately before the next synchronization process, as shown in FIG. 25, for example.

However, both dirty bit lists LD
In, the rank indicated by the sync limit Lim and the dirty bits D before that are not deleted even if the corresponding tip T is deleted, and the same order is maintained during the asynchronous period. As a result, the ranks of the dirty bits D indicating the tips T corresponding to each other in both shared pockets SF _a and SF _b such as the dirty bits D _3a and D _3b are kept the same.

The dirty bit D after the sync limit Lim is newly added to the shared bag SF during the asynchronous period.
Shows the tip T added to the tip T. For example, even if the dirty bit D is stored in the same order such as the dirty bit D ₂₂ D ₂₇ , the tip T of each dirty bit D ₂₂ D ₂₇ is stored.
Does not correspond. These sink limit lim
The subsequent dirty bit D indicates “Im” or “Om”, and “Om” indicates that the tip T newly inserted in the shared bag SF does not belong to the shared bag SF at present. It is shown that. When the number of added tips T is different, both dirty bit lists LD
Are also different in length.

In this state, if a user's instruction or a sensor for detecting communication is instructed to perform a synchronization process,
The synchronization process shown in S3 of FIG. 13 is performed. More specifically, as shown in FIG. 26, in S51, the synchronization processing unit 51 of each information processing device 2 registers the dirty bit D after the sync limit Lim in each dirty bit list LD. Of these, the dirty bit D whose movement parameter is "O" is deleted. As a result, as shown in FIG. 27, both dirty bits
In the list LD, the value of the dirty bit D after the sync limit Lim is only “Im”.

The dirty bit D having the movement parameter "O" is not included in the shared tip SF of the corresponding tip T at the time of the previous synchronization processing and the current synchronization processing. Therefore, the content of the tip T does not need to be sent to the partner regardless of the state of the shared bag SF of the partner. As a result, by deleting these tips T, both information processing devices 2
The number of dirty bits D transmitted between a and 2b can be reduced.

When the compression of the dirty bit list LD is completed in S51, both synchronization processing units 5
In S52, 1 transmits and receives the dirty bit D after the sync limit Lim and generates the dirty bit D corresponding to the dirty bit D sent from the other party. Specifically, one of the information processing apparatus 2b is a own dirty bit list LD _b, and sends the number Y _b of dirty bits D after the sink limit Lim _b, the other information processing equipment 2a, in their own dirty bit list LD _a, sink limit Lim _a
Immediately after, the dirty bit D with the value "Op" is inserted by the number Y _b received. Furthermore, both information processing devices 2
a-2b increases the respective sink limit Lim only the Y _b. As a result, as shown in FIG. 28, the dirty bit D corresponding to the tip T added by the information processing device 2b is also created in the information processing device 2a. Similarly, the dirty bit D corresponding to the tip T added by the information processing device 2a is also added to the information processing device 2b, and the sync limit Lim is adjusted.

Here, as shown in FIG. 28, in the state where the dirty bit D for the tip T of the information processing device 2b is added to the dirty bit list LDa of the information processing device 2a, the sync limit Lim has already been reached. It has been changed and indicates the end of the dirty bit list LDb of the information processing device 2b (in this case, the sync limit Lim = 23). Therefore, when the dirty bit D corresponding to the tip T of the information processing device 2a is added, if these dirty bits D are added immediately after the sync limit Lim of the dirty bit list LDb, the information processing device 2a Tip T added in
Dirty corresponding to (T _22a , T _24a , T _26a, etc.)
Bit D is both dirty bit lists LDa and LD
In any of b, the order is later than the dirty bit D corresponding to the tip T (T _27b , T _29b, etc.) added in the information processing device 2b. As a result, in the dirty bit lists LDa and LDb, the ranks of the corresponding dirty bits D match.

As a result, as shown in FIG. 29, the lengths of the dirty bit lists LD _a and LD _b are equal to each other, and the dirty bits D and D of the same rank are the same.
Indicates the corresponding tip T. Also, both sync limits Lim are dirty bit list L
There is no dirty bit D after the sync limit Lim, which is the same as the length of D. At this stage, the dirty bit list LD and the sync limit Lim may be updated, and the contents of the tip T need not be transmitted.

In the above description, the case of transmitting and receiving the number Y _a (Y _b ) has been described as an example. However, if the dirty bits D of the corresponding tips T can be set in the same order, the information to be transmitted and received is the number Y. _{It is} not limited to _a (Y _b ). Also, in the above, the dirty bit D having a value of “Op” was added,
Similar effects can be obtained if the priority is lower than "m".

When the association of the dirty bit D is completed in the above S52, the two synchronization processing units 51, in S53, based on the dirty bit D transmitted between the two information processing devices 2a and 2b. It is determined whether the tip T corresponding to the dirty bit D is arranged in the shared bag SF. If both dirty bits D _a
When the movement parameters of D _b are different, for example, the priority rule shown in FIG. 30 is used to determine whether or not the tip T _b is arranged in the shared bag SF _b . Note that FIG.
Then, the tip of the arrow has priority.

Specifically, the dirty bit D in the dirty bit list LD is sequentially transmitted from one information processing device 2a to the other information processing device 2b. In the other information processing device 2b, the received dirty bit D
_a and his own dirty bit list LD _b
Compare dirty bit D _{b in the} same order as it was received. The synchronization processing unit 5 of the information processing device 2b
31, the combination of movement parameters is (XX), (XI), (II), (IK) as shown in FIG.
In either case of (1−O) and (I−O), it is determined that the tip T of the dirty bit D is arranged in the shared bag SF, and both tips T corresponding to the dirty bit D are set in the shared bag SF. Belong to. Further, the movement parameters of itself and the other party are set to "X".

On the contrary, the combinations of movement parameters are (X-O), (O-K), (O-O) and (K-).
In either case of K), the synchronization processing unit 51
It is determined that the tip T is arranged outside the shared bag SF, and, for example, the tip T of itself and the opponent is ejected from the shared bag SF and each dirty bit D is set to the invalid state “K”. . If both the information processing devices 2a and 2b are operating normally, the above combination does not become (X-K). Therefore, in this case, it is determined that an error has occurred, and error processing is performed, for example, asking for a user's instruction.

The discharge of the tip T of the opponent and the setting of the dirty bit D are performed by the own dirty bit D.
May be sent to the other party before the change, and may be processed by the other party's synchronization processing unit 51, or the result of its own judgment may be transmitted to the other party. In either case, the dirty bit D and the tip T of the other party are specified in the order in which the dirty bit D or the determination result is sent, and the information for specifying each is not sent in particular. Therefore,
The amount of data transmitted at the time of inside / outside determination is extremely small.
As a result, as shown in FIG. 32, both dirty bits
The movement parameters of all dirty bits D in the list LD are set to "X" or "K".

Note that the tip T whose movement parameter is not "X", that is, the tip T judged to be outside the shared bag SF and the tip T having an error are outside the target of the tip synchronization processing of S54 and S55. And
The update parameter priority determination and tip T content transmission are not performed.

Subsequently, with respect to the tip T (the tip T having the movement parameter "X") which is determined to be within the shared pocket SF in the balloon synchronization of S53, the synchronization processing unit 51 determines in step S54 that both dirty Bit D
Are compared with each other to determine the priority of each corresponding tip T. The priority of Tip T is shown in FIG.
, The update "m" has priority over the maintenance "p", as determined by the update parameters. As a result, whether or not the contents of the tip T should be transmitted and the direction of the transmission are determined.

Specifically, the synchronization processing section 51
As shown in FIG. 34, both dirty bits D _a D
_b is compared, and the combination of update parameters is (pp)
In the case of, it is determined that the contents of the tip T need not be sent. When the combination is (pm), the side with the update parameter "m" is determined to be the priority side, and the content of the tip T is transferred from the priority side information processing apparatus 2 to the non-priority side information processing apparatus 2. Determine that should be sent. Therefore, when both dirty bit lists LD have the values shown in FIG. 32,
As shown in FIG. 35, the priority side is determined. In S54, when the combination is (m−m), that is, when the tip T is updated by both, the tip T
Treated as a collision. In this case, as described below,
For example, refer to information other than the dirty bit D, such as the content of the tip T (update time or a predetermined key field), the side instructing the synchronization processing, the side activating the sharing setting, or the side set in advance. Or the user is inquired, and the priority side is determined by a predetermined priority rule. If the tip T collides,
Each tip T may be regarded as another tip T, and the tip T of the opponent may be added to the own shared bag SF.

When the priority of the tip T is determined in S54 and it is determined that the content of the tip T needs to be sent, the both synchronization processing units 51 of the tip T on the priority side are determined in S55. The content is sent to the non-priority side, and the content of the tip T on the non-priority side is replaced with the content on the priority side. As a result, since the contents of both tips T match, the update parameter of each dirty bit D is set to "p". As a result, as shown in FIG.
All dirty bits D in the dirty bit list LD are set to either "Xp" or "K".

Further, when the tip synchronization is completed in S54 and S55, both dirty bit lists LD are compressed in S56, and the dirty bit D having the value "K" is used for the respective dirty bits D.
It is deleted from the bit list LD. For example, in FIG. 36, the seven dirty bits D at the fifth, sixth, tenth, eleventh, nineteenth, and twentieth positions are deleted from the respective dirty bit lists LD. As a result, as shown in FIG. 37, all the dirty bits D become “Xp”, and the sync limit Lim is updated according to the number of dirty bits D. In the example of FIG. 37, the order of the dirty bits D having the value “Xp” is not changed, but if the corresponding dirty bits D are the same in both dirty bit lists LD, You may change the order.

By the synchronization processing of S51 to S56, the number of tips T in both shared bag SFs and the contents of the corresponding tips T become the same. As a result, even when the database DB is operated independently on one of the information processing devices 2, if the synchronization processing is performed at the time when communication with the other information processing device 2 becomes possible, each shared bag SF SF. The contents of can be matched. Therefore, even when the database system 1 is configured with the information processing device 2 in which the periods in which communication is possible with each other is intermittent,
Data integrity can be maintained.

Further, in the above synchronization processing, in S55,
Before sending the contents of Tip T, S53 and S54
At both information processing devices 2a and 2b, dirty bit D
Are compared, and whether or not the content needs to be sent and the transmission direction are set to Tip T.
It is decided for each. Therefore, the tip T, which is found to be unnecessary to send the content at this point, can omit the transmission of the content. Here, in this embodiment, the update of the content of the tip T having the dirty bit D is monitored.
Therefore, not only the tip T that has not been moved or updated, but is present in the shared bag SF at both the previous synchronous processing time point and the current synchronous processing time point, and is updated during the asynchronous period. For the tip T that does not exist, it is possible to omit sending the content.

Further, in the present embodiment, since the correspondence relation of the tip T is stored as the rank of the dirty bit D, even if the ID indicating the tip T of the other party is not stored,
Can store correspondence. In addition, since the corresponding tip T can be specified without sending the ID, the amount of data transmitted between the information processing devices 2a and 2b and the dirty bit when the dirty bit D is sent and received. The amount of memory required to store D can be reduced.

In the present embodiment, the dirty bit D is created for the tip T included in the shared bag SF even at least once during the asynchronous period, but the present invention is not limited to this. At the end of the previous synchronization process, the tip T included in the shared bag SF is
If the bit D is created, it is possible to omit the content transmission of the tip T, which has only been moved, as in the present embodiment. However, like the present embodiment, when the dirty bit D is also created for the tip T currently included in the shared bag SF, the speed at which the tip T newly inserted during the asynchronous period is searched for is high. Improve and
By extracting only the tips T of which the movement parameter of the dirty bit D is “X” or “I”, the list of the tips T included in the shared bag SF in the tree structure S shown in FIG. 6 can be created. As a result, the tip T
The list of can be deleted and the amount of memory can be reduced.

Note that, for example, the individual processing such as the addition of the tip T may be performed by the synchronization processing section 51 of any of the information processing devices 2. For example, one of the synchronization processing units 51 may perform all the processing, or both of them may share the processing.

The operation in the case where the collision of the tip T is detected in S54 will be described below in more detail. That is, in the present embodiment, when a collision is detected, any one of the following three models is adopted as a main body for resolving the collision. Although one model may be adopted, the information processing device 2 according to the present embodiment
Uses the model designated as an option during the sharing setting shown in S1 of FIG. 13 among the plurality of usable models.

The first model (discussion model) is shown in FIG.
As shown in FIG. 8, the sinks of both information processing devices 2a and 2b
The manager 61 manages each upper application 6
The information processing device 2a and 2b independently determines the priority side. In the second model (selection solution model), as shown in FIG. 39, only the sink manager 61 of both information processing devices 2a and 2b inquires the higher-level application 62 to determine the priority side. To do. Furthermore, the third model (automatic solution model)
As shown in FIG. 40, both sync managers 61 select the priority side based on a predetermined priority rule without inquiring the upper application 62. The sync manager 61 is a part of the synchronization processing unit 51 shown in FIG. The upper application 62 is an application that refers to data in the database, such as an application that analyzes data in the database, or an application that inquires the user of the information processing device 2 about the priority side. Then, the priority side can reply.

In the selection solution model, the method of selecting one of the information processing devices 2 is the same as the one-sided selection model of the automatic solution model to be described later, such as the presence or absence of the higher-level application 62 and the start side of the sharing setting. Can be adopted. However, like the model showing the method of determining the priority side, if the selected information processing device 2 is different, there is a possibility that the undesired one may be selected.
The method of selecting is preferably set when sharing is set.

The discussion model further includes a negotiation resolution type model for resolving a collision during synchronization processing in which a collision is detected, and a collision detection and collision resolution communication once according to the timing of resolving a collision. It is divided into an application-solving model that disconnects. Similarly, the selection solution model is divided into a client immediate model and a client delay model. As shown in FIG. 41, the negotiation resolution type model and the client immediate type model are
It is classified into an immediate solution model that is in the same synchronization process as the detection, and the application resolution model and the client delay model are classified into a delay solution model in which the resolution time is in the synchronization process after the collision is detected.

Here, in the case where the negotiation solution type model is adopted among the immediate solution models, for example, as shown in FIG. 42, in S61, the sink manager 61 of one of the information processing devices 2a has its own tip T. The information necessary for determining the priority side among the contents of the above and the information necessary for determining the priority side among the contents of the tip T of the other party are presented to the upper application 62. Similarly, in S62, the information indicating the tip T of the user and the tip T of the partner is presented to the higher-level application 62 in the information processing device 2b of the partner. Further, in S63 and S64, the upper application 62 of each of the information processing devices 2a and 2b independently determines the priority side.

When the priority side is determined by both sides, the sync manager 61 determines in S65 whether or not the priority side is matched. If both match (S6 above)
If YES in 5), it is determined in S66 whether or not the priority side is the own device. In the case of the own device, the sink manager 61 sends the contents of its own tip T to the partner information processing device 2 in S67,
Replace the contents of Tip T of the opponent. On the other hand, if it is not the own device, in S68, the content of the tip T of the partner is received from the information processing device 2 of the partner,
Replace the contents of your own tip T. As a result, the content of the tip T sets that have collided becomes the same.

In S65, if the priority sides of both do not match, the sink manager 61 of the information processing device 2a adds the contents in the above-mentioned S61 to the upper application 62 of its own in S69. Furthermore, the priority side decided by the other party is presented. Similarly, in S70, the sink manager 61 of the information processing device 2b presents the presentation content of S62 and the priority side determined by the information processing device 2a to its own upper application 62. After that, the processes from S63 onward are repeated, and the priority side is reconsidered by each upper application 62.

When the client immediate model is adopted, for example, as shown in FIG. 43, in one information processing device 2, as in S61 of FIG. Is displayed on the upper application 62 (S81). Also, S82
At, the upper application 62 determines the priority side based on these pieces of information. Further, when the priority side is the own device (YES in S83), the contents of the tip T of the partner is replaced with the contents of the tip T of the partner in S84, and the partner device is prioritized (No in S83).
In the case of), in S85, the content of the tip T of the opponent is replaced with the content of the tip T of the opponent. As a result, the content of the tip T sets that have collided becomes the same.

On the other hand, when the application resolution type model is adopted among the delay resolution type models, for example, as shown in FIG. 44, it is determined in S91 whether the contents of both tips T match. The case where both match is the case where the collision of the tip T is detected in the previous synchronization process, and the solutions independently proposed by both match. In this case, in S95, the sync manager 61 of each of the information processing devices 2a and 2b sets the update parameter of its own dirty bit D corresponding to the tip T to the maintenance "p" and completes the processing. .

On the other hand, when the contents of both tips T do not match (No in S91 above), each sync manager 61 exchanges the contents of tip T with each other in S92, and then S93. Then, for example, by disconnecting the communication or determining the collision of another tip T, the synchronization processing regarding the tip T is interrupted once. Further, while the communication is disconnected, the sync manager 61 of both the information processing devices 2a and 2b responds to the instruction of the respective upper application 62 in S94, independently of the sync manager 61 of the other party, to perform the conflict resolution process. Then, the process is completed.

In the following, based on FIG. 45, the above S94
The process will be described in more detail. That is, the sync manager 61, in S111, in S91,
The content of the tip T received from the other party and the content of the tip T of its own are presented to the host application 62 of its own, and an instruction of which is prioritized is received from the host application 62.

When the upper application 62 determines that the content of the tip T of the partner device is prioritized (S1 above).
If YES in 12), the sync manager 61
In S113, the content of the tip T of the user is replaced with the content of the tip T of the other party, and in S114, the update parameter of the dirty bit D corresponding to the tip T is set to the update "m", and the processing is executed. Complete. On the contrary, when it is determined that the content of the tip T of the own device is prioritized (No in S112 above), the sync manager 6
In step S114, the update parameter of the dirty bit D corresponding to the tip T is set to update "m" without performing the process of step S113.

Here, when both the information processing devices 2a and 2b perform the processes of S111 to S114, the update parameter of the dirty bit D is updated in S114 regardless of which is determined to be the priority side. Since it is set to "m", a collision is once determined in the next synchronization processing. However, if both priority sides match, the contents of both tips T match, so the determination in S91 shown in FIG. 44 is YES.

For example, when the information processing device 2a determines that the partner device is the priority side and the information processing device 2b determines that the own device is the priority side, the information processing device 2a is: Since the judgment in S112 is YES,
The content of the tip T of the information processing device 2a is replaced with the content of the tip T of the information processing device 2b. Further, in the information processing device 2b, since the determination in S112 is No, the content of the tip T of the information processing device 2b is not changed.

As described above, when both priority sides match, the contents of both tips T match at the time of the next synchronization processing, and the determination in S91 is YES. As a result,
The processing of S95 is performed in both the information processing devices 2a and 2b, and the update parameter of the dirty bit D corresponding to the tip T becomes the maintenance "p", and the collision is completely resolved. .

If the two priority sides do not match, the contents of both tips T do not match at the time of the next synchronization processing. Therefore, in the next synchronization process, the processes after S92 are repeated again, and the respective upper applications 62 are requested to resolve the conflict again.

In the case of the client delay type model,
The information processing device 2 that makes an inquiry to the higher-level application 62 performs the process shown in FIG. That is, S1
At 21, the sync manager 61 transfers and receives the contents of the tip T of the other party to itself. Furthermore, S1
At 22, the update parameter of the dirty bit D of the opponent corresponding to the tip T is changed to the maintenance “p”.

Further, in S123 and S124, similar to S93 and S111 shown in FIG. 45,
The priority side is determined after the interruption of the synchronization process. If it is determined that the partner device is the priority side (YES in S125), the sync manager 61 determines in S126 that the above S1.
The contents of the tip T of the partner device received at 21 are replaced with the contents of the tip T of the own device. Furthermore, S127
Then, the update parameter of its own dirty bit D corresponding to the tip T is set to the maintenance "p" and the processing is completed.

On the contrary, when the own device is determined to be the priority side (No in S125), the sync manager 61 determines that its dirty
The update parameter of bit D is set to update "m" (S1
28). Here, in S122, the update parameter of the dirty bit D corresponding to the tip T is set to the maintenance “p” in the partner device. Therefore, when the own device is determined to be the priority side (the update parameter is updated "m")
In this case), the content of the tip T of the partner device is replaced with the content of the tip T of the own device in the next synchronization process.

When the above delay solution model is adopted,
After a tip T collision is detected in a certain synchronization process,
Since the contents of the tip T are matched in the synchronization process from the next time onward, it is not necessary to determine the priority side during a single synchronization process. As a result, for example, the upper application 6
Even when the sync manager 61 takes a long time from the inquiry to the priority side until the answer is obtained, as in the case where 2 receives the instruction from the user, the total communication time is set to a fixed time. Therefore, the communication cost and power consumption can be reduced. In the above description, the case where all the contents of both tips T are presented has been described as an example, but if the priority side can be determined, the information to be presented is the occurrence of a collision,
The same effect can be obtained even if the content of the tip T is part.

On the other hand, the automatic solution model is a sequential decision model for deciding the priority side for each set of the tips T that have collided,
At the start of the synchronization processing, one information processing device 2 can be roughly divided into a one-side selection model in which the information processing device 2 is set as the priority side in advance. An example of the former is a method of determining the priority side based on a part of the content of the tip T, such as the last update time. In this case, for example, as shown in FIG.
31, the sync manager 61 shown in FIG.
Acquires the last update time t1 of the tip T to be processed in its own information processing device 2. In addition, S13
In 2, the last update time t2 of the tip T of the opponent corresponding to the tip T is acquired. Further, in S133, the last update time t1 of the user is the last update time t2 of the other party.
Is newer than. Own last update time t
If 1 is newer, the contents of the tip T of the opponent are replaced with the contents of the tip T of the opponent in S134. On the contrary, if the last time t2 of the other party is newer,
In S135, the content of the tip T of the opponent is replaced with the content of the tip T of the opponent. As a result, the tip T updated later can be prioritized. For example, in FIG.
In the example shown in FIG. 8, the last update time of the tip T _8a of the information processing device 2a is newer than the tip T _8b of the information processing device 2b. Therefore, the contents of tip T _8a replace the contents of tip T _8b . The criterion for determining the priority side is not limited to the last update time, but the tip T
The same effect can be obtained if it is a part of the contents of.

Further, in the automatic selection model, the one selection model is, for example, as shown in FIG. 49, in S141, it is determined whether or not the priority side determined by the start of the synchronization process is the own device. To be done. If the own device is prioritized, the content of the tip T of the other party is replaced with the content of the tip T of the other party in S142, and if the other device is prioritized, the content of the tip T of the other party is used in S143. The contents of tip T of are replaced. Thereby, the tip T on the predetermined side can be prioritized.

In this embodiment, the priority side referred to in S141 is determined by one of the following three models. The first model is a model in which the priority side is set in advance during the synchronization setting shown in S1 of FIG. 13, is stored as priority side information, and is determined based on the priority side information. Any method can be used for the priority side.
For example, it may be set according to an instruction from the user or the upper application 62.

The second model is a model of the first model that determines the priority side based on the side that has activated the sharing setting. Further, the sharing setting activation side priority model and the sharing setting are used. It is divided into the passive side priority model. The sharing setting starting side priority model is preferably used, for example, when the database system 1 including the information processing devices 2 ... Always wants to give priority to the client / server type client side, and the starting side of the synchronization process and the contents of the tip T. Regardless of the above, the sharing setting activation side is always prioritized. On the other hand, the shared setting passive side model is preferably used, for example, when the server side of the database system 1 is always desired to be prioritized, and the shared setting passive side model is always prioritized. In either case, since the activation of the sharing setting and the specification of the priority side can be designated by the same operation, the operation can be simplified as compared with the case where the respective operations are designated by different operations.

Further, the third model is a model for deciding the priority side based on the side activating the synchronization processing in S3 of FIG. 13, and includes the synchronization processing activation side priority model and the synchronization processing passive side priority model. Can be divided into These models are used, for example, when the information processing devices 2 are equal and the former wants to prioritize its own device, and the latter when it wants to prioritize the other device. In either case, since the activation of the synchronization processing and the identification of the priority side can be designated by the same operation, the operation can be simplified as compared with the case where the respective operations are designated by different operations. Furthermore, the priority side can be changed depending on which information processing device 2 starts the synchronization process at the time of each synchronization process.

By the way, in the above, FIG. 30 and FIG.
As shown in, among the sets of Tip T corresponding to each other,
Although the tip T having a change such as addition / deletion / update is prioritized and the change is reflected to the other information processing device 2,
It is not limited to this. For example, for all the sets of tip T, the synchronization process and the sharing setting start side, or
The side (priority side) determined by the start time of the synchronization process, such as a predetermined side, is always prioritized. For example, as shown in FIG. 50, the shared bag S of the information processing device 2a (priority side)
In accordance with the content of the F _a, the non-preferential information processing apparatus 2
In b, the contents of the shared bag SF _b may be updated. In this case, the synchronization process is a download (upload). When the information processing device 2 can select whether to download or not, it is better to specify the selection as an option at the time of sharing setting shown in S1 of FIG. 13, as in the model of the priority side determination.

Specifically, as shown in FIG. 51, S15
In 1, the dirty bit list LD on the priority side
Is compressed similarly to S51 shown in FIG. further,
In S152, the tip T added during the asynchronous period is deleted from the shared bag SF on the non-priority side. Also,
In S153, the dirty bit D corresponding to the tip T added on the priority side is added to the dirty bit list LD on the non-priority side, as in S52.

In S154, the synchronization processing section 51 shown in FIG. 1 makes an internal / external determination based on the dirty bit D on the priority side, and sets the movement parameter of the dirty bit D to "X" in both dirty bit lists LD. Or “K”, and the tip T is moved according to the inside / outside determination. That is, when the movement parameter of the dirty bit D on the priority side is "X" or "I", the inside of the shared bag SF is shown. Therefore, the tip T is left in the shared bag SF and the movement parameter of both dirty bits D corresponding to the tip T is set to “X”. Also, the dirty bit D on the priority side
If the movement parameter of "K" is "K" or "O", it means that the tip T is outside the shared hat SF and the dirty bit D corresponding to the tip T is moved. The movement parameter of is set to "K".

Further, in S155, the contents of the tip T on the non-priority side are replaced with the contents of the tip T on the priority side based on the update parameters of both dirty bits D. Specifically, the update parameter on the priority side is updated "m".
In the case of, the content of the tip T is sent to the non-priority side. Further, even when the update parameter on the priority side is the maintenance “p”, if the update parameter on the non-priority side is the update “m”, the content of the tip T is similarly replaced on the non-priority side. If both update parameters are maintained “p”, the contents of tip T are not transferred.

When the content synchronization of the tip T is completed in S155, both dirty bit lists LD are compressed in S156, as in S56 of FIG. As a result, the contents of the shared bag SF on the non-priority side are
The contents can be uploaded or downloaded according to the contents of the shared bag SF on the priority side.

Further, as one of the options that can be set by the sharing setting processing section 52, as shown in FIG. 52, the tips T that have collided are regarded as different tips T, and their own tips T are shared by the other party. A model added to the bag SF can also be adopted. As with the necessity of downloading, whether or not to adopt the model is also specified as an option at the time of sharing setting.

Specifically, as shown in S161 of FIG. 53, when tips T _4a and T _4b collide with each other, their own dirty bit list LD _b
The dirty bit D in the bit list LD _a
A dirty bit D _4ab having a lower priority than its own dirty bit D _4a , such as “Op”, is newly created in the same order as that of _4a . Similarly, in S162, in its own dirty bit list LD _a ,
Create a new dirty bit D _4ba in the same rank as the opponent's dirty bit D _4b . Further, based on these dirty bits D, in S163, the tip T _4a
The contents of is transmitted to the information processing apparatus 2b, a new tip T _4ab corresponding to the tips T _4a is added to the shared bag SF _b. Further, in S164, a new tip T _4ba corresponding to the tip T _4b is added to the shared bag SF _a . Thereby, when the tip T collides, all the changed contents of the tip T can be saved.

Note that in FIGS. 52 and 53, an example in which copying is performed only when a collision of the tip T occurs has been described. However, as another option, as shown in FIG. 54, at least one of the corresponding tips T is set. A model that copies when it is changed can also be adopted. In this case, the set of tips T that has not been changed is not changed at all, but the tip T is copied when at least one of the sets of tips T is changed. As a result, a copy is also created for the tips T _2a , T _2b and T _3a , T _3b , only one of which has been changed, and the entire contents of the changed tip T can be saved.

The process during the asynchronous period shown in S2 of FIG. 13 and the synchronous process shown in S3 are alternately repeated.
After that, when the synchronization process becomes unnecessary, in S4,
Sharing settings are canceled. As an example of cancellation of sharing, a model in which the bag F and the tip T remain on both information processing devices 2a and 2b (tip copying type model) will be described. As shown in FIG. 55, the model is provided on one of the information processing devices 2a. The sharing cancellation processing unit 53, in S171,
The sharing cancellation request is sent to the sharing cancellation processing unit 53 of the other information processing device 2b. The sharing cancellation request includes, for example, information indicating the shared pocket SF of the partner such as a combination of the own pocket ID and the ID of the partner, and information indicating the shared pocket SF of the partner corresponding to the shared balloon SF. Has been.

Further, in S172, the sharing cancellation processing unit 53 on the sharing cancellation starting side, for example, the dirty bit list LD and the sync limit Lim corresponding to the above combination, and the partner registered in the sharing partner list LS. The shared information provided at the time of sharing setting, such as the bag ID, is deleted. On the other hand, in the information processing device 2b on the sharing cancellation passive side, the sharing cancellation processing unit 53 deletes the sharing information stored therein based on the received sharing cancellation request (S173, S174). In addition, in FIG. 55,
Although the authentication of the sharing partner is not shown, the sharing cancellation passive side may determine whether or not to cancel the sharing in accordance with the content of the sharing cancellation request, similarly to the sharing setting.

As a result, as shown in FIG. 56, the shared bag SF shared between the information processing devices 2a and 2b.
_{The a} · SF _b is the non-shared bag F _a · F _b . In the sharing cancellation of the tip copy type model, when the sharing cancellation is instructed, the sharing setting between both sharing bags SF _a and SF _b is only canceled, and the tip T included in each of them is set to the both sides. Remains on the seams F _a and F _b .

The sharing cancellation model is not limited to the tip copy type model, and various models can be applied. For example, when the sharing setting is canceled, as shown in FIG. 57, a model in which a tip is left only in one of the bags F and a tip is deleted in the other bag F (a model in which the tip is unevenly distributed) is adopted. As shown in FIG. 58, the tip extinction type model, that is, both of the bag F
A model in which the tip T is deleted may be adopted. Further, in the case of the tip copy type model or the tip uneven distribution type model, when sharing cancellation is instructed, it is possible to perform sharing processing and then cancel sharing. In this case, even if the synchronization process is not instructed, the tip T
The integrity of can be maintained. Further, in the case of removing the tip T as in the tip uneven distribution model and the tip disappearance model, as shown in FIG. 59 and FIG. Good. In any case, the information processing device 2
If a plurality of sharing cancellation models can be selected, it is better to set the sharing cancellation model as an option at the time of sharing setting shown in S1 of FIG. 13, as in the model selection for determining the priority side.

By the way, in the above, S51, that is,
During the synchronization processing shown in S3 of FIG. 13, the dirty bit D after the sync limit Lim was compressed, but this processing only refers to the dirty bit D stored in its own information processing device 2. Therefore, it can be performed during the asynchronous period of S2. In this case, the first order deletion means described in the claims is the database processing unit 24.
Corresponding to.

In this case, the tip deletion processing section 43 (see FIG. 1) is set to the tip deletion processing section 43 (see FIG. 1) when the ejection of the tip T is instructed.
Instead of 1, the process shown in FIG. 61 is performed. That is, S1
At 81, it is determined whether or not the dirty bit D corresponding to the tip T is after the sync limit Lim. If it is, then at S182, the dirty bit D is deleted from the dirty bit list LD. It
On the other hand, if it is not after, the movement parameter of the dirty bit D is changed to "O" in S183. As a result, the processing of S51 is not required during the synchronization processing, and the required time can be shortened.

Further, in the case of compressing during the asynchronous period, for example, when the tip T is inserted by an erroneous operation, the tip T existing in the shared bag SF is extremely short.
Dirty Bit D associated with
It can be deleted from the list LD immediately. As a result, the length of the dirty bit list LD can be suppressed and the amount of memory required for storage can be reduced.

In FIG. 61, the case where the dirty bit list LD is compressed when the tip T is discharged has been described, but the dirty bit list LD may be compressed at any time during the asynchronous period. In this case, for example, due to an instruction from a higher-level application or the like, a dirty file that is located after the sync limit Lim and has a movement parameter of “O” is ejected.
Bit D is deleted from the dirty bit list LD. As a result, the dirty bits D of a plurality of tips T can be deleted from the dirty bit list LD by one processing.

By the way, in the above description, as shown in FIG. 19, when the tip T is no longer present in the shared bag SF, such as when the tip T is removed from the shared bag SF, or when it is deleted. The information processing device 2 sets the movement parameter to discharge “O” in the dirty bit D corresponding to the tip T. Therefore, when the dirty bit D is assigned to the tip T, it is necessary to hold the content of the tip T until the next synchronization processing, which may increase the memory amount required for each information processing device 2. There is.

More specifically, for example, as shown by the dirty bits D _14a and D _14b in FIG. 25, the tip T associated with the previous synchronization process is associated with one of the information processing devices 2a. The dirty bit D corresponding to the tip T may indicate insertion maintenance “Ip”, and the other information processing device 2b may indicate ejection maintenance “Op”. In this state, for example, in the information processing device 2a, after the tip T is ejected to the outside of the shared bag SF, an operation of returning the tip T into the shared bag SF is performed, and in the information processing device 2b,
This occurs when an operation of moving the tip T out of the shared bag SF is performed.

In this state, at the time of inside / outside determination (float) synchronization shown in S53 of FIG. 26, the dirty bit D _{14a is used.}
As shown in FIG. 32, D _14b becomes the stationary maintenance “Xp”, and the contents of both tips T _14a and T _14b are considered to be the same. As a result, the priority determination is not performed in the priority determination of S54 subsequent to S53 (see FIG. 35), and even in the content synchronization of the tip of S55, each information processing device 2a.
The contents of Tip T are not transmitted between 2b (see FIG. 36).

Therefore, when the dirty bit D is managed as shown in FIG. 19, if the contents of the tip T are lost in one of the information processing devices 2 before the synchronization processing, the result shown in FIG. At the time of the synchronization processing shown, the contents of the tip T cannot be recovered, and the database D is exchanged between the information processing devices 2.
The consistency of B cannot be maintained. In other words, in the case of the management method shown in FIG. 19, each information processing device 2
Even if each user decides that the tip T is unnecessary and deletes the tip T, if the dirty bit D corresponding to the tip T exists, until the next synchronization processing is performed. , It is necessary to hold the contents of the tip T. As a result, the information processing device 2 expected to have a long asynchronous period requires a larger storage capacity.

In many cases, the portable information processing device 2 has a limited mountable memory amount, and
It is uncertain when communication will be possible and synchronization processing can be performed. Therefore, in such an information processing device 2,
As shown in the following modified example, it is desirable to employ the management method shown in FIG. 64 instead of the management method of the dirty bit D shown in FIG. In this case, the database management unit 23 also corresponds to the corresponding data information storage unit described in the claims, and the tip deletion processing unit 43 also corresponds to the association elimination unit, the data deletion unit, and the deletion selection unit. .

Specifically, in the information processing device 2 according to the present modification, in addition to the operation shown in FIG. 19, a tip deleting operation involving deletion of an entity, a tip discharging operation involving deletion of an entity, and sharing. It is possible to process the entity deletion operation of the tip T outside the bag SF. In the case of both operations, as shown in FIG. 64, the dirty bit D corresponding to the tip T to be operated is set to invalid “K” regardless of the value up to that point. Also, when the substance of the tip T outside the shared bag SF is deleted, the value of the dirty bit D is set to invalid "K". The value of dirty bit D is shown in FIG.
As in the case of, for example, as shown in FIG.
Can be expressed by OBI.

When this management method is adopted, the tip deletion processing section 43 shown in FIG.
When the tip T is discharged together with the deletion of the entity, such as when receiving an instruction via 2, the flap management unit 32 is controlled to share the tip T as the operation target with the flap SF SF, as in S41 shown in FIG. Discharged from (S shown in FIG. 65)
201). Further, in S202, the tip deletion processing unit 43 sets the value of the movement parameter of the dirty bit D corresponding to the tip T in all the dirty bit lists LD indicating the shared bag SF to invalid "K". To do. Further, in S203, the tip management unit 31 follows the instruction of the tip deletion processing unit 43,
The correspondence between the substance of the tip T (for example, a file or data on the memory) and the dirty bit D is canceled.

Note that, as a method of canceling the correspondence, for example, when the number of dirty bits D corresponding to each tip T is added to the substance of each tip T, the number may be decreased. Further, a value indicating whether or not the substance of the tip T remains may be stored for each dirty bit D corresponding to the tip T discharged from the shared bag SF. Further, if all dirty bit lists LD are searched and it is judged whether or not there is a dirty bit D corresponding to the substance of the tip T, the dirty bit D
It is also possible to cancel the association by itself setting "invalid" to "K". In any case, the same effect can be obtained if it is possible to determine whether or not there is a dirty bit D corresponding to each tip T in the substance deletion processing of the tip T described later. In addition, the tip T described later
If the substantive deletion process of is performed subsequently, the actual deletion process of the tip T itself can be regarded as the cancellation of the association.

On the other hand, in the case of deleting the substance from the tip T outside the shared bag SF, the information processing device 2 sets the S in FIG. 65 to S211 and S212 in FIG.
The same process as 202 and S203 is performed, and the tip T
And the association between the dirty bit D and.

In any case of the process involving the deletion of the entity, if the entity of the tip T is not referred to from another place (such as another shared bag SF or another application), the tip The deletion processing unit 43 controls the tip management unit 31 to delete the substance of the tip T. As a result, the free area of the database management unit 23 can be expanded in the information processing device 2. As a result, even when the asynchronous period is long and many tips T are deleted, the memory amount required for the database management unit 23 can be reduced.

Here, even if the tip deletion processing section 43 is instructed by the user to delete the substance, for example,
The tip T is moved to a specific bag F, and the entity of the tip T and the correspondence are retained for as long as possible, and the free memory amount is compared with a predetermined value. It is preferable to cancel the correspondence between the dirty bit D and the substance of the tip T when the shortage occurs. As a result, unless there is not enough free memory,
The substance and correspondence of each tip T can be held. As a result, it is possible to reduce the amount of data transfer during synchronization processing, and
It is possible to secure a memory that is indispensable for the operation of the information processing device 2, such as adding or updating the tip T.

Further, the tip deletion processing section 43 estimates and compares the possibility of transferring the content of the tip T from the information processing apparatus 2 of the other party when canceling the association and at the time of the next synchronization processing. It is also possible to cancel the association in order from the tip T with the lowest possibility. This possibility is, for example,
It may be estimated from the history of the synchronization processing up to now, or when the tip T is ejected, it is estimated that the possibility of transfer is higher than when it is deleted.
You may guess based on a user's operation in. When canceling the association, it is better to determine whether or not the substance of the tip T can be deleted, that is, whether or not the tip T is referenced from another location, and to cancel the association from the deletable tip T. Good. This makes it possible to efficiently reduce the data transfer amount during the synchronization processing while securing the memory essential for the operation of the information processing device 2 for a longer time as the tip T having a higher transfer possibility.

In any case, the movement parameter of the dirty bit D for which the association has been canceled is set to invalid "K", and as described later, during synchronization processing, it is necessary. , Is transmitted from another information processing device 2. Therefore, even if each information processing device 2 deletes the substance of the tip T at any time during the asynchronous period, the consistency of the database DB in the database system 1 is maintained at the time when the synchronization process is performed.

Specifically, similar to the management method shown in FIG. 19, even in this modification, the dirty bit list LD is updated in response to an operation on the tip T during the asynchronous period. In the example, dirty bit D may change to an invalid "K". Therefore, in each of the information processing devices 2a and 2b at the time of starting the synchronization process, the dirty
The bit list LD _a , LD _b contains the dirty bit D of invalid “K”.

[0209] This dirty bit list LD _a L
When the compression processing shown in S51 of FIG. 26 is performed on D _b , among the dirty bits D corresponding to the tip T newly added to the shared balloon SF during the asynchronous period,
The dirty bit D corresponding to the tip T that is not currently included in the shared bag SF is deleted from each dirty bit list LD.

Specifically, as shown in FIG. 67, sink limit Lim _a Lim _b = 21, Y _a = 7, Y _b
= 5, for example, the sink limit Lim _a
Dirty bits D _{22a to} D _28a after Lim _b
Of D _{29b to} D _33b ), the discharge update “Om” and invalid “K” dirty bits (D _23a , D _25a ...) _Are deleted. As a result, as shown in FIG. 68, of the respective dirty bit list LD _a (LD _b), sink limits the Lim _a (Lim _b) after the dirty bit D of the insertion update "Im" Only remains.

[0211] Further, in S52, similarly to FIGS. 27 to 29 described above, each of the dirty bit list LD _a (LD _b), dirty bit added in the other information processing device 2b (2a) D with _b (D _a) is added, the sink limit Lim _a (Lim _b) is adjusted (see FIG. 69). As a result, in the dirty bit list LD _a LD _b , the dirty bits D _a D _b indicating the corresponding tips T are arranged in the same order, and the correspondence between the dirty bits D _a D _b is set. Attached. Here, at the time of S52, each information processing device 2
The dirty bits D _a and D _b are associated with each other, but the contents of the tip T are not transmitted. Therefore, the value of the newly added dirty bit D is set to invalid "K".

Then, in S53, each information processing device 2a
・ Dirty bit D is exchanged between 2b and Tip T
The inside / outside determination (float) synchronization is performed. However, in this modified example, even if the dirty bit D before the sync limit Lim is deleted, if the substance of the tip T is deleted,
Since it changes to invalid “K”, even if the dirty bit list LD _a · LD _b after the dirty bits D _a · D _b are associated between the information processing devices 2 is invalid “K”. It is included. Therefore, the synchronization processing unit 51 determines whether the tip T is inside or outside according to the following rule instead of FIG.

Specifically, the combinations of the movement parameters of the dirty bit D are (X−X), (X−I), (I
-I), (I-K) and (I-O), the tip T corresponding to the dirty bit D is
It is determined that the moving parameter is placed in the shared bag SF, and the moving parameter is set to the static “X” in the dirty bit D between itself and the opponent. On the other hand, the combinations of movement parameters are (X-O), (O-K), (O-O) and (K-).
K) in either case, the tip T is the shared bag SF
It is determined to be outside, and each movement parameter is set to invalid “K”.

Furthermore, one of the dirty bits D is invalid "K" such that the combination is (I-K), and
When the tip T is placed in the shared bag SF, the update parameter of each dirty bit D is also changed,
The dirty bit D of invalid "K" is set to the static hold "Xp" while the other dirty bits D are set to the static update "Xm". This allows other dirty
Even if the content of the bit D has not been updated (when the dirty bit D is the insertion maintenance “Ip”), in the content synchronization shown in S54, which will be described later, the information processing device 2 in which the substance of the tip T does not exist does not exist. Must be replenished with the contents of the tip T from another information processing device 2.

As a result, for example, the sync limit Li
In the case where m = 28 and all combinations of dirty bits D _a and D _b are covered, the respective dirty bit lists LD _a and LD _b are changed from the state shown in FIG. The state changes to.

Here, the determination of the combination of the dirty bits D _a and D _b is performed for each combination, and the determination result is stored as the change of the movement parameter and the update parameter. Therefore, similarly to the case of the management method shown in FIG. 19, even if the inside / outside determination (floor) synchronization processing of S53 is interrupted due to communication disconnection or the like, the synchronization processing can be restarted without any trouble.

After that, as in the case of the management method of FIG. 19, in S54, priority determination is performed, and in S56, each dirty bit list LD _a LD _b is compressed and the synchronization processing is performed. finish.

Further, when the synchronization processing is completed, the tip deletion processing unit 43 determines that the shared bag S
For the tip T arranged outside F, it is determined whether or not the entity is referenced from another place, and if it is not referenced from any place, the tip management unit 31 is controlled to identify the entity of the tip T. delete. Here, these tips T are data that do not need to maintain consistency between the respective database DBs, and their contents are not transferred in the subsequent synchronization processing. Therefore, by deleting the substance of these tips T, it is possible to increase the free memory amount of the information processing device 2 without increasing the data transfer amount at the time of synchronization processing.

In the above description, the case where the substance of the tip T that is not associated between the databases DB is deleted at the end of the synchronization process has been described as an example, but the present invention is not limited to this. For example, when the content of the tip T is reused, such as when frequently referring to the content of the tip T arranged outside the shared bag SF, the substance of the tip T need not be deleted at the end of the synchronization process. Good. Furthermore, the information processing device 2 can be set so as to meet the user's request.
It is better that the tip deletion processing unit 43 can select whether or not to delete the substance. In this case, further, it may be selected for each sharing setting, or may be commonly selected for all sharing settings.

In the modification, the value "K" indicating invalidity is always used as the value of the dirty bit D during the asynchronous period, but it is invalid to meet the user's request. It may be possible to set whether to use "K". In this case, the time of setting the necessity of invalid "K" is the same as when setting the sharing cancellation model. This is more preferable because it is possible to suppress the occurrence of troubles due to the difference in settings between the information processing devices 2 during the synchronization processing.

Further, although the above description has been made with reference to FIG. 26 as an example, also in the present modification, the dirty bit list LD of itself may be compressed during the asynchronous period as in the case of FIG. 61. In this case, the dirty bit D corresponding to the tip T is deleted from the dirty bit list LD regardless of whether or not the entity is deleted.

By the way, in the above description, each information processing device 2 is irrespective of whether or not the substance of the tip T is deleted.
In the inside / outside determination (float) synchronization shown in S53 of FIG. 26, when the combination of the movement parameters of the dirty bit D is (insert “I” -ejection “O”) ([14] and [15 shown in FIG. 32. ] [17] / [18] or [16] / [17] / [20] / [21] shown in FIG. 71), the tip T corresponding to the dirty bit D is in the shared bag SF. It is determined that they are located, and the respective movement parameters are set to the static “X” without changing the respective update parameters. On the other hand, in the priority determination shown in S54, the priority side is determined based on the update parameter. Therefore, when the combination of dirty bits D is (Im-Op), “I
The “m” side has priority. Similarly, in the case of (Ip-Om), the side of "Om" is prioritized, and in the case of (Im-Om),
Judged as a collision.

Here, (Ip-Om) and (Im-O)
In the case of m), the insertion “I” is determined in the inside / outside determination (float) synchronization.
Although the operation result on the side of "O" is reflected, the operation result on the discharge "O" side may be reflected in the priority determination. On the other hand, depending on the application and user, even if the update of the tip T on the discharge “O” side is not reflected in the result of the synchronization processing, the method of matching the determination of inside / outside determination (float) synchronization with the determination of the priority determination May be better.

In the following, as still another modification, when the combination of movement parameters is (I-O), the content of the tip T on the insertion "I" side is given priority.
It will be described with reference to FIG. In this case, the synchronization processing unit 51 also corresponds to the in-range priority unit and the priority selection unit described in the claims.

In each information processing apparatus 2 according to this modification, in the inside / outside determination (float) synchronization shown in S53 of FIG.
When the combination of the dirty bits D is (Ip-Om) and (Im-Op), the synchronization processing unit 51 not only sets each movement parameter to the stationary "X", but also updates the insertion "I" side. Update parameter "m"
And the update parameter on the discharge “O” side is set to maintain “p” ([17] and [21] in FIG. 72). This allows S
At the time of the priority determination of 54 and the content synchronization of S55, the tip T on the insertion "I" side is always prioritized, and the content of the tip T on the ejection "O" side is changed according to the content on the insertion "I" side. It As a result, the inside / outside determination (float) synchronization and the priority determination can be matched.

In the above description, the case where the discharge “O” side is prioritized has been described as an example, but it is possible to set whether or not the discharge “O” side is prioritized in order to meet the user's request. May be. In this case, as in the case of setting the sharing cancellation model, whether or not to prioritize the discharge “O” side is set during a period in which each information processing device 2 can communicate, for example, at the time of sharing setting. Is desired. This setting may be common to all shared settings or common to all shared settings. As a result, it is possible to surely agree between the information processing devices 2 as to whether or not the discharge “O” side is prioritized, and it is possible to prevent the occurrence of troubles when the selection is different between the information processing devices 2.

Second Embodiment By the way, in the first embodiment, each information processing device 2 ...
The description has been given by taking as an example the case in which it is possible to create a bag F that is a subset of, and each is equal. On the other hand, in the present embodiment, as shown in FIG.
A case where 1 includes an information processing device (database management device) 12 that cannot set a subset will be described.

The database system 11 is preferably used when it is composed of information processing devices which are not equal to each other, such as a client-server type database system. The information processing device 2 is realized, for example, as a desktop computer that operates as a server, and the information processing device 12 has a database DB that can be stored in a larger scale than the information processing device 2, such as a mobile information terminal. Realized with a small device.

The information processing device 12 has a structure substantially the same as that of the information processing device 2 shown in FIG.
B is stored as one bag F, and as shown in FIG. 62, the bag F, which is the entire database DB of the information processing device 12, is shared with the bag F of the information processing device 2.

Even in the database system 11 having the above-mentioned configuration, the dirty bit D is compared between the information processing devices 2 and 12 before the content transmission of the tip T during the synchronization processing, and it is determined whether the content transmission is necessary or not. The transmission direction is determined. Here, in the information processing device 2, as in the first embodiment,
Based on the dirty bit D, the tip T that has only been moved can be determined. As a result, the content transmission of the tip T can be reliably suppressed, and the amount of data transmitted during the synchronization processing can be reduced.

Further, also in this embodiment, since the correspondence relation of the tips T is stored in the order of the dirty bits D in both the dirty bit lists LD, the state of the tips T can be grasped with a smaller memory amount. At the same time, it is possible to reduce the amount of data communicated during the synchronization processing.

[0232] As an example of using the database system 11 having the above-mentioned configuration, for example, the information processing device 2 which is installed in a company or the like and serves as a server collectively manages the address information required by all the sales persons, and becomes a portable information terminal. Information processing equipment 12
Can be given to each salesman.
Here, the combination of address information required for each sales person is different from each other, and there are many cases in which a plurality of sales persons have common address information. Therefore, in the information processing device 2, by storing all the address information in the database DB and managing the combination of the address information required for each sales person as the bag F, the information processing device 2 can
For example, unlike the case where the address information for each sales person is stored in another database DB, each address information can be managed without impairing the consistency. Also, the information processing device 1
2 only needs to be able to store one bag F of the information processing device 2, so that the storage capacity can be reduced compared to the case where the entire address information is stored.

In the first and second embodiments, the case where the tip T indicates an individual address has been described as an example. However, the data indicated by the tip T can be freely changed depending on the use of the database. Can be set to. Further, the case has been described as an example where the tips T have the same type of attribute A ... And the tips T having the same sharing partner are collected in the shared bag SF, but the present invention is not limited to this. For example, the shared bag SF may be provided for each combination of the sharing partner and the application. Taking the case where there are applications of address book, electronic book and mail address database as an example, the tip T used in the address book has attributes indicating a name, a telephone number, a mail address, an address and a place of work. ing. The tip T used in the telephone directory has attributes indicating a name and a telephone number, and the tip T of the mail address database is
Has attributes indicating a name and a mail address.
Further, each tip T is collected in the bag F indicating the application used. For example, the tip T used in the telephone book also belongs to the bag F, which indicates the address book.
In this case, if you want to update the entire address book, you can set sharing for the bag F that shows the address book.
When it is desired to change only the bag F of the phone book, the sharing may be set for the bag F and synchronization processing may be performed. In this way, if the bag F is assigned to each application to be used, synchronous processing can be performed for each application.

In the first and second embodiments, the correspondence is stored as the order of dirty bits D, but the order is not limited to this. For example, the corresponding tip T may be specified by information indicating the tip T of the other party such as the tip ID. However, in this case, it is necessary to send not only the dirty bit D but also the tip ID of the other party at the time of synchronization processing, which may increase the amount of data to be communicated.

Further, the tip ID of the partner has a large amount of data as the scale of the database DB of the partner increases. As a result, in particular, as in the second embodiment,
When the information processing device 2 and the information processing device 12 are not equal, it is strongly requested to reduce the memory amount.
In the above, the amount of memory required to store the correspondence becomes larger than that specified in the order of the dirty bit D.

On the other hand, in the first and second embodiments described above, the correspondence relationship between the tips T is the same as the tips T themselves.
Are stored in the order of information related to. Therefore, the correspondence can be stored regardless of the scale of the partner database DB and the storage method of the tip T. As a result, it is possible to reduce the amount of memory required to store the correspondence relationship and to reduce the amount of data transmitted during the synchronization processing, as compared with the case where the information indicating the tip T of the other party is specified.

In the first and second embodiments, the order of the dirty bits D is the dirty bit.
Although stored as a list LD, it is not limited to this. For example, a list indicating the order may be provided separately from the dirty bit list LD, and the dirty bit D and information indicating the order may be stored for each tip T. However, even if the dirty bit D and the order correspond to the same tip T, the dirty bit D and the order are provided for each combination of the own shared bag SF and the partner shared bag SF, and the number of shared partners is the database DB. Often unpredictable at the time of creation. Therefore, it is better to provide the dirty bit D and the order separately from the content itself of the tip T. Therefore, if each of them is stored separately, information indicating the corresponding tip T is needed separately, and the required memory amount increases. Therefore, by storing the correspondence relationship as the order of storing the dirty bit D, the required memory amount can be further reduced.

Further, in each of the above-described embodiments, the dirty bit D is provided for each combination of the own shared bag SF and the partner shared bag SF, but if the asynchronous periods are the same, a plurality of shared bag SFs are provided. Dirty between SF
The bit list LD (dirty bit D) can be shared.

In each of the above-described embodiments, for example, the case where each information processing device 2 (12) is provided with the synchronization processing section 51 has been described. Processing equipment 2
The member that operates only during the period (12) in which communication is possible may be provided in either one. Further, for example, in the synchronization processing unit 51, a portion that detects a collision of the tip T and a portion that determines the priority side may be arranged in different information processing devices 2 (12). If the above members can be formed at the time when communication is possible, the same effect can be obtained.

[0240]

As described above, the database management apparatus according to the first aspect of the present invention includes a subset setting means for setting a subset that is a shared range, and at least the subset when the previous synchronization processing is completed. With respect to the data, state information storage means for storing state information including update information and movement information, and during the asynchronous period, corresponding state information is monitored for each data stored in the state information storage means, This is a configuration including state information updating means for updating each state information.

Therefore, even if the data is moved inside or outside the subset, it exists in the subset both at the time of the previous synchronization processing and at the time of the next synchronization processing, and the contents are updated between both time points. Data that has not been (modified) can be identified with certainty.
As a result, it is possible to reduce the amount of data to be communicated to the other database management apparatus, and to reduce the amount of data processed during the synchronization processing.

As described above, the database management apparatus according to the invention of claim 2 is provided with the synchronization processing means in the configuration of the invention of claim 1, and the synchronization processing means comprises:
For each data set corresponding to each other, the necessity of content transmission of data is determined based on the status information stored in the status information storage means of itself and the information (reception information) received from the counterpart database management device. The determination means is provided.

Therefore, the determination means can determine the necessity of content transmission based on the information having a smaller data amount than the content itself of the data, such as the above-mentioned status information and the presence / absence of update, prior to the data content transmission. . As a result, during synchronization processing,
It is possible to reduce the amount of data transmitted between each database management device and the amount of data processed by each.

As described above, in the database management apparatus according to the third aspect of the present invention, in the configuration of the second aspect of the invention, the determination means performs synchronization processing based on the status information and the received information. This is a configuration including an inside / outside determination synchronization means for determining whether or not the data is arranged within the shared range and updating the status information corresponding to each data set.

With the above arrangement, the synchronization processing means can determine whether or not each piece of data is within the shared range based on a small amount of information. Therefore, it is possible to reduce the amount of data transmitted or processed in the synchronous processing. Further, since the determination result is stored as status information for each data set, it is possible to improve the independence of each determination. As a result, even in a database system in which the synchronization process may be interrupted, The effect that the consistency between the databases can be surely maintained is also achieved.

As described above, in the database management apparatus according to the fourth aspect of the present invention, in the configuration of the second or third aspect of the invention, at least the synchronization unit among the data sets corresponding to each other is synchronized with the determination means. For each data set existing in the shared range after processing, a priority side determination means for determining which data of the data set has priority based on the status information and the reception information, and the priority side determination When the means determines the data to be prioritized, the data content synchronizing means for replacing the content of the non-priority side data with the content of the prioritized data is provided.

Therefore, with a very small amount of data, it is possible to determine the necessity of the priority side determination, the priority side, and the transmission direction when transmitting the data content, and the amount of data to be communicated or processed in the synchronization process. The effect of being able to reduce.

As described above, the database management apparatus according to the invention of claim 5 comprises the priority side determination means and the data content synchronization means of claim 4 in addition to the configuration of the invention of claim 3. The priority side determination means is configured to identify the data set existing in the shared range after the synchronization processing based on the setting by the inside / outside determination synchronization means.

Therefore, as compared with the case where the priority side is judged for all the corresponding data sets, or the case where it is judged whether or not it exists within the shared range, separately from the judgment of the inside / outside judgment synchronization means The effect of being able to shorten.

As described above, the database management device according to the invention of claim 6 stores at least the order of data included in its own shared range, and in the previous synchronization processing, the order of each data is the same. From the previous synchronization process to the next synchronization process, an order storage unit that is set to be the same as the above, and a corresponding order storage unit that stores the corresponding order indicating the last order in the previous synchronization process in the above order. During the asynchronous period, among the order stored by the sequence storage means, the above-mentioned corresponded rank and the order prior to the corresponding rank are retained, and they are newly included in their own shared range during the asynchronous period. The data should be after the above-mentioned corresponded rank,
It is the structure provided with the order management means which manages the order of each data.

In the above configuration, each database management device stores the correspondence as the order of the data stored in itself. Therefore, it is possible to reduce the amount of memory required for storing the correspondence relationship and the amount of calculation at the time of synchronization processing, and to communicate or process at the time of synchronization processing, as compared with the case of storing the correspondence information indicating the data of the other party. This has the effect of reducing the amount of data.

As described above, the database management apparatus according to the invention of claim 7 is provided with the synchronization processing means in the configuration of the invention of claim 6, and the synchronization processing means exists within its own shared range. Data to be added to the shared range of the other party, and the data added to the shared range of the other party in the order The rank stored in the storage means and the rank stored in the other party's order storage means match, and each rank is prior to the rank of the data that is not yet associated,
This is a configuration including additional data associating means for updating at least one of the own and the partner's order storage means, and a corresponding order updating means for updating the corresponding order.

According to the above configuration, even if the data is newly added to the shared range during the asynchronous period due to, for example, new creation or movement into the shared range, the order and the corresponding order are inconsistent. There is an effect that data can be added.

As described above, the database management apparatus according to the invention of claim 8 is, in the configuration of the invention according to claim 6 or 7, included in a rank after the corresponding rank and included in its own shared range. The first order deleting means is provided for deleting the order of the data which is not stored from the order storing means.

Therefore, it is possible to reduce the amount of memory required for storing the sequence, the amount of calculation for managing the sequence, and the amount of data to be communicated or calculated in the next synchronization processing.

In the database management apparatus according to the ninth aspect of the present invention, as described above, in the configuration of the sixth, seventh or eighth aspect of the present invention, among the sequences stored in the sequence storage means during the synchronization processing. Second order deleting means for deleting the order corresponding to the data not included in the shared range of itself or the other party from the respective order storing means.

Therefore, it is possible to reduce the amount of memory required for storing the sequence, the amount of calculation for managing the sequence, and the amount of data to be communicated or calculated in the next synchronization processing.

As described above, the database management apparatus according to the tenth aspect of the invention has the state information storage means and the state information updating means according to the first aspect in the configuration of the invention according to the sixth aspect, the seventh aspect, the eighth aspect, or the ninth aspect. And the order storage means stores the respective order as the order of storing the state information corresponding to each data.

Therefore, as compared with the case where the order and the state information are stored separately, the amount of memory required for the storage can be reduced, and the order of transmitting the state information during the synchronization processing can be easily determined.

As described above, the database management apparatus according to the invention of claim 11 sets a subset in its own database as a shared range shared with the database of the other party in the configuration of the invention of claim 10. The state information includes movement information indicating whether or not the corresponding data has moved inside or outside the subset during the asynchronous period.

Therefore, in addition to the effect of the tenth aspect, similarly to the first aspect, it is possible to identify the data that has moved only, and reduce the amount of data to be communicated or processed during the synchronization processing.

As described above, the database management apparatus according to the twelfth aspect of the invention has the synchronization processing means in the configuration of the invention according to the tenth or eleventh aspect, and the synchronization processing means is the sequence storage means. The configuration is such that the status information of the corresponding data is transmitted in the order according to the stored order.

In the above configuration, during the synchronization processing, the state information is transmitted in the order according to the order stored in the order storage means. Therefore, in the synchronous processing, the correspondence relationship can be transmitted only by transmitting the status information, and the amount of data transmitted or processed between the database management devices can be reduced.

According to a thirteenth aspect of the present invention, there is provided a database management device, wherein data corresponding between a communication means for communicating with the database management device according to the first aspect, a database stored in the database management device and its own database. A database management device having a synchronization processing unit that matches the contents of the above, and as described above, the synchronization processing unit includes each data within its own shared range and each data within the shared range of the other party. Associating means for associating with each other, and for each of the associated data sets, a determining means for determining whether or not it is necessary to transmit the content of the data based on the status information of the partner and the reception information from the database management device of the partner Is provided.

When the other database management apparatus has the configuration of claim 1, the synchronization processing means with the above configuration refers to the status information of the database management apparatus and performs the synchronization processing. Therefore, similarly to the second aspect, it is possible to reduce the amount of data transmitted between the database management devices and the amount of data processed by each in the synchronization process.

As described above, in the database management apparatus according to the fourteenth aspect of the present invention, in the configuration of the first aspect of the invention, whether or not the data arranged outside the subset corresponds to the status information. A corresponding data information storage means for storing the data, a correspondence canceling means for canceling the correspondence between the data determined to be unnecessary by each database management device and the status information during the asynchronous period, and the status information not associated. It is the structure provided with the data deletion means which deletes the content of data.

According to the above configuration, even if each database management device deletes unnecessary data contents to reduce the required memory amount during the asynchronous period, the data whose contents are deleted during the asynchronous period. Can be reliably identified. As a result, without compromising the consistency between each database,
In addition, the data transmission amount in the synchronization processing can be reduced with a relatively small memory amount.

As described above, in the database management apparatus according to the fifteenth aspect of the present invention, in the configuration of the fourteenth aspect of the present invention, the association eliminating means is configured such that the free memory amount of the database management apparatus including itself is previously set. When the threshold value is equal to or lower than the predetermined threshold value, the above correspondence is canceled.

According to the above configuration, the required free memory amount can be secured without unnecessarily increasing the data transfer amount at the time of synchronization processing, as compared with the case where the contents of data are deleted at the time when the association is resolved. Has the effect.

As described above, in the database management apparatus according to the sixteenth aspect of the present invention, in the configuration of the invention according to the fourteenth or fifteenth aspect, the association eliminating means performs the next synchronization processing for the unnecessary data. At this time, the possibility of transferring the data contents from the other party's database management device is estimated and compared, and the association is canceled in order from the data with the lowest possibility.

According to the above configuration, the content of the data can be held during the synchronization processing while the content of the data is likely to be transferred from the database management apparatus of the synchronization processing partner. Therefore, the data transfer during the synchronization processing is possible. The effect is that the amount can be efficiently reduced.

As described above, in the database management apparatus according to the seventeenth aspect of the present invention, in the configuration of the third aspect of the invention, the synchronization processing means includes status information set in the subset by the inside / outside determination synchronization means. When the correspondence with the data is not stored in the corresponding data information storage means, the content of the data corresponding to the data is received from the counterpart database management device.

Therefore, even if the contents of data are deleted by a certain database management device, there is an effect that the consistency between the databases can be restored by the synchronization processing .

[0274] The database management apparatus according to the invention of 請 Motomeko 18, as described above, if the configuration of the invention described in claim 2, the corresponding set of data is determined as existing in the respective shared range to each other, Regardless of the update information of the status information corresponding to the data set,
This is a configuration in which an in-range priority means for giving priority to the content of data existing in the shared range is provided.

According to the above-mentioned structure, the side prioritized in determining the data arrangement and the side prioritized in determining the content of the data can be made to coincide with each other, so that the database is not easily misunderstood by the user. This has the effect of realizing a management device.

As described above, in the database management apparatus according to the nineteenth aspect of the invention, in the configuration of the eighteenth aspect of the invention, the within-range priority means is changed into a subset by the inside / outside determination synchronization means. The configuration is such that the update information of the state information is changed to “without update” and the update information of the state information that has not been changed is changed to “with update”.

According to the above configuration, the within-range priority means updates the movement information with the update of the movement information by the inside / outside determination synchronizing means, and the determination result of each data set is stored as the state information. As a result, even in a database system in which the synchronization process may be interrupted, there is an effect that the consistency between the databases can be reliably maintained.

As described above, the database management apparatus according to the twentieth aspect of the invention is provided with the priority selecting means for selecting whether or not the in-range priority means operates in the configuration of the eighteenth or nineteenth aspect of the invention. It has a structure.

According to the above configuration, it is possible to select whether or not the in-range priority means operates, so that it is possible to make settings according to the preference of the user, and it is possible to realize a database management device that is easier to use. .

[0280] recording medium according to the invention of claim 21 to 23, as described above, a program for realizing the data <br/> database management apparatus according to claim 1, 6 or 1 3, is recorded It is a composition.

Therefore, by executing the program having the above-mentioned configuration on a computer, each of the claims 1 to 6 or.
Others exhibit the same manner as 1 3, while suppressing an increase in the required memory amount, an effect of reducing a database management system the amount of data to be processed in synchronization time can be realized.

[Brief description of drawings]

FIG. 1 shows an embodiment of the present invention and is a block diagram showing a main configuration of an information processing device.

FIG. 2 is a block diagram showing an example of a database system constructed using the information processing device.

FIG. 3 is an explanatory diagram showing a relationship between a tip indicating one piece of data and a balloon that is a population thereof in the information processing device.

FIG. 4 is an explanatory diagram showing a method of storing tips in the information processing device.

FIG. 5 is an explanatory diagram showing a relationship among a tip, a bag, and a database in the information processing device.

FIG. 6 is a diagram illustrating a method of storing tips in the information processing device, and is an explanatory diagram illustrating a tree structure including tips, bags, and a database.

FIG. 7 is an explanatory diagram showing a relationship between a shared bag that is a shared range of an information processing device and a shared bag of another information processing device in the database system.

FIG. 8 is an explanatory diagram showing a tip correspondence and a correspondence storage method in the database system.

FIG. 9 is an explanatory diagram showing a dirty bit list stored in each information processing device in the database system.

FIG. 10 is an explanatory diagram showing an example of storage of movement parameters in dirty bits forming the dirty bit list.

FIG. 11 is an explanatory diagram showing a correspondence relationship of tips when a shared bag of its own is shared with a plurality of shared bags.

FIG. 12 shows the dirty bit
It is explanatory drawing which shows a list.

FIG. 13 is a flowchart showing a schematic operation of the database system.

FIG. 14 is an explanatory diagram showing sharing settings of a balloon fusion type model in the database system.

FIG. 15 is an explanatory diagram showing a synchronization process in the database system.

FIG. 16 is a flowchart illustrating in detail the operation at the time of sharing setting in the database system.

FIG. 17 is a diagram showing a modified example of the database system, and is an explanatory diagram showing sharing settings of the bag capture type model.

FIG. 18 is a diagram showing another modification of the database system, and is an explanatory diagram showing sharing settings for a new balloon model.

FIG. 19 is an explanatory diagram showing changes in dirty bits according to various operations during an asynchronous period in the database system.

FIG. 20 is a flow chart for explaining the details of the operation during the asynchronous period of the database system, and showing a tip content updating process.

FIG. 21 is a flowchart for explaining the operation of the above database system during an asynchronous period in detail and showing a tip insertion process.

FIG. 22 is a flowchart for explaining the operation during the asynchronous period of the database system in detail, and is a flowchart showing a tip discharging process.

FIG. 23 is an explanatory diagram showing a tip correspondence relationship immediately after the end of the synchronization processing in the database system.

FIG. 24 is an explanatory diagram showing a dirty bit list immediately after the end of the synchronization processing in the database system.

FIG. 25 is an explanatory diagram showing a dirty bit list immediately before the next synchronization process in the database system.

FIG. 26 is a flowchart illustrating in detail the operation during synchronization processing in the database system.

FIG. 27 is a diagram for explaining a state during synchronization processing in the above database system.
It is explanatory drawing which shows a bit list.

FIG. 28 is a diagram for explaining another state during synchronization processing in the database system, in which the dirty bit added by another information processing device is its own dirty bit.
It is explanatory drawing which shows the state added to the bit list.

FIG. 29 is a view for explaining still another state during synchronization processing in the database system, in which the dirty bit added by itself is added to the dirty bit list of another information processing device. FIG.

[Fig. 30] Fig. 30 is a diagram for explaining the synchronization processing of the database system, and is an explanatory diagram showing the priority of the dirty bit movement parameter.

FIG. 31 is a diagram for explaining the synchronization processing of the database system, and is an explanatory diagram showing changes in dirty bits.

FIG. 32 is an explanatory diagram for explaining the synchronization processing of the database system, showing the dirty bit list at the end of the inside / outside determination synchronization processing.

FIG. 33 is a diagram for explaining the synchronization processing of the database system, and is an explanatory diagram showing the priority of the update parameter of the dirty bit.

[Fig. 34] Fig. 34 is a diagram for explaining the synchronization processing of the database system, and is an explanatory diagram illustrating changes in the update parameter of the dirty bit.

FIG. 35 is an explanatory diagram for explaining the synchronization processing of the database system, showing the priority side determination by the dirty bit.

FIG. 36 is an explanatory diagram for explaining the synchronization processing of the database system, showing the dirty bit list after the data content synchronization processing.

FIG. 37 is an explanatory diagram for explaining the synchronization processing of the database system, showing the dirty bit list further compressed after the data content synchronization processing.

FIG. 38 is an explanatory diagram illustrating a discussion model for explaining a subject that resolves a tip collision in the database system.

[Fig. 39] Fig. 39 is a diagram illustrating a subject that resolves a tip conflict in the database system, and is an explanatory diagram illustrating a selection resolution model.

FIG. 40 is an explanatory diagram illustrating an automatic resolution model for explaining a subject that resolves a tip conflict in the database system.

FIG. 41 is an explanatory diagram showing a relationship between a tip collision resolution subject and a resolution time in the database system.

FIG. 42 is a flow chart showing an operation at the time of tip conflict resolution in the database system and showing a negotiation resolution model.

FIG. 43 is a flow chart showing an operation when resolving a tip conflict in the database system and showing a client immediate model.

FIG. 44 is a flowchart showing an operation at the time of tip conflict resolution in the database system, and is a flowchart showing an application resolution model.

FIG. 45 is a flowchart illustrating FIG. 44 in more detail.

FIG. 46 is a flowchart showing an operation at the time of tip conflict resolution in the database system, and is a flowchart showing a client delay type model.

FIG. 47 is a flowchart showing an operation at the time of tip conflict resolution in the database system, and is a flowchart showing an automatic resolution type model based on the last update time.

FIG. 48 is an explanatory diagram showing an update status of each tip in the database system.

FIG. 49 is a flowchart showing an operation at the time of tip conflict resolution in the database system, showing a one-side selection model of the automatic resolution model.

FIG. 50 is an explanatory diagram showing downloading in the database system.

FIG. 51 is a flowchart showing an operation at the time of download in the database system.

FIG. 52 is an explanatory diagram showing a case where the association is changed using a copy at the time of a tip collision in the database system.

FIG. 53 is a flowchart showing an operation at the time of changing association using copying in the database system.

FIG. 54 is an explanatory diagram showing a case where the association is changed by using a copy when changing the tip in the database system.

[Fig. 55] Fig. 55 is a flowchart describing in detail the sharing cancellation operation in the database system.

FIG. 56 is an explanatory diagram showing cancellation of sharing of a tip copy type model in the database system.

[Fig. 57] Fig. 57 is a diagram illustrating a modification of the database system and is an explanatory diagram illustrating cancellation of sharing of a tip ubiquitous model.

FIG. 58 is a diagram showing still another modification of the database system, and is an explanatory diagram showing cancellation of sharing of the tip extinction type model.

FIG. 59 is a view showing still another modified example of the above database system, which is a tip uneven distribution type model, and
It is explanatory drawing which shows the cancellation | release of sharing in the case of also erasing an empty bag.

FIG. 60 is a view showing still another modified example of the above database system, which is a tip disappearance model, and
It is explanatory drawing which shows the cancellation | release of sharing in the case of also erasing an empty bag.

[Fig. 61] Fig. 61 is a flowchart showing the operation of compressing the dirty bit list during the asynchronous period, showing still another modification of the database system.

FIG. 62 is a diagram showing another embodiment of the present invention, and is an explanatory diagram showing the relationship among tips, bags and databases shared among information processing devices in a database system.

FIG. 63 is an explanatory diagram showing a method of storing tips in an information processing device that processes the entire database as one bag in the database system.

FIG. 64 is a diagram showing a modified example of the present invention and is an explanatory diagram showing changes in dirty bits according to various operations during an asynchronous period in the database system.

[Fig. 65] Fig. 65 is a diagram for explaining in detail the operation of the above database system during an asynchronous period, illustrating a process for ejecting a tip from a shared bag and canceling the association between the substance of the tip and the dirty bit. It is a flowchart shown.

FIG. 66 is a flowchart for explaining in detail the operation of the above database system during an asynchronous period, and is a flowchart showing a process for canceling the association between the substance of a tip outside the shared bag and the dirty bit. .

FIG. 67 is an explanatory diagram showing a dirty bit list immediately before the next synchronization process in the database system.

[Fig. 68] Fig. 68 is a diagram for explaining the state during synchronization processing in the above database system.
It is explanatory drawing which shows a bit list.

[Fig. 69] Fig. 69 is an explanatory diagram illustrating a state during synchronization processing in the database system, and is a diagram illustrating a dirty bit list at the time when association of each dirty bit is completed.

[Fig. 70] Fig. 70 is an explanatory diagram illustrating an operation during synchronization processing of the database system, and is an explanatory diagram illustrating a dirty bit list at the start point of the inside / outside determination synchronization processing.

71 is an explanatory diagram for explaining the operation during the synchronization processing of the database system, showing the dirty bit list at the end of the inside / outside determination synchronization processing; FIG.

[Fig. 72] Fig. 72 is a diagram illustrating yet another modification of the present invention, and is an explanatory diagram illustrating changes in dirty bits in the inside / outside determination synchronization processing.

[Explanation of symbols]

1/11 Database system 2/12 Information processing equipment (database management device) 21 Communication unit (communication means) 23 Database management unit (database, state information storage means, order storage means, supported order storage means, corresponding data information storage means) ) 24 database processing unit (state information updating means, order managing means, first order deleting means) 32 balloon management unit (subset setting means) 43 tip deleting processing unit (association eliminating means, data deleting means, deletion selecting means) 51 synchronization processing section (synchronization processing means, associating means, determination means, internal / external synchronization processing means, priority side determination means,
(Data content synchronizing means, data adding means, additional data associating means, supported order updating means, first and second order deleting means, range priority means, priority selection means)

─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Tama Kamakura 22-22 Nagaike-cho, Abeno-ku, Osaka City, Osaka Prefecture Sharp Corporation (72) Inventor Fusano Fujita 22-22 Nagaike-cho, Abeno-ku, Osaka City, Osaka Sharp (56) References JP-A-9-134304 (JP, A) JP-A-9-128280 (JP, A) JP-A-8-328931 (JP, A) JP-A-8-241236 (JP, A) JP-A-11-327987 (JP, A) JP-A-11-327989 (JP, A) Shiro Iba, two outsiders, PIM software compatible with 11 product workgroups, including Hello 98 Japanese version, Hello! PC, Japan, SoftBank, May 8, 1998, Volume 5, No. 9, p. 162 ―― 181 (especially 178 ―― 181) Masahiro Nakamura, “Anywhere Office” software environment is set up, Nikkei Electronics, Japan, Nikkei BP, October 10, 1994, No. 619, p. 137 ―― 141 Hiroyuki Hasegawa, PC LAN starting with Windows95, Japan, AI Publishing, April 22, 1996, 1st edition, p. 218 ――226 (58) Fields investigated (Int.Cl. ⁷ , DB name) G06F 12/00 G06F 13/00

Claims (23)

(57) [Claims] 1. To configure a database system having a plurality of database management devices and a synchronization processing means for matching the contents of corresponding data between databases stored in the database management devices which can communicate with each other. In a database management device provided with at least one database, a subset setting means for setting a subset in its own database as a shared range with a counterpart database, and at least the subset at the end of the previous synchronization processing. Update information indicating whether the included data was updated during the asynchronous period from the previous synchronization process to the next synchronization process, and movement indicating whether the data was moved inside or outside the subset during the asynchronous period. Corresponds to a status information storage unit that stores status information including information during an asynchronous period. Status information to monitor each data stored in the status information storage unit, a database management system, characterized by comprising a state information updating means for updating each state information. 2. The synchronization processing means is provided, and the synchronization processing means is associated with associating means for associating each data within its own shared range with each data within the shared range of the other party. For each data set, there is provided determination means for determining whether or not it is necessary to transmit the content of the data, based on the status information stored in its own status information storage means and the information received from the other party database management device. The database management device according to claim 1, wherein 3. The at least one database management device stores in the determining means, for each data set associated with each other, status information indicating that the data set is moved into a subset and currently exists in the subset. If the status information indicates that it is in the subset, and the other database management device notifies that the data that constitutes the data set exists within the shared range. 3. The database management apparatus according to claim 2, further comprising an inside / outside determination synchronization means for setting the status information corresponding to the data set in the subset and setting the status information outside the subset in the case of remaining. . 4. The status information corresponding to the data set indicates update for at least each of the data sets existing in the shared range after the synchronization processing among the data sets corresponding to each other. In the case, and, from the database management device of the other party, when notified of the update of the data forming the data set, a priority side determination means for determining which data of the data set has priority, The data content synchronizing means for replacing the content of the non-priority side data with the content of the prioritized data when the priority side determination means determines the data to be prioritized. 3. The database management device described in 3. 5. The determination means identifies a data set existing in the shared range after the synchronization processing based on the setting by the inside / outside determination synchronization means, and for each of the data sets, a state corresponding to the data set. When the information indicates updating, and when the other party's database management device notifies the updating of the data forming the data set, it is determined which data in the data set has priority. And a data content synchronization means for replacing the content of the non-priority side data with the content of the priority data when the priority side determination means determines the data to be prioritized. The database management device according to claim 3. 6. A database system comprising a plurality of database management devices and a synchronization processing means for matching the contents of corresponding data between the databases stored in the database management devices which can communicate with each other. In a database management device that is provided and has at least one database, at least the order of data included in its shared range is stored, and in the previous synchronization processing, the order of each data is set to be the same as that of the other party. An order storage means, a supported order storage means for storing a supported order indicating the last order in the previous synchronization processing in the above order, and an asynchronous period from the previous synchronization processing to the next synchronization processing, Among the orders stored by the order storage means, the above-mentioned processed order and the order prior to the processed order are retained. In addition, the data newly included in its own shared range during the asynchronous period is provided with an order management unit that manages the order of each data so that it is later than the corresponding order. Database management device. 7. The synchronization processing means is provided, the synchronization processing means communicates with a database management device of a partner storing the database of the partner to perform a synchronization process, and the synchronization processing means has its own sharing. Among the data existing within the range, the data adding means for adding the data stored in the order storage means after the corresponding order to the shared range of the partner and the data added to the shared range of the partner , So that the rank stored in its own order storage means and the rank stored in the other party's order storage means match, and each rank comes before the rank of the data that is not yet associated. , Additional data associating means for updating at least one of the order storing means of itself and the other party, and a completed order updating means for updating the completed order. Database management apparatus according to claim 6. 8. A first order deleting means for deleting, from the order storing means, an order of data which is after the corresponding order and is not included in its own shared range. The database management device according to claim 6 or 7. 9. In the synchronization processing, among the orders stored in the order storage means, the order corresponding to data that is not included in either the shared range of itself or the other party is deleted from the respective order storage means. 9. The database management device according to claim 6, further comprising a second order deleting means for performing the operation. 10. A status information storage means for storing status information including update information indicating whether or not the data included in its shared range at least at the end of the previous synchronization process was updated during the asynchronous period. During the asynchronous period, the corresponding status information is equipped with status information updating means for monitoring each data stored in the status information storing means and updating each status information. The database management device according to claim 6, 7, 8 or 9, wherein each order is stored as an order of storing the status information corresponding to each data. 11. A subset setting means for setting a subset in its own database as a shared range shared with the database of the other party, wherein the status information includes the corresponding data during the asynchronous period. 11. The database management device according to claim 10, further comprising movement information indicating whether the user has moved inside or outside of. 12. The synchronization processing means includes the synchronization processing means, and the synchronization processing means communicates with a database management apparatus of the partner storing the database of the partner to perform the synchronization processing, and the synchronization processing means includes the order storage means. The database management device according to claim 10 or 11, wherein the status information of the corresponding data is transmitted in an order according to the order stored in. 13. At least one database, a communication means for communicating with the database management device according to claim 1, and a database stored in the database management device and its own database are matched in contents of corresponding data. A database management device having synchronization processing means for causing the synchronization processing means to associate the respective data within its own shared range with the respective data within the shared range of the other party. For each of the obtained data sets, a determination unit that determines whether or not it is necessary to transmit the content of the data based on the status information stored in the status information storage unit of the partner and the information received from the database management device of the partner. A database management device characterized by being provided. 14. Corresponding data information storage means for storing whether or not the data arranged outside the subset during the asynchronous period correspond to the status information, and the subset during the asynchronous period. Of the data arranged outside, the correspondence canceling means for canceling the correspondence between the data judged to be unnecessary by each database management device and the status information, and storing it in the corresponding data information storage means; 2. The database management apparatus according to claim 1, further comprising a data deleting unit that deletes the content of the data that is not associated with the data. 15. The association eliminating means eliminates the association when the free memory amount of the database management apparatus including itself becomes equal to or less than a predetermined threshold value. Item 14. The database management device according to Item 14. 16. The association canceling means estimates the possibility of transferring the data content of the unnecessary data from the other database management apparatus at the time of the next synchronization processing, and compares the unnecessary data. 16. The database management device according to claim 14, wherein the association is canceled in order from the data. 17. Corresponding data information storage means for storing whether or not the data arranged outside the subset during the asynchronous period correspond to the data, and the subset during the asynchronous period. Of the data arranged outside, the correspondence canceling means for canceling the correspondence between the data judged to be unnecessary by each database management device and the status information, and storing it in the corresponding data information storage means; Data deletion means for deleting the contents of the data not associated with the synchronization processing means, the correspondence between the status information set in the subset by the inside / outside determination synchronization means and the data is the above correspondence. 4. When not stored in the data information storage means, the content of the data corresponding to the data is received from the counterpart database management device. Placing database management device. 18. The decision means is connected to each of the associated data.
Data sets are stored in their own status information storage means.
Status information and received from the other party's database management device
Based on the information obtained,
If it is determined that it exists within the range,
Regardless of the update information of the corresponding status information,
Of the data content that does not exist within the shared range
Also gives priority to the contents of data existing in the shared range
It is characterized in that priority means within the range is provided.
The database management device according to claim 2. 19. The determination means are associated with each other.
For each data set, move into the subset and
At least one state information indicating that it exists in the minute set
Stored in one database management device, and
And its own status information indicates within the subset, and
Configure the data set from your database management device.
When it is notified that the data that exists is within the shared range
Sets state information corresponding to the data set in the subset.
If there is a residual, set the outside of the subset
The means for providing priority within the range is provided by the means for synchronizing the inside / outside determination.
No update of updated status information changed in subset
Status information that has not been changed.
19. The information according to claim 18, characterized in that the information is changed to "with update".
Database management device listed. 20. Whether or not the in-range priority means operates
Contractor characterized by having priority selection means for selecting
The database management device according to claim 18 or 19. 21. Correspondence among a plurality of databases
Recorded by a program for managing the same data contents
In the recorded medium, the subset setting means and the status information storing means according to claim 1 are provided.
And operating the computer as a means of updating the status information.
A program for recording is recorded
recoding media. 22. Correspondence among a plurality of databases
Recorded by a program for managing the same data contents
The recorded recording medium, the order storage means, the corresponding order storage means, and the order storage means according to claim 6.
And to operate the computer as a sequence management means
A recording medium characterized in that the program of
body. 23. Correspondence among a plurality of databases
Recorded by a program for managing the same data contents
The recorded medium includes the associating means and the determining means according to claim 13.
It operates a computer as a means for processing and communication.
Characteristic that the program for making it recorded
Recording medium.