JP2003140951A - Transaction simultaneously execution control method and transaction simultaneous execution control device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a transaction simultaneous execution control method and a transaction simultaneous execution control device, capable of inhibiting the operation to a designated object by all of reference transactions and update transactions except the user's own one. SOLUTION: An inquiry execution means 11 causes a transaction simultaneous execution control means 14 to process and execute a request for starting and ending a transaction, and causes a lock management means 13 to execute an exclusive request for all of the other transactions from an inquiry input/output means 21. At the end of the transaction, the transaction simultaneous execution control means 14 instructs the lock management means 13 and a version control means 12 to cancel the management information on that transaction. When operation is requested by a certain transaction, the version control means 12 selects a version corresponding to the transaction to execute the operation.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a transaction concurrency control method and a transaction concurrency control method that allow a plurality of application programs to access a database at the same time as if they were serially executed without interfering with each other. Regarding the control device.

[0002]

2. Description of the Related Art Conventionally, in database systems, management of data transactions (referred to as processing units such as update and reference) by concurrency control is executed. This concurrency control is a control function that guarantees data consistency by performing exclusive control when multiple users try to access the same data in the database system at the same time. Normally, for concurrency control of transactions that access the database,
Locks such as proprietary locks and shared locks on the databases accessed by individual transactions,
Exclusive control is used to make the schedule of transactions executed in parallel serializable. in this way,
In the concurrency control, the consistency of the database to be operated by the user is guaranteed by ensuring the serializability (independence) of execution of multiple transactions. Various methods such as a lock method based on a two-phase rule, an ordering method based on a time stamp, and a multi-version method are known as methods for guaranteeing the serializability of concurrency control.

In the lock method based on the two-phase rule, the database is locked all at once before an operation is performed on the data in a certain transaction, and the lock is unlocked all at once after a predetermined operation to guarantee the possibility of uprighting. . Therefore, in the lock method based on the two-phase rule, an update lock (hereinafter,
When a read operation is performed, a reference lock (hereinafter referred to as an S lock) is secured for each operation target, so that the operation target is reserved before the operation is performed. For example, in the lock method based on the two-phase rule, when a transaction T1 wants to lock a certain type of an operation target, another transaction T0 has already locked a certain type of the operation target. At this time, the lock compatibility between the transactions T0 and T1 is as shown in the table of FIG.

In FIG. 5, ◯ indicates that locks can coexist, and the transaction T1 can lock the operation target in the portion marked with ◯. On the other hand, in FIG. 5, a cross indicates that a lock conflicts, and the transaction T1 suspends execution and waits until the lock causing the conflict is abandoned and the operation target can be locked. Become. If any lock is abandoned in a transaction, the lock is not acquired until the end of the subsequent transactions. At the end of a transaction, any locks held by that transaction that are not abandoned will be relinquished. That is, the two-phase rule transaction is divided into two phases, a process of securing a plurality of locks and a process of releasing the secured locks. This ensures the serializability of transactions.

In the case where different types of operation targets are recognized in a transaction, for example, a database,
To allow operations on tables that make up the database and tuples that make up the table, a multi-grain lock is required.
That is, in the write operation to a certain target, the IX lock and the SIX lock indicating that there is an update intention are secured for the operation target of the higher order, and then the X lock is secured for the operation target. For a read operation to a certain operation target, an IS lock indicating that there is a reference intent is secured for the operation target at a higher level, and then an S lock is secured for the operation target. When these intentional IX lock, SIX lock, and IS lock are added to the lock compatibility between the transactions T0 and T1 shown in FIG. 5,
The table is as shown in FIG. Similar to FIG. 5, in FIG. 6, a circle indicates that locks can coexist, and a cross indicates that locks collide.

In the multi-version method, the write operation is such that the operation target is copied and one is updated, and the state before the update is left in the other one. A copy of a certain operation target is called a version, and a read operation is a means using a lock based on a two-phase rule so that the serializability of one version among a plurality of versions of the operation target is guaranteed. Selected by means of stamped ordering. In the multi-version method using the lock based on the two-phase rule, the write operation secures the X lock for the operation target, and then
The operation target is copied, and the read operation secures the S lock for the operation target and then reads the version before update. If you try to abandon an X lock of a certain target and the target is S-locked by another transaction, the X lock is a guaranteed lock (hereinafter called C lock).
Convert to. For example, in the multi-version method using the lock based on the two-phase rule, when a certain transaction T1 wants to lock a certain type on an operation target, another transaction T0 has a certain type of operation target on the operation target. When locked,
The compatibility of locks between the transactions T0 and T1 is as shown in FIG. Note that in FIG. 7 as well as FIG. 5 and FIG. 6, a circle indicates that locks can coexist, and a cross indicates that locks collide.

On the other hand, in the multi-version method using time stamp ordering, each transaction has a time stamp indicating the start time, and the time when a version is generated for each version is stored as a write time stamp. . Also, among the transactions that referred to the version, the one with the largest time stamp is stored as the read time stamp. Read and write operations on a certain operation target are performed on the version that has a maximum write time stamp before the time stamp of the transaction in which the operation is performed. The version performing the write operation is the latest, the read time stamp must be earlier than the transaction time stamp, and it must not be being updated by another transaction. When such a condition is satisfied, the version is copied to generate a new version and the update is performed. If this condition is not met, the transaction will be aborted. When the version for which the read operation is performed is the latest version and is being updated by the transaction that generated the version, execution of the transaction is suspended and waits until the update is completed.

[0008]

However, when the transactions are classified into a reference transaction that performs only a read operation and an update transaction that performs both read and write operations, if concurrent execution control of transactions is performed by the above-described method, The following inconveniences occur for both transactions. In the lock method based on the two-phase rule, when a large number of reference transactions and a small number of update transactions operate the same target, X due to a small number of update transactions
Due to the lock, the execution of many reference transactions is interrupted and will wait. Further, when the reference transaction refers to the target for a long time, once the reference transaction is started, the update transaction is suspended for a long time and waits.

Further, in the multi-version method using the lock based on the two-phase rule, when a large number of update transactions and a small number of reference transactions operate the same target, the X-lock of the update transaction is converted into a C lock by the small number of reference transactions. And as a result,
It will stop the execution of many update transactions. Furthermore, in the multi-version method using ordering by time stamp, when a certain update transaction updates an operation target for a long time, when a reference transaction that operates the operation target is started, the reference transaction suspends long-term execution. Will be waited for. Also, when a large number of reference transactions and a small number of update transactions operate the same operation target, for example, even if the reference transaction refers to the operation target for a short time, the reference transaction started after the update transaction comes first. There is a high probability that the operation target will be referred to, and as a result, the update transaction will likely be aborted.

In order to prevent such a problem due to interference, there has been proposed a method of performing concurrency control by using different methods in cooperation for each kind of transaction. For example, Concurren
cy Control and Recovery in
Database Systems (Jeffrey
D. Ullman: Computer Science
e Press, Inc. ,: 1988) describes a method of controlling concurrency by using a multi-version method using ordering with a time stamp for a reference transaction and a locking method with a two-phase rule for an update transaction. Further, in Japanese Patent Laid-Open No. 3-123946, simultaneous execution control is performed by using a multi-version method using ordering by a time stamp for a reference transaction and a multi-version method using a lock by a two-phase rule for an update transaction. How to do is described.

The Concurrency Cont
roll and Recovery in Databa
Even if the simultaneous execution control system by the composite system described in se Systems or JP-A-3-123946 is used,
When you perform an operation that requires discarding all versions of a given target, such as discarding a database or adding a column to a table, you need to prohibit operations on that target for all transactions. Sometimes. When performing concurrent execution control by the lock method based on the two-phase rule, it can be prohibited by securing an X lock for a certain object, but when performing concurrent execution control by the above-mentioned two complex methods, the reference transaction and update transaction The interference cannot be eliminated, but it cannot be prohibited. Therefore, an object of the present invention is to make use of the fact that there is no interference between the reference transaction and the update transaction by the concurrency control method by the composite method, and to perform operations on a predetermined target by all reference transactions and update transactions other than itself. A transaction concurrency control method and a transaction concurrency control device that can be prohibited.

[0012]

According to a first aspect of the present invention, a multi-version method that uses ordering by time management for a reference transaction that performs an exclusive resource read operation, and an update that performs a read / write operation of the exclusive resource. In a transaction concurrency control method capable of cooperatively using a lock method based on a two-phase rule for a transaction, a first request for receiving an exclusive request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction is provided. And a second step of creating a plurality of versions that are duplicates of the exclusive resource, and the second step of the reference transaction or the update transaction based on the exclusion request received in the first step. To the above version The third to be managed by the lock operation
And a fourth step of locking the existence of a transaction that refers to or updates a predetermined one of the plurality of versions, and an intention or update of referring to a predetermined one of the plurality of versions. A fifth step of acquiring a lock indicating the existence of an intended transaction, a sixth step of acquiring a lock indicating the existence of a transaction referring to or updating all versions of the plurality of versions, and all versions of the plurality of versions And a seventh step of acquiring a lock indicating the existence of a transaction having the intention of referring to or updating the transaction. In the third step, the fourth step, the fifth step, and the sixth step. Step, any one of the seventh step Tsu based on locks in-flop, by prohibiting operation of the reference transaction or the update transaction, to achieve the above object.

In a second aspect of the present invention, a multi-version method using time-based ordering for a reference transaction that performs an exclusive resource read operation, and a two-phase method for an update transaction that performs an exclusive resource read / write operation In a transaction concurrency control method capable of cooperating with a multi-version method using a lock method according to a rule, a first request for receiving an exclusive request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction is provided. Steps,
A second step of creating a plurality of versions that are duplicates of the exclusive resource; and the creation of the reference transaction or the update transaction in the second step based on the exclusion request received in the first step. Of the plurality of versions, the third step of managing operations on versions with a lock, and
A fourth step of acquiring a lock indicating the existence of a transaction that refers to or updates a predetermined version, and a lock indicating the existence of a transaction that intends to reference or update a predetermined version of the plurality of versions. A fifth step of applying, a sixth step of applying a lock indicating the existence of a transaction that refers to or updates all versions of the plurality of versions, and an intent to refer to or update all versions of the plurality of versions. A seventh step of applying a lock indicating the existence of a transaction, wherein the third step includes the fourth step, the fifth step, the sixth step, and the seventh step. Based on the lock in any one step, By prohibiting the operation by the irradiation transaction or the update transaction,
To achieve the above objectives.

According to the third aspect of the present invention, a multi-version method that uses ordering by time management for a reference transaction that performs an exclusive resource read operation and a two-phase method for an update transaction that performs a read / write operation of the exclusive resource. In a transaction concurrency control device capable of cooperating with a locking method according to a rule, a request receiving unit for receiving an exclusion request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction, Based on the version creating means for creating a plurality of versions that are duplicates and the exclusion request received by the request receiving means, the operation for the version created by the version creating means by the reference transaction or the update transaction is locked. And lock management means for managing by,
First locking means for locking the existence of a transaction that refers to or updates a predetermined version of the plurality of versions, and has an intention of referring to or updating a predetermined version of the plurality of versions A second locking means for locking the existence of a transaction; a third locking means for locking the existence of a transaction that refers to or updates all versions of the plurality of versions; and all versions of the plurality of versions. Fourth lock means for applying a lock indicating the existence of a transaction having an intention to refer to or update, the lock management means including the first lock means, the second lock means, and the third lock means. And any one of the fourth locking means Based on the click, by prohibiting operation of the reference transaction or the update transaction, to achieve the above object.

According to a fourth aspect of the present invention, a multi-version method that uses ordering by time management for a reference transaction that performs an exclusive resource read operation and a two-phase method for an update transaction that performs an exclusive resource read / write operation In a transaction concurrency control device capable of cooperating with a multi-version system using a rule-based lock system, a request receiving unit for receiving an exclusive request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction. A version creating means for creating a plurality of versions that are copies of the exclusive resource; and the version creating means created by the reference transaction or the update transaction based on the exclusive request received by the request receiving means. A lock management unit that manages an operation on a version by a lock; a first locking unit that locks the existence of a transaction that refers to or updates a predetermined one of the plurality of versions; and a predetermined one of the plurality of versions. Second locking means for locking the existence of a transaction that intends to refer to or update one version of the third version, and third locking means for the existence of a transaction that references or updates all versions of the plurality of versions Locking means and a fourth locking means for locking the existence of a transaction having an intention to refer to or update all versions of the plurality of versions, and the lock management means includes the first locking means. Locking means, said second locking means, front Third locking means, on the basis of a lock according to any one of the fourth locking means, by prohibiting operation of the reference transaction or the update transaction,
To achieve the above objectives.

[0016]

BEST MODE FOR CARRYING OUT THE INVENTION Preferred embodiments of the present invention will now be described in detail with reference to FIGS. FIG. 1 is a diagram showing a schematic configuration of a computer system that executes transaction processing. 2 is a diagram showing the software configuration of the transaction processing system. As shown in FIG. 1, the computer system according to the present embodiment includes a server 10 and a server 1.
It is composed of terminals 20a and 20b for transmitting a predetermined processing request to the transaction management system within 0. The terminal 20a20b inputs the inquiry request (predetermined processing request) to the transaction management system (see FIG. 2) executed by the user of the computer system and the inquiry result (processing result for the processing request). PC used for output
A computer such as a (personal computer) or a workstation. As shown in FIG. 1, the terminals 20a, 2
0b is equipped with a pointing device such as a keyboard and a mouse for inputting an inquiry request, and a monitor (display) for displaying an inquiry result. The terminals 20a and 20b each include a CPU (central processing unit), a memory, and a hard disk, and can execute a program by software. In the terminals 20a and 20b, the CPU executes the inquiry request by the inquiry input / output unit 21 of FIG. 2 according to the program stored in the memory.

The server 10 is a computer such as a computer that performs inquiry processing based on an inquiry request input by a user in the terminals 20a and 20b and returns the result to the terminals 20a and 20b. Terminals 20a, 2
0b and the server 10 are connected by a communication network. The server 10 includes a CPU, a memory in which a predetermined processing program is stored, and a hard disk, and can execute the inquiry processing program based on software. The server 10 responds to a predetermined inquiry request from the terminals 20a and 20b.
The transaction management system as shown in FIG. 2 for executing each inquiry process is provided.

As shown in FIG. 2, the transaction management system functions according to a program for optimizing an inquiry stored in a memory, and an inquiry input / output unit 21, an inquiry execution unit 11, and a transaction simultaneous execution control unit 14 are provided. , Version management means 12,
The lock management means 13 is adapted to execute each processing by the CPU. Also, the database file 15
Stores exclusive resources (databases, tables, pages, records, rows, etc.) to be locked,
It is recorded on the hard disk. The communication network is a transmission line that connects the terminals 20a and 20b and the server 10. The communication network is realized by a cable, and TCP / IP is used as a communication protocol. If the communication protocols of the terminals 20a and 20b and the server 10 match, the wireless L that does not use a cable is used.
It may be constructed by a network using AN or broadcast waves.

Next, the function of each program stored as the transaction management system will be described. The inquiry input / output unit 21 includes terminals 20a and 20b.
Accepts inquiry requests from. Then, the received inquiry request is processed and executed by the inquiry execution means 11, and the result is output to the terminals 20a and 20b. The inquiry execution means 11 causes the version management means 12 to process and execute the database operation request from the inquiry input / output means 21, and returns the result to the inquiry input / output means 21. Further, the query execution means 11 causes the transaction concurrency control means 14 to process and execute a transaction start / end request from the query input / output means 21. Further, the inquiry execution means 11 causes the lock management means 13 to process and execute exclusion requests from the inquiry input / output means 21 to all other transactions.

Transaction concurrent execution control means 14
Provides an interface for starting and ending a transaction and an interface for acquiring information about the transaction, for example, the state of the transaction and the start time. Further, the transaction concurrency control means 14 is
The lock management means 13 and the version management means 12 are instructed to discard the management information related to the transaction. The lock management unit 13 uses data in the database file 15, a table storing the data, and a database having a table by using a lock management method such as a two-phase rule locking method, a time stamp ordering method, and a multi-version method. It provides an interface for performing reservation reservation and abandonment of operations for operation targets such as.

The version management means 12 provides an interface for manipulating the data in the database file 15. When an operation is requested by a certain transaction, the version corresponding to this transaction is selected, and the operation for the selected version is executed. For the selection of the version according to the transaction, the multi-version method using the ordering by the time stamp to the reference transaction and the lock method by the two-phase rule for the update transaction cooperate with each other. It is designed to use a complex method. Depending on the necessity of the combined system used, the lock management unit 13 is requested to lock the operation target, and the transaction concurrency control unit 14 is inquired about the information regarding the transaction requesting the operation. Also,
The data in the database file 15 to be operated and the input / output to / from the disk of that version are buffered. The database file 15 stores the data in the database file 15 and the version thereof in a format according to the version management method used by the version management means 12.

Now, a transaction concurrent execution control method in the transaction management system according to this embodiment will be described with reference to FIGS. 3 and 4. In the present embodiment, as the types of locks managed by the lock management means 13, a VS lock indicating that one version is referred to, a VX lock indicating that all versions are updated, and a reference to one version are referred to. Add four more locks, an IVS lock that indicates intent, and an IVX lock that indicates intent to update all versions. As a result, when performing transaction concurrency control in cooperation with the multi-version method using the ordering of the reference transaction by the time stamp and the lock method of the update transaction by the two-phase rule, a certain transaction T1 becomes an operation target. In the case where a certain type of lock is desired for another transaction T0 and another transaction T0 already has a certain type of lock for the operation target, each transaction T0
The lock compatibility between 0 and T1 is as shown in the table of FIG. In FIG. 3, ◯ means that locks can coexist, and x means that locks collide.

Further, when performing simultaneous execution control by cooperating the multi-version method using the ordering of the reference transaction with the time stamp and the multi-version method using the lock on the update transaction by the two-phase rule, a certain transaction is performed. When T1 wants to perform a certain type of lock on an operation target, and another transaction T0 already has a certain type of lock on the operation target, each transaction T0, T
The compatibility of locks between 1 is as shown in the table shown in FIG. Note that, in FIG. 4 as in FIG. 3, ∘ indicates that locks can coexist, and × indicates that locks collide.

When the version management means 12 is requested to refer to or update the data in the database file 15, the version management means 12 causes the lock management means 1 to operate.
3, among the operation targets that can be locked by the lock management unit 13, the IVS lock is applied to a lock target higher than the unit for which the transaction management system provides exclusive access to all transactions, and the VS lock is applied to the lock target in that unit. Try to secure. When the IVS lock and the VS lock can be secured by the lock management means 13, the version management means 12 selects the version to be operated according to the multi-version method according to the type of transaction. If necessary, the version may be generated and then selected.

For example, when the lock management means 13 can lock a database, a table, and a tuple,
Alternatively, when the transaction management system provides exclusive access to all transactions on a database-by-database basis, the version management means 12 locks the database that includes a table having tuples that hold data for reference and update operations. The management means 13 tries to secure the VS lock. Similarly, when the table-based exclusion is provided, the version management means 12 uses the lock management means 1
3, an IVS lock on the database containing the table with tuples holding the data to be manipulated,
Each attempts to secure a VS lock on the tuple holding the data to be manipulated. On the other hand, when the query execution unit 11 is requested to lock all other transactions for a certain lock target, the query execution unit 11 causes the lock management unit 13 to acquire the IVX lock for the higher level lock target. , And try to secure a VX lock for the lock target. When the transaction executing unit 11 is requested to end the transaction, the query executing unit 11
Causes the lock management unit 13 to abandon all locks that have not been abandoned among the locks secured by the transaction to be terminated.

As described above, when a certain transaction requests the operation of certain data, there exists a transaction for which exclusion of all other transactions has been requested for any of the lock items including the data. Then, as shown in FIGS. 3 and 4, the locks that have been attempted to acquire will collide with each other, and execution will be suspended and waited until all the transactions are completed. In addition, when a transaction requests exclusion of all other transactions for a certain lock target, it is included in the transactions that have already requested exclusion of all other transactions for the lock target and above. 3 and 4 when there is a transaction that has manipulated any of the data
As shown in, execution will be suspended and wait until the locks that are trying to acquire collide and all of those transactions are completed.

As described above, in the transaction concurrency control method by the transaction management system according to the present embodiment, the reference transaction for performing only the read operation and the update transaction for performing the read / write operation are executed in a mixed manner, and the reference transaction is executed. When performing concurrent execution control by coordinating the multi-version method using ordering with the time stamp of and the locking method by the two-phase rule for update transactions,
By introducing a lock that operates one version, a lock that operates all versions, and a lock that indicates the intention of the lock, it is possible to prohibit operations on the operation target by all reference and update transactions other than the own transaction. In the transaction concurrency control method by the transaction management system of the present embodiment, there are a multi-version method that uses ordering with a time stamp for a reference transaction and a multi-version method that uses a lock with a two-phase rule for an update transaction. In a database system that performs coordinated concurrency control, by introducing a lock that operates one version, a lock that operates all versions, and a lock that indicates its intention, operation by all reference and update transactions other than itself It is possible to prohibit operations on the target.

[0028]

According to the first aspect of the invention, the third step is based on the lock in any one of the fourth step, the fifth step, the sixth step and the seventh step. , It manages locks, so it is possible to prohibit operations on a target by all reference and update transactions other than itself.

According to the second aspect of the invention, in the third step, the lock is performed based on the lock in any one of the fourth step, the fifth step, the sixth step, and the seventh step. Is managed, it is possible to prohibit operations on a target by all reference and update transactions other than itself.

According to a third aspect of the present invention, the lock management means is based on the lock by any one of the first lock means, the second lock means, the third lock means, and the fourth lock means. Since the operation by the reference transaction or the update transaction is managed, it is possible to prohibit the operation to a certain target by all the reference and update transactions other than itself.

According to a fourth aspect of the present invention, the lock management means is based on the lock by any one of the first lock means, the second lock means, the third lock means and the fourth lock means. Since the operation by the reference transaction or the update transaction is managed, it is possible to prohibit the operation to a certain target by all the reference and update transactions other than itself.

[Brief description of drawings]

FIG. 1 is a diagram showing a schematic configuration of a computer system that executes a transaction process.

FIG. 2 is a diagram showing a software configuration of a transaction processing system.

FIG. 3 is a diagram showing lock compatibility between transactions T0 and T1.

FIG. 4 is a diagram showing compatibility of locks between transactions T0 and T1.

FIG. 5 is a diagram showing lock compatibility between transactions T0 and T1.

FIG. 6 is a diagram showing compatibility of locks between transactions T0 and T1.

FIG. 7 is a diagram showing lock compatibility between transactions T0 and T1.

[Explanation of symbols]

10 servers 20a, 20b terminals

   ─────────────────────────────────────────────────── ─── Continued front page    (72) Inventor Kazushige Asada             1-3-3 Nakamagome, Ota-ku, Tokyo Stocks             Company Ricoh F-term (reference) 5B082 FA17 GB06

Claims (4)

[Claims] 1. A multi-version method that uses time-based ordering for a reference transaction that performs an exclusive resource read operation, and a lock method that uses a two-phase rule for an update transaction that performs an exclusive resource read / write operation. In the method of controlling transaction concurrency that can be used cooperatively, a first step of receiving an exclusion request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction, and a version that is a copy of the exclusive resource A second step of creating a plurality of operations; and a lock management operation for the version created in the second step by the reference transaction or the update transaction, based on the exclusive request received in the first step. Step 3 A fourth step of applying a lock indicating the existence of a transaction that refers to or updates a predetermined one of the plurality of versions, and intends or updates a predetermined one of the plurality of versions A fifth step of acquiring a lock indicating the existence of an intended transaction, a sixth step of acquiring a lock indicating the existence of a transaction referring to or updating all versions of the plurality of versions, and all versions of the plurality of versions And a seventh step of acquiring a lock indicating the existence of a transaction having the intention of referring to or updating the transaction. In the third step, the fourth step, the fifth step, and the sixth step. Step, any one of the seventh step Based on the rock in the flop, transaction concurrency control method characterized by prohibiting the operation by the reference transaction or the update transaction. 2. A multi-version method that uses time-based ordering for a reference transaction that performs an exclusive resource read operation, and a lock method that uses a two-phase rule for an update transaction that performs an exclusive resource read / write operation. In the transaction concurrency control method capable of cooperating with the multi-version method, the first step of receiving an exclusive request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction, the exclusive resource A second step of creating a plurality of versions that are duplicates of the above, and an operation for the version created in the second step by the reference transaction or the update transaction based on the exclusion request received in the first step. The A third step of managing by a lock, a fourth step of locking the existence of a transaction that refers to or updates a predetermined one of the plurality of versions, and a predetermined one of the plurality of versions A fifth step of acquiring a lock indicating the existence of a transaction that intends to refer to or update the transaction, and a sixth step of acquiring a lock indicating the existence of a transaction that refers to or updates all versions of the plurality of versions. A seventh step of acquiring a lock indicating the existence of a transaction having an intention to refer to or update all versions of the plurality of versions, the third step, the fourth step, the 5th step, 6th step, 7th step Based on the lock in any one of the steps of the steps, the transaction concurrency control method characterized by prohibiting the operation by the reference transaction or the update transaction. 3. A multi-version method that uses ordering by time management for a reference transaction that performs an exclusive resource read operation, and a lock method that uses a two-phase rule for an update transaction that performs an exclusive resource read / write operation. In a transaction concurrency control device capable of cooperative use, a request receiving unit that receives an exclusion request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction, and a plurality of versions that are copies of the exclusive resource Based on the version creating means to create, and the exclusive request received by the request receiving means,
The presence of a lock management unit that manages an operation for the version created by the version creation unit by the reference transaction or the update transaction by a lock, and a transaction that references or updates a predetermined one version of the plurality of versions. A first locking unit that locks; a second locking unit that locks the existence of a transaction that intends to refer to or update a predetermined one of the plurality of versions; and all of the plurality of versions Third locking means for locking the existence of a transaction that refers to or updates a version of, and a lock that represents the existence of a transaction that intends to reference or update all versions of the plurality of versions. And a fourth lock means, wherein the lock management means is formed by any one of the first lock means, the second lock means, the third lock means, and the fourth lock means. A transaction concurrency control device for prohibiting an operation by the reference transaction or the update transaction based on a lock. 4. A multi-version method that uses time-based ordering for a reference transaction that performs an exclusive resource read operation, and a lock method that uses a two-phase rule for an update transaction that performs an exclusive resource read / write operation. In a transaction concurrency control device capable of cooperating with the multi-version method, a request receiving unit that receives an exclusion request to a predetermined operation target in the exclusive resource by the reference transaction or the update transaction, and the exclusive resource Version creating means for creating a plurality of versions that are duplicates, and based on the exclusive request received by the request receiving means,
The presence of a lock management unit that manages an operation for the version created by the version creation unit by the reference transaction or the update transaction by a lock, and a transaction that references or updates a predetermined one version of the plurality of versions. A first locking unit that locks; a second locking unit that locks the existence of a transaction that intends to refer to or update a predetermined one of the plurality of versions; and all of the plurality of versions Third locking means for locking the existence of a transaction that refers to or updates a version of, and a lock that represents the existence of a transaction that intends to reference or update all versions of the plurality of versions. And a fourth lock means, wherein the lock management means is formed by any one of the first lock means, the second lock means, the third lock means, and the fourth lock means. A transaction concurrency control device for prohibiting an operation by the reference transaction or the update transaction based on a lock.