CN107526629A - A kind of transacter and concurrency control method - Google Patents
A kind of transacter and concurrency control method Download PDFInfo
- Publication number
- CN107526629A CN107526629A CN201610458546.0A CN201610458546A CN107526629A CN 107526629 A CN107526629 A CN 107526629A CN 201610458546 A CN201610458546 A CN 201610458546A CN 107526629 A CN107526629 A CN 107526629A
- Authority
- CN
- China
- Prior art keywords
- data
- affairs
- long
- accessed
- short
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/466—Transaction processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a kind of transacter, transacter is applied to central database server, and transacter includes：Division module, conclude module, access modules.Division module, it is divided into one or more free data and the trailing queuing data of one or more Long routine transfers for the data to be accessed by short affairs；Module is concluded, at least one free data to be included into another suitable Long routine；Access modules, for controlling the trailing queuing data of the one or more of Long routine transfers of the short transactions access, and access suitable trailing queuing datas Long routine transfer, including at least a free data.The present invention also provides a kind of concurrency control method, and transacter provided by the invention and concurrency control method can be good at alleviating the delay phenomenon that XAL agreements occur.
Description
【Technical field】
The present invention relates to control field, more specifically to transacter and concurrency control method.
【Background technology】
Mobile computing environment is compared with traditional DCE based on fixed network, with mobility, frequently
The main feature such as disconnecting and unreliability.The requirement of real-time of move database is higher, so with the short of high priority
The characteristics of affairs can not be postponed by the Long routine of low priority.It can so ensure that all affairs are all timely and reliably perform,
Ensure Radio Network Transaction real-time.And traditional two-phase lock agreement can only meet in general demand for security, real-time demand
It can not meet.
Fig. 1 is the three-decker schematic diagram of mobile distributed real-time database.Top layer is central database server end, real
The now scheduling controlling of all mobile transactions.Intermediate layer is mobile support base station, and transfer mobile transaction, the bottom is mobile client
End, initiate mobile transaction.
To ensure the serializability of the data consistency of Database Systems, data integrity, all affairs, it is necessary to perform simultaneously
Hair control protocol, concurrency control protocol tradition have two steps lock agreement (2PL) and its lock agreement (AL) of profit and its sharp lock agreement of extension
(XAL) rule of con current control, the concept of lock and these three agreements, is briefly described below.
Con current control:When multiple affairs perform data simultaneously, system must make co-ordination so that affairs
Execution is not disturbed by other affairs, ensures the uniformity of data.
Lock:When an affairs need to ensure that when it is completed some form of change will not occur for its data interested,
So it must obtain a lock in the data.
Serializability:Its result inevitable result phase serially performed with some order with them when multiple affairs perform parallel
Together.
Two steps lock agreement (2PL):Agreement is locked using two steps to carry out con current control, to ensure the serializability of affairs.Association
The particular content of view is：(1) before being operated to any one data object, affairs must be obtained to the data object
Lock；(2) after a lock is obtained, affairs no longer obtain any other lock；(3) ensure that any two affairs can not be simultaneously to one
Individual data object holder lock.It is divided into two stages in accordance with the affairs of the agreement, that is, obtains lock stage and release lock stage.But this
Agreement is not suitable for mobile database system, and Long routine can take data for a long time, and other affairs can face delay.
Its lock agreement (AL) of profit:Its lock of profit is the expansion of two steps lock, it is allowed to which several affairs are held to some data object simultaneously
There is lock, that is, introduce " transfer " operation, Long routine can give short transactions access with temporary transfer data.
After affairs T is transferred the possession of to data object a access right, it can continue to obtain new lock, that is, operation of transferring the possession of and lock is
One step, and after data object a is transferred, other affairs are obtained with the lock to it.Such as its sharp lock allows shorter thing
Business T2 obtains data object A and B that T1 has been transferred the possession of lock, so as to concurrently being performed compared with Long routine T1.Meanwhile it is necessary to transfer the possession of operation
Follow following rule：(1) affairs can only transfer the possession of the data object of those holder locks；(2) things can not access any one
The data object that it has been transferred the possession of；(3) unblock operation can not be replaced by transferring the possession of operation, and affairs finally must disposably unlock it
All upper data objects for crossing lock, scheduler program also carry out some constraints to the affairs to accept a delivery acceptance of delivery.Two profits it lock rule such as
Under：1 two affairs of rule can not be simultaneously to a data object holder lock, unless a wherein affairs " are transferred the possession of " and go out this number
According to object.If 2 one affairs Ta of rule are to trail another affairs Tb, then it must trail Tb completely until Tb is performed
First unblock operation.Several concepts of introducing are illustrated below.
Trail affairs：The affairs to accept a delivery acceptance of delivery.
Transfer the possession of affairs：The affairs of assignment data.
Trail：One affairs Ta has pinned the data object that another affairs Tb transfers the possession of (but not unlocking), claims Ta to trail
Tb。
Trail completely：If the data that an affairs Ta is pinned all are that another affairs Tb is transferred the possession of, claim the complete tails of Ta
With Tb.
Free data：One affairs Ta data to be accessed is not that another affairs Tb is transferred the possession of, and this data is freely
Data.
Its lock agreement (XAL) of extension profit:The thought of XAL agreements is dynamically to expand to trail queue, that is, the thing to accept a delivery acceptance of delivery
Business can access the free data transferred the possession of outside affairs, it is not necessary to trail this affairs completely before affairs unblock is transferred the possession of.Receive
The short affairs transferred the possession of, it is necessary to after the complete all data of oneself of transactions access are transferred the possession of, free data could be accessed, and can not be first
Free data are accessed, visit again the data for the trailing queue being transferred, therefore also often have delay sometimes.
Fig. 2 is the exemplary plot of its lock agreement (XAL) of profit.In fig. 2, affairs 1 are Long routines, affairs 2, affairs 3, affairs 4
It is short affairs.Affairs 1 access A, B, C, D, have transferred the possession of A, B and C, have accessed D.Affairs 2 access B and E.Affairs 3 access E
And F, affairs 4 access F and J.If affairs 2 are thought first to access E, B is accessed afterwards, then is waited after having accessed E, is accessed B and be prohibited.This is
Because E is not to trail the data in queue, affairs 2 can only can be allowed access to B after affairs 1 unlock operation.Affairs
2 are blocked in this instance, and therewith, affairs 3 only after affairs 2 perform unblock operation, could access E, so must be blocked.
Fig. 3 is another instance graph of con current control process of its lock agreement (XAL) of profit.In figure 3, Long routine 1, A, B are accessed,
C, D, E.Other data are not intended to access.Long routine 2, access F, G, H, I, J；Short affairs 3, access B, G, K.
Only allow an affairs assignment data in XAL agreements, the simply assignment data of affairs 1 in Fig. 3, the t1 moment, affairs 1
A and B have been accessed, and has been transferred the possession of, affairs 2 have accessed F, and G could not be accessed because rights concerns.At the t2 moment, affairs 3 are
B is accessed, but G can not be accessed, it must trail affairs 1 completely, it is impossible to the data that other affairs 2 are transferred the possession of be accessed, etc. affairs 2 one
After secondary property unblock, affairs 3 could access G.So G could be accessed at the t3 moment, free data K is finally accessed.So postpone
Phenomenon is apparent.
XAL agreements are compared with AL agreements, and delay phenomenon has alleviation, have been widely used in the concurrent of wireless network environment
In control strategy, but delay phenomenon still frequency is higher, it is therefore desirable on this basis, studies a kind of improvement move database
Real-time concurrency control method.
【The content of the invention】
In view of this, the invention provides a kind of concurrency control method, methods described to include：
The short affairs data to be accessed are divided into the tail of one or more free data and one or more Long routine transfers
With queuing data；
At least one free data are included into another suitable Long routine；
The trailing queuing data of the one or more of Long routine transfers of the short transactions access is controlled, and is accessed described suitable
Trailing queuing datas Long routine transfer, including at least a free data of conjunction.
Preferably, in addition to：
When including the free data that can not be included into the suitable Long routine in the free data, the short thing is controlled
Business accesses the trailing queuing data of one or more of Long routine transfers, accesses described suitable Long routine transfer, at least
Include the trailing queuing data of a free data, and access the free data that can not be included into the suitable Long routine.
Preferably, in addition to：
Judge whether the short affairs data to be accessed are locked by other affairs, wherein, other described affairs is except institutes
State the affairs outside one or more Long routines, the suitable Long routine；
When the short affairs data to be accessed not by other described transactional locks timing, judge one or more of length
Whether affairs, the suitable Long routine have accessed the short affairs data to be accessed；
When one or more of Long routines, the suitable Long routine had accessed the short affairs number to be accessed
According to when, control the trailing queuing data of the short one or more of Long routine transfers of transactions access, and access described be adapted to
Trailing queuing datas Long routine transfer, including at least a free data.
Preferably, in addition to：
After the short affairs data to be accessed are unlocked by other affairs, one or more of Long routines, institute are judged
State whether suitable Long routine had accessed the short affairs data to be accessed.
Preferably, in addition to：
When one or more of Long routines, the suitable Long routine do not access the short affairs data to be accessed
When, judge one or more of Long routines, the suitable Long routine whether because rights concerns can not access；
When one or more of Long routines, the suitable Long routine can not access because of rights concerns, by described in
The short affairs data transfer to be accessed gives the short affairs；
Control the data transferred the possession of described in the short transactions access.
Present invention also offers a kind of transacter, the transacter is applied to central database service
Device, including：
Division module, it is divided into one or more free data and one or more length for the data to be accessed by short affairs
The trailing queuing data of affairs transfer；
Module is concluded, at least one free data to be included into another suitable Long routine；
Access modules, for controlling the trailing number of queues of the one or more of Long routine transfers of the short transactions access
According to, and access suitable trailing queuing datas Long routine transfer, including at least a free data.
Preferably, it is described when including the free data that can not be included into the suitable Long routine in the free data
Access modules, it is additionally operable to control the trailing queuing data of the one or more of Long routine transfers of the short transactions access, accesses
Suitable trailing queuing datas Long routine transfer, including at least a free data, and access can not be included into it is described
The free data of suitable Long routine.
Preferably, in addition to：
Judge module, for judging whether the short affairs data to be accessed are locked by other affairs, wherein, it is described its
His affairs are the affairs in addition to one or more of Long routines, the suitable Long routine；
When the short affairs data to be accessed not by other described transactional locks timing, the judge module, be additionally operable to
Judge whether one or more of Long routines, the suitable Long routine have accessed the short affairs data to be accessed；
When one or more of Long routines, the suitable Long routine had accessed the short affairs number to be accessed
According to when, the access modules, be additionally operable to control the trailing queue of the one or more of Long routine transfers of the short transactions access
Data, and access suitable trailing queuing datas Long routine transfer, including at least a free data.
Preferably, the judge module, it is additionally operable to after the short affairs data to be accessed are unlocked by other affairs, sentence
Whether disconnected one or more of Long routines, the suitable Long routine had accessed the short affairs data to be accessed.
Preferably, in addition to：
When one or more of Long routines, the suitable Long routine do not access the short affairs data to be accessed
When, the judge module, it is additionally operable to judge one or more of Long routines, the suitable Long routine whether because authority is asked
Topic can not access；
It is described to return when one or more of Long routines, the suitable Long routine can not access because of rights concerns
Receive module, be additionally operable to the short affairs data transfer to be accessed to the short affairs；
The access modules, it is additionally operable to control the data transferred the possession of described in the short transactions access.
It is long-term that transacter provided by the invention and concurrency control method solve wireless network environment length affairs
It the problem of coexisting, can be good at alleviating the delay phenomenon that XAL agreements occur, meet that the colleague of demand for security improves real-time.
【Brief description of the drawings】
Fig. 1 is the three-decker schematic diagram of mobile Distributed real-time databases.
Fig. 2 is the exemplary plot of its lock agreement (XAL) of profit.
Fig. 3 is the concurrent process instance graph of its lock agreement (XAL) of profit.
Fig. 4 is the applied environment figure of the transacter of the embodiment of the present invention one.
Fig. 5 is the functional block diagram of the transacter of the embodiment of the present invention two.
Fig. 6 is the functional block diagram of the transacter of the embodiment of the present invention three.
Fig. 7 is the flow chart of the concurrency control method of the embodiment of the present invention three.
Fig. 8 is the flow chart of the concurrency control method of the embodiment of the present invention four.
Fig. 9 is the instance graph of the concurrency control method of the embodiment of the present invention five.
Figure 10 is the affairs reinitiation rate performance comparision figure of 2PL agreements, XAL agreements and concurrency control method of the present invention.
Reference：
| Transacter | 10 |
| Division module | 101 |
| Judge module | 103 |
| Conclude module | 105 |
| Access modules | 107 |
【Embodiment】
In order to make the purpose , technical scheme and advantage of the present invention be clearer, it is right below in conjunction with drawings and Examples
The present invention is further elaborated.It should be appreciated that specific embodiment described herein is only to explain the present invention, not
For limiting the present invention.
Referring to Fig. 4, Fig. 4 is the applied environment figure of the transacter of the embodiment of the present invention one.Including mobile client,
Central database server, mobile client is used to produce mobile transaction, by mobile transaction example by network transmission to center
Database server.The affairs pond of central database server receives the mobile transaction of network transmission, and pipe is carried out to mobile transaction
Reason, central database server include to the system that mobile transaction is managed：Transaction pre analysis system, affairs split system,
Transaction distribution system, transacter, transaction results processing system, by the mobile transaction after processing by network transmission to shifting
Dynamic client, completes mobile transaction.
Please refer to fig. 5, Fig. 5 is the functional block diagram of the transacter of the embodiment of the present invention two.Thing shown in Fig. 5
Processing system 10 of being engaged in includes division module 101, concludes module 105, access modules 107, each functional module is carried out below detailed
Explanation.
The data that short affairs to be accessed are divided into one or more free data and one or more long things by division module 101
The short affairs data to be accessed, specifically, can be divided into a free data and one long by the trailing queuing data that business is transferred the possession of
The trailing queuing data of affairs transfer.
Conclude module 105 and at least one free data are included into another suitable Long routine；Specifically, when short affairs will visit
When the data asked are the trailing queuing data of a free data and Long routine transfer, a free data are included into another
In the trailing queuing data of suitable Long routine transfer.
Access modules 107 control the trailing queuing data of short transactions access one or more Long routine transfer, and access suitable
Trailing queuing datas Long routine transfer, including at least a free data of conjunction.Specifically, return when by a free data
When entering in the trailing queuing data of another suitable Long routine transfer, access modules 107 access an original Long routine transfer
Trailing queuing data and suitable trailing queuing datas Long routine transfer, including at least a free data.
Also referring to Fig. 6, Fig. 6 is the functional block diagram of the transacter of the embodiment of the present invention three.Fig. 6 function mould
The mobile transaction processing that block is used to perform in Fig. 4, the transacter 10 shown in Fig. 6 include division module 101, judge module
103rd, module 105, access modules 107 are concluded, each functional module is described in detail below.
The data that short affairs to be accessed are divided into one or more free data and one or more long things by division module 101
The short affairs data to be accessed, specifically, can be divided into a free data and one long by the trailing queuing data that business is transferred the possession of
The trailing queuing data of affairs transfer.
Conclude module 105 and at least one free data are included into another suitable Long routine；Specifically, when short affairs will visit
When the data asked are the trailing queuing data of a free data and Long routine transfer, a free data are included into another
In the trailing queuing data of suitable Long routine transfer.
Access modules 107 control the trailing queuing data of short transactions access one or more Long routine transfer, and access suitable
Trailing queuing datas Long routine transfer, including at least a free data of conjunction.Specifically, return when by a free data
When entering in the trailing queuing data of another suitable Long routine transfer, access modules 107 access an original Long routine transfer
Trailing queuing data and suitable trailing queuing datas Long routine transfer, including at least a free data.
It should be noted that when including the free data that can not be included into suitable Long routine in free data, mould is accessed
Block 107 controls the trailing queuing data of short transactions access one or more Long routine transfer, access it is suitable it is Long routine transfer,
Including at least the trailing queuing data of a free data, and access the free data that can not be included into suitable Long routine.
Judge module 103 judges whether the short affairs data to be accessed are locked by other affairs, wherein, other affairs be except
Affairs outside one or more Long routines, suitable Long routine, when the data that short affairs to be accessed are not by other transactional locks
Regularly, judge module 103 judges whether one or more Long routines, suitable Long routine have accessed the short affairs number to be accessed
According to.When one or more Long routines, suitable Long routine have accessed the too short affairs data to be accessed, access modules 107
Control the trailing queuing data of short transactions access one or more Long routine transfer, and access be adapted to it is Long routine transfer, extremely
Include the trailing queuing data of a free data less.
Judge module 103 after the short affairs data to be accessed are unlocked by other affairs, judge one or more Long routines,
Whether suitable Long routine has accessed the too short affairs data to be accessed.
When one or more Long routines, suitable Long routine do not access the short affairs data to be accessed, judge module 103
Judge one or more Long routines, suitable Long routine whether because rights concerns can not access.When one or more Long routines,
Suitable Long routine concludes the data transfer to be accessed short affairs of module 105 and gives short thing because when rights concerns can not access
Business, access modules 107 control the data of short transactions access transfer.
Refering to Fig. 7, Fig. 7 is the flow chart of the concurrency control method of the embodiment of the present invention three.This method is applied to shown in Fig. 5,6
Transacter 10 in.This method is described in detail below.
In step S700, mobile transaction Ji Fenfashiwuji.
In step s 701, judge whether affairs use XAL agreements.
When affairs are adapted to use XAL agreements, in step S702, con current control is performed using XAL agreements.
When affairs are not suitable for using XAL agreements, in step S703, the number to be accessed short affairs of division module 101
, specifically, can will be short according to the trailing queuing data for being divided into one or more free data and one or more Long routine transfers
The affairs data to be accessed are divided into a free data and the trailing queuing data of a Long routine transfer.
In step S704, conclude module 105 and at least one free data are included into another suitable Long routine；Specifically
Ground, when the data that short affairs to be accessed are the trailing queuing data of a free data and Long routine transfer, by one
Free data are included into the trailing queuing data of another suitable Long routine transfer.
In step S705, access modules 107 control the trailing queue of short transactions access one or more Long routine transfer
Data.
In step S706, access modules 107 access be adapted to it is Long routine transfer, including at least free data
Trail queuing data.Specifically, when a free data are included into the trailing queuing data of another suitable Long routine transfer
When, access modules 107 access the trailing queuing data of an original Long routine transfer and suitable Long routine transfer, at least
Include the trailing queuing data of a free data.
Refering to Fig. 8, Fig. 8 is the flow chart of the concurrency control method of the embodiment of the present invention four.This method is applied to shown in Fig. 5,6
Transacter 10 in.This method is described in detail below.
In step S800, judge module 103 judges whether the short affairs data to be accessed are locked by other affairs, its
In, other affairs are the affairs in addition to one or more Long routines, suitable Long routine.
When the data that short affairs to be accessed by other transactional locks timing, in step S802, judge module 103 wait other
Affairs unlock.
When the data that short affairs to be accessed are not by the timing of other transactional locks, in step S803, judge module 103 judges
Whether one or more Long routines, the suitable Long routine for transferring the possession of trailing queuing data had accessed the trailing number of queues transferred the possession of
According to that is, short affairs data to be accessed.
When one or more Long routines, suitable Long routine have accessed the too short affairs data to be accessed, in step
In S806, access modules 107 control the trailing queuing data of short transactions access one or more Long routine transfer, and access and be adapted to
Trailing queuing datas Long routine transfer, including at least a free data.
When one or more Long routines, suitable Long routine have not visited the short affairs data to be accessed, in step
In S804, whether judge module 103 judges one or more Long routines, suitable Long routine because rights concerns can not access.
When one or more Long routines, suitable Long routine can not access because of rights concerns, module 105 is concluded by the number of Long routine
According to transferring short affairs, and in step S806, access modules 107 control the data of short transactions access transfer.
Refering to Fig. 9, Fig. 9 is the instance graph of the concurrency control method of the embodiment of the present invention five.Fig. 9 includes affairs 1, affairs 2,
Affairs 3, affairs 1 include five data of A, B, C, D, E, and affairs 2 include five data of F, G, H, I, J, and G data is not access transfer
Data G, affairs 3 include tri- data of B, G, K, and affairs 3 are simultaneously as affairs 1 and the trailing affairs of affairs 2, according to Fig. 7,8
Concurrent method is controlled, the trailing queue of two Long routines can be carried out continuously access, and at the t2 moment, affairs 3 have accessed B, connect
Can and access G, finally access free data K, delay phenomenon is eased.In the present invention controls concurrent method, one
Long routine transfers the possession of some data, then assigns free data as the data of another Long routine transfer, allows short affairs can be simultaneously
As two and the trailing affairs of two or more Long routine, it so can largely ensure that short affairs have access to data in time, just
Other affairs will not be blocked.
Figure 10 is the affairs reinitiation rate performance comparision figure of 2PL agreements, XAL agreements and concurrency control method of the present invention.Figure
2PL agreements, AL agreements, the reinitiation rate of concurrency control method of the invention are listed in 10.Legacy protocol is if there is delay
For phenomenon than more serious, central database server will take the strategy for restarting Long routine.Carrying out the performance ratio of reinitiation rate
Compared with when, observed by changing affairs arrival rate.From fig. 10 it can be seen that 2PL agreements, AL agreements, the con current control of the present invention
Effect of the method (concurrency control method abbreviation 2DL methods of the invention) in terms of affairs reinitiation rate is different.Arrived by affairs
Up to rate from when slowly rising to 25 for 5, observing in the case of affairs arrival rate difference, above-mentioned three kinds of agreements are in weight
Different and respective variation tendencies in starting rate, different and respective variation tendency is as shown in the figure.It can be seen that
When affairs arrival rate is from when rising to 25 for 5, the reinitiation rate of 2DL methods and XAL agreements is better than 2PL agreements, and with
The increase of affairs arrival rate, effect of the 2DL methods in terms of reinitiation rate is reduced are more obvious.This is due to that 2DL methods ensure
The correctness of concurrent operations scheduling, avoids all unnecessary affairs and restarts, alleviate delay.
It is long-term that transacter provided by the invention and concurrency control method solve wireless network environment length affairs
It the problem of coexisting, can be good at alleviating the delay phenomenon that XAL agreements occur, meet that the colleague of demand for security improves real-time.
These are only presently preferred embodiments of the present invention, be not intended to limit the invention, it is all the present invention spirit and
All any modification, equivalent and improvement made within principle etc., should be included in the scope of the protection.
Claims (10)
1. a kind of concurrency control method, it is characterised in that methods described includes：
The short affairs data to be accessed are divided into the trailing team of one or more free data and one or more Long routine transfers
Column data；
At least one free data are included into another suitable Long routine；
The trailing queuing data of the one or more of Long routine transfers of the short transactions access is controlled, and is accessed described suitable
Long routine transfer, trailing queuing data including at least the free data.
2. the method as described in claim 1, it is characterised in that also include：
When including the free data that can not be included into the suitable Long routine in the free data, the control short affairs are visited
Ask the trailing queuing data of one or more of Long routine transfers, access it is described it is suitable it is Long routine transfer, comprise at least
The trailing queuing data of one free data, and access the free data that can not be included into the suitable Long routine.
3. the method as described in claim 1, it is characterised in that also include：
Judge whether the short affairs data to be accessed are locked by other affairs, wherein, other described affairs are except described one
Affairs outside individual or multiple Long routines, the suitable Long routine；
When the short affairs data to be accessed not by other described transactional locks timing, judge one or more of long things
Whether business, the suitable Long routine have accessed the short affairs data to be accessed；
When one or more of Long routines, the suitable Long routine had accessed the short affairs data to be accessed
When, the trailing queuing data of the short one or more of Long routine transfers of transactions access is controlled, and access described suitable
Long routine transfer, trailing queuing data including at least a free data.
4. method as claimed in claim 3, it is characterised in that also include：
After the short affairs data to be accessed are unlocked by other described affairs, one or more of Long routines, institute are judged
State whether suitable Long routine had accessed the short affairs data to be accessed.
5. method as claimed in claim 3, it is characterised in that also include：
When one or more of Long routines, the suitable Long routine do not access the short affairs data to be accessed, sentence
Whether one or more of Long routines, the suitable Long routine break because rights concerns can not access；
When one or more of Long routines, the suitable Long routine can not access because of rights concerns, by the short thing
The business data transfer to be accessed gives the short affairs；
Control the data transferred the possession of described in the short transactions access.
6. a kind of transacter, the transacter is applied to central database server, it is characterised in that bag
Include：
Division module, it is divided into one or more free data and one or more Long routines for the data to be accessed by short affairs
The trailing queuing data of transfer；
Module is concluded, at least one free data to be included into another suitable Long routine；
Access modules, for controlling the trailing queuing data of the one or more of Long routine transfers of the short transactions access, and
Access suitable trailing queuing datas Long routine transfer, including at least the free data.
7. transacter as claimed in claim 6, it is characterised in that can not be included into institute when being included in the free data
When stating the free data of suitable Long routine, the access modules, it is additionally operable to control the short transactions access one or more
The trailing queuing data of individual Long routine transfer, access described suitable Long routine transfer, including at least free data
Queuing data is trailed, and accesses the free data that can not be included into the suitable Long routine.
8. transacter as claimed in claim 6, it is characterised in that also include：
Judge module, for judging whether the short affairs data to be accessed are locked by other affairs, wherein, other described things
It is engaged in as the affairs in addition to one or more of Long routines, the suitable Long routine；
When the short affairs data to be accessed not by other described transactional locks timing, the judge module, be additionally operable to judge
Whether one or more of Long routines, the suitable Long routine have accessed the short affairs data to be accessed；
When one or more of Long routines, the suitable Long routine had accessed the short affairs data to be accessed
When, the access modules, it is additionally operable to control the trailing number of queues of the one or more of Long routine transfers of the short transactions access
According to, and access suitable trailing queuing datas Long routine transfer, including at least a free data.
9. transacter as claimed in claim 8, it is characterised in that the judge module, be additionally operable to work as the short thing
After the data to be accessed of being engaged in are unlocked by other described affairs, one or more of Long routines, the suitable Long routine are judged
Whether the short affairs data to be accessed had been accessed.
10. transacter as claimed in claim 8, it is characterised in that also include：
When one or more of Long routines, the suitable Long routine do not access the short affairs data to be accessed, institute
State judge module, be additionally operable to judge one or more of Long routines, the suitable Long routine whether because rights concerns not
It can access；
When one or more of Long routines, the suitable Long routine can not access because of rights concerns, the conclusion mould
Block, it is additionally operable to the short affairs data transfer to be accessed to the short affairs；The access modules, are additionally operable to described in control
The data transferred the possession of described in short transactions access.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610458546.0A CN107526629B (en) | 2016-06-22 | 2016-06-22 | Transaction processing system and concurrency control method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610458546.0A CN107526629B (en) | 2016-06-22 | 2016-06-22 | Transaction processing system and concurrency control method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107526629A true CN107526629A (en) | 2017-12-29 |
| CN107526629B CN107526629B (en) | 2023-04-14 |
Family
ID=60735512
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610458546.0A Active CN107526629B (en) | 2016-06-22 | 2016-06-22 | Transaction processing system and concurrency control method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107526629B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06214847A (en) * | 1993-01-18 | 1994-08-05 | Fuji Xerox Co Ltd | Transaction processing control system |
| WO2001013202A2 (en) * | 1999-08-17 | 2001-02-22 | Progress Software, Inc. | Concurrent commit lock |
| CN1319203A (en) * | 1998-07-22 | 2001-10-24 | 艾利森电话股份有限公司 | Method relating to handling of transactions in databases |
| CN102135980A (en) * | 2010-12-21 | 2011-07-27 | 北京高森明晨信息科技有限公司 | Real-time transaction processing method and device |
| CN103677771A (en) * | 2012-09-06 | 2014-03-26 | 阿里巴巴集团控股有限公司 | Processing method and device for concurrent transactions |
-
2016
- 2016-06-22 CN CN201610458546.0A patent/CN107526629B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06214847A (en) * | 1993-01-18 | 1994-08-05 | Fuji Xerox Co Ltd | Transaction processing control system |
| CN1319203A (en) * | 1998-07-22 | 2001-10-24 | 艾利森电话股份有限公司 | Method relating to handling of transactions in databases |
| WO2001013202A2 (en) * | 1999-08-17 | 2001-02-22 | Progress Software, Inc. | Concurrent commit lock |
| CN102135980A (en) * | 2010-12-21 | 2011-07-27 | 北京高森明晨信息科技有限公司 | Real-time transaction processing method and device |
| CN103677771A (en) * | 2012-09-06 | 2014-03-26 | 阿里巴巴集团控股有限公司 | Processing method and device for concurrent transactions |
Non-Patent Citations (2)
| Title |
|---|
| 万常选: "一种实时数据库系统的多版本两段锁的并发控制协议", 《江西师范大学学报(自然科学版)》 * |
| 曲云尧: "面向对象数据库中并发控制机制的研究与设计", 《复旦学报(自然科学版)》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107526629B (en) | 2023-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3278239B1 (en) | Processing database transactions in a distributed computing system | |
| US20180295034A1 (en) | Techniques for analytics-driven hybrid concurrency control in clouds | |
| EP3058690B1 (en) | System and method for creating a distributed transaction manager supporting repeatable read isolation level in a mpp database | |
| WO2018077073A1 (en) | Distributed database system, transaction processing method, lock server and storage medium | |
| EP0716384B1 (en) | Application-specific conflict resolution for weakly consistent replicated databases | |
| Jing et al. | Distributed lock management for mobile transactions | |
| CN104765840B (en) | A kind of method and apparatus of big data distributed storage | |
| US7209990B2 (en) | Maintain fairness of resource allocation in a multi-node environment | |
| WO2014165160A1 (en) | System and method for performing a transaction in a massively parallel processing database | |
| CN111881223B (en) | Data management method, device, system and storage medium | |
| CN104794190B (en) | The method and apparatus that a kind of big data effectively stores | |
| CN105339899B (en) | For making the method and controller of application program cluster in software defined network | |
| Qin et al. | High performance distributed real-time commit protocol | |
| CN108139927A (en) | The routing based on action of affairs in online transaction processing system | |
| Hellings et al. | Byshard: Sharding in a byzantine environment | |
| CN107526629A (en) | A kind of transacter and concurrency control method | |
| CN111124708B (en) | Microservice-oriented batch reasoning method, server and computer readable storage medium | |
| Enokido et al. | Concurrency control based on significancy on roles | |
| Kumar Madria et al. | A multi-version transaction model to improve data availability in mobile computing | |
| Hamdi et al. | QoS management in real-time spatial big data using a feedback control scheduling | |
| Enokido et al. | Energy-Efficient Role-Based Concurrency Control with Virtual Machines | |
| CN110119427A (en) | Data managing method and Related product | |
| Jayanta et al. | Conflicting management of transactions in real time database system | |
| Cenci et al. | Group mutual exclusion-role processes | |
| Kaur et al. | A Novel Token based DME Algorithm in MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |