CN104252386B - The locking method and equipment of data renewal - Google Patents
The locking method and equipment of data renewal Download PDFInfo
- Publication number
- CN104252386B CN104252386B CN201310259869.3A CN201310259869A CN104252386B CN 104252386 B CN104252386 B CN 104252386B CN 201310259869 A CN201310259869 A CN 201310259869A CN 104252386 B CN104252386 B CN 104252386B
- Authority
- CN
- China
- Prior art keywords
- lock
- locking
- thread
- failure
- wait
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000003860 storage Methods 0.000 claims abstract description 66
- 230000008569 process Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000014759 maintenance of location Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000002253 acid Substances 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000000725 suspension Substances 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Abstract
The application is related to the locking method and equipment of a kind of data renewal of multithreading, wherein, this method can include：It is determined that whether the request locked to the thread to be updated in InnoDB storage engines succeeds；If the locking request failure, judge that described wait locks whether number exceedes predetermined threshold；If described wait lock number to be not above predetermined threshold, create the lock for the failure thread and wait locking；If described wait lock number to exceed predetermined threshold, the locking failure thread scheduling is gone out into InnoDB storage engines and is hashing onto in each bucket；Locking failure thread in identical bucket is sent to InnoDB storage engines to ask to lock in a manner of poll.Using the application, the hot spot data of concurrent update is identified by using the situation of lock competition, so as to be scheduled control to the thread of concurrent update hot spot data, and then optimizes the disposal ability of high concurrent hot spot data renewal.
Description
Technical field
The application is related to data processing field, relates more specifically to what a kind of data renewal for multithreading was handled
Method and apparatus.
Background technology
In calculating field, InnoDB storage engines are one of MySQL database engines, are wherein the most used
A kind of engine, InnoDB storage engines are developed by Innobase Oy companies.InnoDB supports rollback, collapses recovery capability, be more
Version con current control, ACID affairs, the functions such as row level locking are supported, have become MySQL default storage engine.InnoDB is deposited
A pluggable engine of the engine as MySQL is stored up, its support affairs, and carried by the way of Multi version concurrency control
Highly simultaneous access.MySQL InnoDB storage engines are based on row record lock granularity, when to wall scroll record concurrent update, concurrently
Thread be changed into serializing.Due to InnoDB lock design problem, the affairs of each request are caused to be created in InnoDB storage engines
Build a row record lock.When there is a large amount of concurrent thread more new record, the lock object of InnoDB storage engines can be caused very
More, the overhead of huge lock operation causes hydraulic performance decline very serious.Thus, for example, the focus row in high concurrent records
During change, the InnoDB storage engines performances of MySQL database are excessively poor.For example, 16 record performances of 2K concurrent updates have 10k
TPS, but 20 record performances of 2K concurrent updates only have 250 TPS.
For the scene of this focus row record concurrent update, common practice is：
1. identification focus row record is controlled by business side, this requires to identify the row of renewal in service logic.
Intrusion of this way to business is larger, and not general.In addition, under cluster environment, even if business side controls, also having can
Can be very big in the concurrent visit capacity on some database server.
2. being controlled by database layer identification focus row record, this requires that database can identify the work(of focus row in itself
Energy.Similar typical KV (key assignments) storage system, each mark of the operation with current line record.Similar system can will simultaneously
The row record access of hair is controlled by, and the record mutually gone together is placed in identical queue, so as to avoid focus row record concurrent
Measure the problem of excessive.But this method is helpless for non-KV storage systems.
Therefore, it is necessary to the locking method and equipment of a kind of data renewal for multithreading especially Data Concurrent renewal.
By the locking method and equipment, the hot spot data of concurrent update can be identified in InnoDB storage engines and its thread is carried out
Scheduling controlling improves the performance of InnoDB storage engines so as to realize improved locking procedure.
The content of the invention
Therefore, the purpose of the application is to provide the locking technology that a kind of Data Concurrent for multithreading updates, with gram
Take drawbacks described above.
According to the embodiment of the application one side, there is provided a kind of locking method of the data renewal of multithreading, its feature
It is, including：It is determined that whether the request locked to the thread to be updated in InnoDB storage engines succeeds；If described add
Lock request failure, then judge that described wait locks whether number exceedes predetermined threshold；If described wait lock number to be not above predetermined threshold
Value, then create the lock for the failure thread and wait locking；If described wait lock number to exceed predetermined threshold, by described in
Failure thread scheduling is locked to go out InnoDB storage engines and be hashing onto in each bucket；By the locking failure thread in identical bucket
InnoDB storage engines are sent in a manner of poll to ask to lock.
According to embodiments herein, this method may further include：If the locking request success, creates pin
To the successfully lock of thread and perform locking.
According to embodiments herein, this method may further include：Locked performing and the thread of locking is performed
After affairs, release lock.
According to embodiments herein, this method may further include：By the release based on the lock so as to waiting
The locking failure thread of locking is converted into locking state, and renewal waits lock number.
According to embodiments herein, in the method, create the lock for the failure thread and wait the step of locking
Suddenly can also include：Based on the lock created for the failure thread and locking is waited, renewal waits lock number.
According to embodiments herein, in the method, the failure thread scheduling that locks is gone out into InnoDB storage engines
And the step being hashing onto in each bucket further comprises：The cryptographic Hash of lock information based on the failure thread is hashing onto respectively
In individual bucket, the cryptographic Hash of the wherein lock information of the failure thread of identical recordings is identical, so as to be hashing onto in identical bucket.
According to embodiments herein, this method further comprises：By the locking failure thread in different buckets with parallel
Mode is sent to InnoDB storage engines to ask to lock.
According to the embodiment of the application another aspect, there is provided a kind of locking equipment of the data renewal of multithreading, its feature
It is, including：Determining module is asked, the request for determining to lock the thread to be updated in InnoDB storage engines is
No success；Judge module, if failed for the locking request, judge that described wait locks whether number exceedes predetermined threshold；
Creation module is locked, if waiting lock number to be not above predetermined threshold for described, establishment is directed to the lock of the failure thread simultaneously
Wait and locking；Scheduler module, if waiting lock number to exceed predetermined threshold for described, the failure thread scheduling that locks is gone out
InnoDB storage engines are simultaneously hashing onto in each bucket；Delivery module, for the locking in different buckets to be failed into thread with simultaneously
Capable mode is sent to InnoDB storage engines and is sent to the locking failure thread in identical bucket in a manner of poll
InnoDB storage engines are to ask to lock.
Compared with prior art, according to the technical scheme of the application, identified concurrently more by using the situation of lock competition
New hot spot data, so as to be scheduled control to the thread of concurrent update hot spot data, and then optimize high concurrent focus number
According to the disposal ability of renewal.
Brief description of the drawings
Accompanying drawing described herein is used for providing further understanding of the present application, forms the part of the application, this Shen
Schematic description and description please is used to explain the application, does not form the improper restriction to the application.In the accompanying drawings：
Fig. 1 shows the flow chart of the locking method updated according to the Data Concurrent of the multithreading of the embodiment of the present application；With
And
Fig. 2 shows the block diagram of the locking equipment updated according to the Data Concurrent of the multithreading of the embodiment of the present application.
Embodiment
To make the purpose, technical scheme and advantage of the application clearer, below in conjunction with the application specific embodiment and
Technical scheme is clearly and completely described corresponding accompanying drawing.Obviously, described embodiment is only the application one
Section Example, rather than whole embodiments.Based on the embodiment in the application, those of ordinary skill in the art are not doing
Go out under the premise of creative work the every other embodiment obtained, belong to the scope of the application protection.
With reference to figure 1, Fig. 1 shows the stream of the locking method updated according to the Data Concurrent of the multithreading of the embodiment of the present application
Cheng Tu.
At step S110, it is determined that the request locked to the thread to be updated in InnoDB storage engines whether into
Work(.
Specifically, for example, multiple threads carry out concurrent update for same data (for example, same focus row records),
Then the plurality of thread enters InnoDB storage engines, and request locks.Therefore, in InnoDB storage engines, the plurality of line is determined
Whether Cheng Jinhang locking requests succeed.
At step S120, if the locking request fails, judge that described wait locks whether number exceedes predetermined threshold.
Specifically, it is single file due to locking in InnoDB storage engines, if multiple threads are for same focus
Row record carries out concurrent update, then the locking request of most of thread in multiple threads will failure.Therefore, if locking request
Failure, then in the method, it will determine that whether wait lock number exceedes predetermined threshold.
At step S130, if described wait lock number to be not above predetermined threshold, create for the failure thread
Lock and wait locking.In other words, the lock is created, and is waited and is authorized this after the completion of the affairs of holder lock and lock in current thing
Business.
For example, it is assumed that it is N to subscribe threshold value, and assumes there is a thread request success, the thread is in locking, and
There is M thread to be in addition and wait locking state, then it is M to wait lock number, and M is less than or equal to N, and now has a thread request
Lock failure, at this time judge to wait lock number to be not above predetermined threshold, thus for locking failure thread creation lock and
Wait and locking.
At step S130, step can further include：Locking request failure thread is directed to based on creating
Lock and wait locking, renewal waits lock number.In other words, one is often created for the lock of locking request failure thread and is waited
When, wait lock number just add one.
Continue the example above, the thread of request locking failure, which is in, at step S130 waits locking state, therefore will
Locking failure thread suspension, and wait lock number to add 1, so as to which the wait lock number after updating is M+1.
At step S140, if described wait lock number to exceed predetermined threshold, the failure thread scheduling that locks is gone out
InnoDB storage engines are simultaneously hashing onto in each bucket (bucket).
Specifically, for example, continuing the example above, such as yet another thread request locks, and due to having had
Thread lock successfully and affairs in commission, therefore the locking request failure of the thread, judge to wait lock number whether to exceed pre-
Determine threshold value.And it is M+1 now to wait lock number, it is assumed that M+1 is more than N, then judges to wait lock number to exceed predetermined threshold N, therefore
Locking failure thread scheduling is gone out into InnoDB storage engines.Then, the lock information based on locking failure thread is by its Hash
Into each bucket.
At step S150, the locking failure thread in identical bucket is sent to InnoDB storage engines in a manner of poll
To ask to lock.
Specifically, the cryptographic Hash of the lock information based on the failure thread is hashing onto in each bucket, wherein identical recordings
Failure thread lock information cryptographic Hash it is identical, so as to be hashing onto in identical bucket.The failure thread of difference record is due to lock
The cryptographic Hash of information is different, so as to be hashing onto in different buckets.Therefore, the failure line for being hashing onto in identical bucket
It will be sent to InnoDB storages again by the way of poll and draws by journey, such as the thread for identical focus record, this method
Hold up to ask to lock.So as to solve the problems, such as InnoDB storage engines hydraulic performance declines.In addition, in this step, it can also incite somebody to action
Locking failure thread in different buckets is sent to InnoDB storage engines to ask to lock in a parallel fashion.
At step S160, if locking request success, creates the lock for locking successfully thread.
Specifically, when thread request locks, it is in without thread and locks success status, then locking request success, from
And thread creation lock is successfully locked for this, then perform locking.
At step S160, affairs further can also be performed to the thread of locking, after affairs perform completion, release
Lock.In other words, the thread of locking will discharge lock after affairs completion.Then can also be by based on the lock
Release so as to wait the locking of locking failure thread to be converted into locking state, renewal waits lock number.In other words, one is often discharged
When the individual locking request locked and the wait locking failure thread for locking request success thread is converted into locking, so as to
In waiting the thread of locking state to become to lock successfully, so as to wait the thread of locking to reduce one, number is locked by waiting
Subtract one.
In order to more fully understand the present processes, below we lift a specific embodiment so as to more clearly describe
The locking method of the application.
For example, there are 1000 thread concurrent update same records.1000 threads enter in InnoDB storage engines please
Ask locking.For example, the threshold value for setting predetermined wait lock number is 4.
For example, it is assumed that the request of thread 1 locks, and now locked without any thread, therefore, the locking request of thread 1
Success, then create and lock for thread 1, and complete to lock, affairs are in commission.
Assuming that the request of thread 2 locks during this time, it is serial due to locking, and now the state of thread 1 is lock quilt
Occupancy and the executory state of affairs, so the locking request failure of thread 2, therefore flow is waited into step 120
Lock the judgement of number.Because threshold value is 4, it is 0 to wait lock number at present, lock number is waited not less than threshold value, therefore, for failure thread
(thread 2) creates lock, and waits locking, while updates wait lock number.In other words, lock number is waited to add 1, so as to wait lock number
Become 1.
Assuming that thread 3, thread 4, thread 5 also ask to lock as thread 2, also due to the success of the locking request of thread 1, from
And thread 3-5 request also fails, and threshold value is not above 4, therefore also creates lock for thread 3-5, and waits locking,
Lock number is waited also to be updated to 4 simultaneously.
Assuming that the at this moment request of thread 6 locks, also due to locking failure, therefore judge to wait whether lock number exceedes threshold value,
It is 4 to wait lock number now, has equalized to threshold value, therefore will not be directed to failure thread (thread 6) and create and lock and wait.But by line
Journey 6 dispatches out InnoDB storage engines.And it is hashing onto according to the cryptographic Hash of the lock information of thread 6 in bucket.
Similarly, for example, thread 7-10 requests lock and ask to lock failure, and due to waiting lock number to be equal to or more than
Threshold value, therefore thread 7-10 is also scheduled out InnoDB storage engines.Also, due to thread 7-10 and thread 6 both for
Identical record request locks, therefore the cryptographic Hash of their lock information is identical, so as to which they will be hashing onto identical bucket
In.
For the thread 6-10 in bucket, InnoDB storage engines can be turned again to and locked.In order to prevent focus from remembering
The problem of record concurrent update causes to lock failure, at this moment, it is specified that the thread in identical bucket takes polling mode to be sent to InnoDB
Storage engines.Specifically, it is assumed that thread 6-10 is lined up in same bucket successively, and thread 6 is sent back into InnoDB first deposits
Engine is stored up, carries out locking request, if request failure and waiting lock number it being scheduled again still above or equal to threshold value
Go out InnoDB storage engines and return in thread 7-10 bucket, now, thread 6 will be queued in after thread 10, sequentially be waited again
It is secondary to enter InnoDB storage engines.According to putting in order, then thread 7 is sent back into InnoDB storage engines next time, into adding
Lock request, if request, which fails but is to wait for lock number, is less than threshold value, creates and lock for thread 7, and wait locking.According to row
Row order, passes thread 8 back InnoDB storage engines next time, repeats same operation.If the process of poll is more than one
Predetermined cycle, such as all threads all polls are crossed after 10 times, then force all to send back by all threads in bucket
InnoDB storage engines carry out locking request.
More than on multiple threads for same hot spot data concurrent update be only that the optional of the application is shown in each paragraph
Example, the application not limited to this, but can be applicable to any Data Concurrent renewal.
So far, it has been described that the flow chart of the locking method of the Data Concurrent renewal of the multithreading of the embodiment of the present application.
According to embodiments herein, the locking equipment 200 that a kind of Data Concurrent of multithreading updates also is provided, such as Fig. 2
Shown, Fig. 2 is the structured flowchart of the locking equipment updated according to the data of the multithreading of the embodiment of the present application.The equipment can wrap
Include：Ask determining module 210, judge module 220, lock creation module 230, scheduler module 240 and delivery module 250.
According to the equipment of the embodiment of the present application, request receiving module can be used for receiving to will be more in InnoDB storage engines
The request that new thread is locked.If judge module can be used for the locking request failure, judge that described wait is locked
Whether number exceedes predetermined threshold.If the first lock creation module, which can be used for the wait lock number, is not above predetermined threshold,
Create the lock for the failure thread and wait locking.If scheduler module can be used for the wait lock number and exceed predetermined threshold
Value, then the locking failure thread scheduling is gone out into InnoDB storage engines and be hashing onto in each bucket.Delivery module can be with
For the locking failure thread in identical bucket to be sent into InnoDB storage engines in a manner of poll to ask to lock.
According to the equipment of the embodiment of the present application, lock creation module 230 can be further used for：If the locking request into
Work(, then create and be directed to the successfully lock of thread and perform locking.
According to the equipment of the embodiment of the present application, lock creation module 230 may further include lock release submodule, and it can be with
For after execution locks and performs affairs to the thread of locking, release to be locked.
According to the equipment of the embodiment of the present application, the lock creation module 230 may further include renewal submodule, be used for
By the release based on the lock so as to wait the locking of locking failure thread to be converted into locking state, renewal waits lock number.
Turn i other words often discharging the locking request locked and wait a locking failure thread for locking request success thread
When changing locking into, lock number is waited just to subtract one.
According to the equipment of the embodiment of the present application, lock creation module 230 can also include：Submodule is updated, for based on wound
Build the lock for locking request failure thread and wait locking, renewal waits lock number, in other words, often creates one and is directed to
When the lock of the locking request failure thread and wait, lock number is waited just to add one.
According to the equipment of the embodiment of the present application, scheduler module 240 may further include Hash submodule, for based on institute
The cryptographic Hash for stating unsuccessfully the lock information of thread is hashing onto in each bucket, wherein the Hash of the lock information of the failure thread of identical recordings
Be worth it is identical, so as to be hashing onto in identical bucket.
According to the equipment of the embodiment of the present application, delivery module 250 can be further configured to the locking in different buckets
Failure thread is sent to InnoDB storage engines to ask to lock in a parallel fashion.
By the function that the equipment of the present embodiment is realized essentially corresponds to the embodiment of the method shown in earlier figures 1, therefore originally
Not detailed part, may refer to the related description in previous embodiment, will not be described here in the description of embodiment.
In a typical configuration, computing device includes one or more processors (CPU), input/output interface, net
Network interface and internal memory.
Internal memory may include computer-readable medium in volatile memory, random access memory (RAM) and/or
The forms such as Nonvolatile memory, such as read-only storage (ROM) or flash memory (flashRAM).Internal memory is showing for computer-readable medium
Example.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer-readable instruction, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase transition internal memory (PRAM), static RAM (SRAM), moved
State random access memory (DRAM), other kinds of random access memory (RAM), read-only storage (ROM), electric erasable
Programmable read only memory (EEPROM), fast flash memory bank or other memory techniques, read-only optical disc read-only storage (CD-ROM),
Digital versatile disc (DVD) or other optical storages, magnetic cassette tape, the storage of tape magnetic rigid disk or other magnetic storage apparatus
Or any other non-transmission medium, the information that can be accessed by a computing device available for storage.Define, calculate according to herein
Machine computer-readable recording medium does not include temporary computer readable media (transitory media), such as data-signal and carrier wave of modulation.
It should also be noted that, term " comprising ", "comprising" or its any other variant are intended to nonexcludability
Comprising so that process, method, commodity or equipment including a series of elements not only include those key elements, but also wrapping
Include the other element being not expressly set out, or also include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the key element limited by sentence "including a ...", it is not excluded that wanted including described
Other identical element also be present in the process of element, method, commodity or equipment.
It will be understood by those skilled in the art that embodiments herein can be provided as method, system or computer program product.
Therefore, the application can be using the embodiment in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Form.Deposited moreover, the application can use to can use in one or more computers for wherein including computer usable program code
The shape for the computer program product that storage media is implemented on (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
Embodiments herein is the foregoing is only, is not limited to the application.For those skilled in the art
For, the application can have various modifications and variations.All any modifications made within spirit herein and principle, it is equal
Replace, improve etc., it should be included within the scope of claims hereof.
Claims (13)
- A kind of 1. locking method of the data renewal of multithreading, it is characterised in that including：It is determined that whether the request locked to the thread to be updated in InnoDB storage engines succeeds；If the locking request failure, judge to wait whether lock number exceedes predetermined threshold；If described wait lock number to be not above predetermined threshold, create the lock for the failure thread and wait locking；If it is described wait lock number exceed predetermined threshold, by it is described lock failure thread scheduling go out InnoDB storage engines and by It is hashing onto in each bucket；Locking failure thread in identical bucket is sent to InnoDB storage engines to ask to lock in a manner of poll.
- 2. according to the method for claim 1, it is characterised in that further comprise：If the locking request success, establishment are directed to the successfully lock of thread and perform locking.
- 3. according to the method for claim 2, it is characterised in that further comprise：Locked and to the thread of locking performing After performing affairs, release lock.
- 4. according to the method for claim 3, it is characterised in that also include：By the release based on the lock so as to waiting The locking failure thread of locking is converted into locking state, and renewal waits lock number.
- 5. according to the method described in claim any one of 1-4, it is characterised in that create the lock for the failure thread and wait The step of to be locked, also includes：Based on the lock created for the failure thread and locking is waited, renewal waits lock number.
- 6. according to the method described in claim any one of 1-4, it is characterised in that the failure thread scheduling that locks is gone out The InnoDB storage engines and step being hashing onto in each bucket further comprises：The cryptographic Hash of lock information based on the failure thread is hashing onto in each bucket, wherein the lock of the failure thread of identical recordings The cryptographic Hash of information is identical, so as to be hashing onto in identical bucket.
- 7. according to the method described in claim any one of 1-4, it is characterised in that further comprise：Locking failure thread in different buckets is sent to InnoDB storage engines to ask to lock in a parallel fashion.
- A kind of 8. locking equipment of the data renewal of multithreading, it is characterised in that including：Ask determining module, for determine the request that is locked to the thread to be updated in InnoDB storage engines whether into Work(；Judge module, if for the locking request failed, judge to wait whether lock number exceedes predetermined threshold；Creation module is locked, if waiting lock number to be not above predetermined threshold for described, is created for the failure thread Lock and wait locking；Scheduler module, if waiting lock number to exceed predetermined threshold for described, the failure thread scheduling that locks is gone out InnoDB storage engines are simultaneously hashing onto in each bucket；Delivery module, for by different buckets locking failure thread be sent in a parallel fashion InnoDB storage engines and Locking failure thread in identical bucket is sent to InnoDB storage engines to ask to lock in a manner of poll.
- 9. equipment according to claim 8, it is characterised in that if the lock creation module is further used for the locking Ask successfully, then create and be directed to the successfully lock of thread and perform locking.
- 10. equipment according to claim 9, it is characterised in that the lock creation module further comprises：Lock release submodule Block, for after execution locks and performs affairs to the thread of locking, release to be locked.
- 11. equipment according to claim 10, it is characterised in that the lock creation module also includes renewal submodule, uses In by the release based on the lock, so as to wait the locking of locking failure thread to be converted into locking state, renewal waits lock number.
- 12. according to the equipment described in claim any one of 8-11, it is characterised in that the lock creation module also includes renewal Module, for based on creating the lock for being directed to the failure thread and waiting locking, renewal to wait lock number.
- 13. according to the equipment described in claim any one of 8-11, it is characterised in that scheduler module further comprises：Hash submodule, the cryptographic Hash for the lock information based on the failure thread is hashing onto in each bucket, wherein identical note The cryptographic Hash of the lock information of the failure thread of record is identical, so as to be hashing onto in identical bucket.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310259869.3A CN104252386B (en) | 2013-06-26 | 2013-06-26 | The locking method and equipment of data renewal |
| HK15103347.7A HK1202938A1 (en) | 2013-06-26 | 2015-04-02 | Locking method for data update and device thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310259869.3A CN104252386B (en) | 2013-06-26 | 2013-06-26 | The locking method and equipment of data renewal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104252386A CN104252386A (en) | 2014-12-31 |
| CN104252386B true CN104252386B (en) | 2017-11-21 |
Family
ID=52187321
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310259869.3A Active CN104252386B (en) | 2013-06-26 | 2013-06-26 | The locking method and equipment of data renewal |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104252386B (en) |
| HK (1) | HK1202938A1 (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9715416B2 (en) * | 2015-06-03 | 2017-07-25 | Intel Corporation | Adaptive queued locking for control of speculative execution |
| CN107239474B (en) * | 2016-03-29 | 2021-05-04 | 创新先进技术有限公司 | Data recording method and device |
| CN106681809A (en) * | 2016-12-05 | 2017-05-17 | 上海斐讯数据通信技术有限公司 | Lock-based thread management method and lock-based thread management device |
| CN108345495A (en) * | 2017-01-22 | 2018-07-31 | 北京国双科技有限公司 | A kind of locking method and server of multithreading |
| CN109388645B (en) * | 2017-08-11 | 2023-02-24 | 腾讯科技（深圳）有限公司 | Instruction execution method, instruction execution device, and storage medium |
| CN112231131A (en) * | 2020-09-28 | 2021-01-15 | 北京金山云网络技术有限公司 | Method, device and equipment for realizing database lock and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7428539B2 (en) * | 2004-06-21 | 2008-09-23 | Microsoft Corporation | Method, system, and apparatus for managing access to a data object |
| CN101615203A (en) * | 2009-07-23 | 2009-12-30 | 中兴通讯股份有限公司 | Concurrency control method and device |
| CN102385588A (en) * | 2010-08-31 | 2012-03-21 | 国际商业机器公司 | Method and system for improving performance of data parallel insertion |
| CN102722449A (en) * | 2012-05-24 | 2012-10-10 | 中国科学院计算技术研究所 | Key-Value local storage method and system based on solid state disk (SSD) |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7461065B2 (en) * | 2006-01-31 | 2008-12-02 | International Business Machines Corporation | Method and system for utilizing shared numeric locks |
-
2013
- 2013-06-26 CN CN201310259869.3A patent/CN104252386B/en active Active
-
2015
- 2015-04-02 HK HK15103347.7A patent/HK1202938A1/en unknown
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7428539B2 (en) * | 2004-06-21 | 2008-09-23 | Microsoft Corporation | Method, system, and apparatus for managing access to a data object |
| CN101615203A (en) * | 2009-07-23 | 2009-12-30 | 中兴通讯股份有限公司 | Concurrency control method and device |
| CN102385588A (en) * | 2010-08-31 | 2012-03-21 | 国际商业机器公司 | Method and system for improving performance of data parallel insertion |
| CN102722449A (en) * | 2012-05-24 | 2012-10-10 | 中国科学院计算技术研究所 | Key-Value local storage method and system based on solid state disk (SSD) |
Also Published As
| Publication number | Publication date |
|---|---|
| HK1202938A1 (en) | 2015-10-09 |
| CN104252386A (en) | 2014-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104252386B (en) | The locking method and equipment of data renewal | |
| US8984085B2 (en) | Apparatus and method for controlling distributed memory cluster | |
| KR101959153B1 (en) | System for efficient processing of transaction requests related to an account in a database | |
| US6678802B2 (en) | Method and apparatus for controlling access by a plurality of concurrently operating processes to a resource | |
| US8930584B2 (en) | System and method for providing a linearizable request manager | |
| US9830189B2 (en) | Multi-threaded queuing system for pattern matching | |
| JP4963018B2 (en) | Scheduling method and scheduling apparatus | |
| EP3230860B1 (en) | Technologies for efficient synchronization barriers with work stealing support | |
| CN104065636B (en) | Data processing method and system | |
| CN107273195A (en) | A kind of batch processing method of big data, device and computer system | |
| CN103729480A (en) | Method for rapidly finding and scheduling multiple ready tasks of multi-kernel real-time operating system | |
| CN103914399A (en) | Disk cache method and device in parallel computer system | |
| US9110715B2 (en) | System and method for using a sequencer in a concurrent priority queue | |
| CN106708608A (en) | Distributed lock service method and acquisition method, and corresponding device | |
| US9747323B1 (en) | Method for reconstruction of a distributed lock state after a node addition or removal using a consistent hash | |
| CN114721594A (en) | Distributed storage method, device, equipment and machine readable storage medium | |
| CN110795234A (en) | Resource scheduling method and device | |
| US11023493B2 (en) | Intelligently scheduling resynchronization jobs in a distributed object-based storage system | |
| CN116719646A (en) | Hot spot data processing method, device, electronic device and storage medium | |
| US20230105953A1 (en) | Systems and methods for object migration in storage devices | |
| CN115202842A (en) | Task scheduling method and device | |
| CN111814007B (en) | Method, device and equipment for processing data of doubly-linked list and machine-readable storage medium | |
| CN114816687A (en) | Cluster resource control method and device and storage medium | |
| Shah et al. | “Saksham Model” Performance Improvisation Using Node Capability Evaluation in Apache Hadoop | |
| US9378045B2 (en) | System and method for supporting cooperative concurrency in a middleware machine environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1202938 Country of ref document: HK |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1202938 Country of ref document: HK |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20191205 Address after: P.O. Box 31119, grand exhibition hall, hibiscus street, 802 West Bay Road, Grand Cayman, Cayman Islands Patentee after: Innovative advanced technology Co., Ltd Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Patentee before: Alibaba Group Holding Co., Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210129 Address after: 801-10, Section B, 8th floor, 556 Xixi Road, Xihu District, Hangzhou City, Zhejiang Province Patentee after: Ant financial (Hangzhou) Network Technology Co.,Ltd. Address before: P.O. Box 31119, grand exhibition hall, hibiscus street, 802 West Bay Road, Grand Cayman, Cayman Islands Patentee before: Innovative advanced technology Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210903 Address after: 100020 unit 02, 901, floor 9, unit 1, building 1, No.1, East Third Ring Middle Road, Chaoyang District, Beijing Patentee after: Beijing Aoxing Beisi Technology Co., Ltd Address before: 801-10, Section B, 8th floor, 556 Xixi Road, Xihu District, Hangzhou City, Zhejiang Province 310000 Patentee before: Ant financial (Hangzhou) Network Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right |