CN109522136A - It is a kind of to resist concurrent method for writing data and system - Google Patents
It is a kind of to resist concurrent method for writing data and system Download PDFInfo
- Publication number
- CN109522136A CN109522136A CN201811265135.5A CN201811265135A CN109522136A CN 109522136 A CN109522136 A CN 109522136A CN 201811265135 A CN201811265135 A CN 201811265135A CN 109522136 A CN109522136 A CN 109522136A
- Authority
- CN
- China
- Prior art keywords
- data
- queue
- mark reaction
- message queue
- reaction message
- 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.)
- Pending
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/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
Abstract
Resist concurrent method for writing data and system the invention discloses a kind of, the method includes in peak hours/period, the data received are classified according to urgency level, according to classification results, to data allocation priority, according to the priority order of distribution and the type of service of data, data are stored in Mark reaction message queue, when detecting the Mark reaction message queue there is no identical services type and lead to data storage failure, rejection fails the data being stored in Mark reaction message queue, and it is fed back to corresponding data source, in non-peak hours/period, the data stored in Mark reaction message queue are read and are written in database.The load of peak hours/period server is greatly reduced in the present invention, while can guarantee that database can be written in important data.The present invention is widely used in information technology field.
Description
Technical field
The present invention relates to information technology fields, especially a kind of to resist concurrent method for writing data and system.
Background technique
Network service end will receive a large amount of access in peak busy period, need that a large amount of data are written to server.
The hardware resource of server is limited, is easy to collapse because of data-handling capacity deficiency when amount of access is excessive, it is therefore desirable to mating
Good anti-Concurrent Algorithms.But existing anti-Concurrent Algorithms are excessively complicated, especially the anti-Concurrent Algorithms of mainstream, basic principle
It is data balancing to be assigned to multiple standby servers, therefore the prior art is based on being provided with multiple servers, firmly
Part input cost is high, although can achieve the purpose that resist concurrent, the work effect of single hardware device using multiple servers
Rate is not high.
Summary of the invention
In order to solve the above-mentioned technical problem, a kind of resist concurrent method for writing data the object of the invention is that providing and be
System.
First technical solution adopted by the present invention is:
It is a kind of to resist concurrent method for writing data, comprising the following steps:
In peak hours/period, the data received are classified according to urgency level；The peak hours/period refers to that load reaches
The period of preset value or preset period；
According to classification results, to data allocation priority；
Data are stored in corresponding Mark reaction by the type of service of the priority order and data that are assigned to according to data
Message queue；The Mark reaction message queue has corresponding type of service, and the Mark reaction message queue is identical for receiving
The data of type of service；
When detecting the Mark reaction message queue there is no identical services type and lead to data storage failure, refusal is connect
The data for failing to be stored in Mark reaction message queue are received, and are fed back to corresponding data source；
In non-peak hours/period, the data stored in Mark reaction message queue are read and are written in database.
Further, the method also includes following steps:
In non-peak hours/period, to the request for being rejected the corresponding data source of received data and issuing the data that retransfer；
The data received are written in database.
Further, the quantity of the Mark reaction message queue is multiple, and each Mark reaction message queue corresponds to different excellent
First weigh, each Mark reaction message queue be respectively configured as it is readable can WriteMode, reading mode or only WriteMode.
Further, the priority order according to distribution, the step for data are stored in Mark reaction message queue,
It specifically includes:
Each Mark reaction message queue is scanned, matching queue is therefrom found out and the storage for detecting matching queue is empty
Between；The matching queue is made of the one or more in each Mark reaction message queue, the matching queue and data to be stored
With equal priority sequence；
When the memory space for judging the matching queue is enough to store data to be stored completely, then data to be stored are copied
Shellfish is into the matching queue, conversely, data to be stored are then resolved into first part and second part, then by first part
It copies in the matching queue, copies second part Mark reaction message queue of the priority order inferior to matching queue to
In；Wherein, the first part take up space with matching the memory space of queue it is equal.
Further, described copy second part in Mark reaction message queue of the priority order inferior to matching queue to
The step for, it specifically includes:
Each Mark reaction message queue is scanned, secondary queue is therefrom found out and detects the storage sky of secondary queue
Between；The secondary queue is made of the one or more in each Mark reaction message queue, the priority order of the secondary queue
Than the priority order time level-one for matching queue；
When the memory space for judging the secondary queue is enough to store the second part completely, then second part is copied
Shellfish is into the secondary queue, conversely, second part is then resolved into first unit and second unit, the first unit is accounted for
Equal with the secondary memory space of queue according to space, the second unit is rest part of the second part in addition to first unit,
Then first unit is copied in the matching queue, copies second unit to card that priority order is inferior to secondary queue
In husband's card message queue.
Second technical solution adopted by the present invention is:
It is a kind of to resist concurrent data writing systems, comprising:
Data staging module, for being classified to the data received according to urgency level in peak hours/period；It is described numerous
Busy periods refer to that load reaches the period or preset period of preset value；
Priority allocation module is used for according to classification results, to data allocation priority；
Mark reaction message queue module, the type of service of the priority order and data that are assigned to according to data will count
According to being stored in corresponding Mark reaction message queue；The Mark reaction message queue has corresponding type of service, the Mark reaction
Message queue is used to receive the data of identical services type；
Data refuse module, when detect there is no identical services type Mark reaction message queue and cause data to be stored
When failure, rejection fails the data being stored in Mark reaction message queue, and is fed back to corresponding data source；
Data write. module, in non-peak hours/period, the data stored in Mark reaction message queue being read and being written
Into database.
Further, the system also includes module is re-requested, the re-request module is used in non-peak hours/period,
To the request for being rejected the corresponding data source of received data and issuing the data that retransfer；The Data write. module be also used to by
The data received are written in database.
Further, the quantity of the Mark reaction message queue is multiple, and each Mark reaction message queue corresponds to different excellent
First weigh, each Mark reaction message queue be respectively configured as it is readable can WriteMode, reading mode or only WriteMode.
Further, the Mark reaction message queue module includes the first submodule, and first submodule is specifically used for:
Each Mark reaction message queue is scanned, matching queue is therefrom found out and the storage for detecting matching queue is empty
Between；The matching queue is made of the one or more in each Mark reaction message queue, the matching queue and data to be stored
With equal priority sequence；
When the memory space for judging the matching queue is enough to store data to be stored completely, then data to be stored are copied
Shellfish is into the matching queue, conversely, data to be stored are then resolved into first part and second part, then by first part
It copies in the matching queue, copies second part Mark reaction message queue of the priority order inferior to matching queue to
In；Wherein, the first part take up space with matching the memory space of queue it is equal.
Further, the Mark reaction message queue module further includes second submodule, and the second submodule is specifically used
In:
Each Mark reaction message queue is scanned, secondary queue is therefrom found out and detects the storage sky of secondary queue
Between；The secondary queue is made of the one or more in each Mark reaction message queue, the priority order of the secondary queue
Than the priority order time level-one for matching queue；
When the memory space for judging the secondary queue is enough to store the second part completely, then second part is copied
Shellfish is into the secondary queue, conversely, second part is then resolved into first unit and second unit, the first unit is accounted for
Equal with the secondary memory space of queue according to space, the second unit is rest part of the second part in addition to first unit,
Then first unit is copied in the matching queue, copies second unit to card that priority order is inferior to secondary queue
In husband's card message queue.
The beneficial effects of the present invention are: the data that peak hours/period receives are cached using Mark reaction message queue,
And the data in Mark reaction message queue are transferred in database in non-peak hours/period, by the plan for exchanging space for the time
Slightly, the load of peak hours/period server is greatly reduced, while can guarantee that database can be written in important data.The present invention without
Multiple server hardware devices are needed, simple computer program is can use and realizes, reduce the use cost of system.
Detailed description of the invention
Fig. 1 is the flow chart that the present invention resists concurrent method for writing data；
Fig. 2 is the structural block diagram that the present invention resists concurrent data writing systems.
Specific embodiment
Embodiment 1
Referring to Fig.1, it present embodiments provides and a kind of resists concurrent method for writing data, comprising the following steps:
In peak hours/period, the data received are classified according to urgency level；The peak hours/period refers to that load reaches
The period of preset value or preset period；
According to classification results, to data allocation priority；
Data are stored in corresponding Mark reaction by the type of service of the priority order and data that are assigned to according to data
Message queue；The Mark reaction message queue has corresponding type of service, and the Mark reaction message queue is identical for receiving
The data of type of service；
When detecting the Mark reaction message queue there is no identical services type and lead to data storage failure, refusal is connect
The data for failing to be stored in Mark reaction message queue are received, and are fed back to corresponding data source；
In non-peak hours/period, the data stored in Mark reaction message queue are read and are written in database.
In the present invention, peak hours/period can be preset, and specifically be exactly to determine fortune daily according to previous operating experience
The server of row database reaches the period of higher load condition, and defaults in server, when this preset time period of entrance
When just judgement enter peak hours/period.Peak hours/period can also be determined by the load of real-time detection server, i.e., no matter in office
When carve, as long as the load of server reaches certain value, just judgement enters peak hours/period.Other periods in addition to peak hours/period are
Non- peak hours/period.
In the present invention, using hierarchical algorithms, the data received can be classified according to urgency level, specifically may be used
It is set as certain rank so that the data for sending particular source are constant, existing keyword recognition matching algorithm can also be passed through
It extracts the keyword in data and is matched, so that it is determined that the rank of data.It can also be classified by the type of data,
Such as the data not too important for log etc., lower rank, corresponding priority order rearward, for figure can be divided into
The more important data such as piece information can be divided into higher rank, corresponding forward priority order.
The urgency level of the rank reflection data of data, it is preferable that the urgency level of data is higher, and assigned is preferential
Power sequence is more forward, in the preceding high priority data write-in Mark reaction message queue of priority order.
In the present invention, Mark reaction message queue is classified according to type of service, i.e., each Mark reaction message queue difference
With determining type of service, and each Mark reaction message queue is configured as that the data of identical services type can only be stored in.
If the type of service of the data received is mismatched with existing Mark reaction message queue, can not be written to
In existing Mark reaction message queue.The method of the present invention will reject the posterior number of priority order in this case
According to then to data source progress feedback notification.
Preferably, the present invention can also reject specific data: the preceding number of priority order in the following manner
After write-in Mark reaction message queue, it may result in Mark reaction message queue and be fully written, so that priority order is posterior
Data can not be written, and the method for the present invention will reject the posterior data of priority order in this case, then to number
Feedback notification is carried out according to source.
The principle of the present invention is to be cached using Mark reaction message queue to the data that peak hours/period receives, and non-
Data in Mark reaction message queue are transferred in database by peak hours/period, by exchanging the strategy in space for the time, substantially
The load of peak hours/period server is reduced, while can guarantee that database can be written in important data.The present invention is without multiple
Server hardware device can use simple computer program and realize, reduces the use cost of system.
It is further used as preferred embodiment, the method also includes following steps:
In non-peak hours/period, to the request for being rejected the corresponding data source of received data and issuing the data that retransfer；
The data received are written in database.
For being rejected the posterior number of received priority order due to Mark reaction message queue is fully written in peak hours/period
According to when non-peak hours/period server has enough resources to be received, to the sending request of corresponding data source, it is desirable that pass again
Received data are rejected before sending, then the data received are written in database.Pass through aforesaid operations, it is ensured that connect
The integrality of the data received, and the load of server will not be aggravated.
It is further used as preferred embodiment, the quantity of the Mark reaction message queue is multiple, each Mark reaction message
Queue corresponds to different priority, and each Mark reaction message queue is respectively configured as readable WriteMode, reading mode or can only writing
Mode.
Each Mark reaction message queue can be respectively configured mode, including readable WriteMode, reading mode or can only write
Mode.Data can be written to Mark reaction message queue on one side readable, be read on one side from Mark reaction message queue under WriteMode
It data and is written in database out；Under only reading mode, data cannot be written to Mark reaction message queue, it can only be from Mark reaction
Message queue reads data and is simultaneously written in database, when a Mark reaction message queue is configured as reading mode, if
There is the message of identical services type to need to be stored in this Mark reaction message queue, will lead to storage failure, the present invention can be executed
" when detecting the Mark reaction message queue there is no identical services type and lead to data storage failure, refusal is connect in method
The data for failing to be stored in Mark reaction message queue are received, and are fed back to corresponding data source " the step for；Only writing mould
Under formula, data can only be written to Mark reaction message queue, data cannot be read from Mark reaction message queue and be written to database
In.The mode of each Mark reaction message queue can be adjusted according to load dynamic, greatly improve answering for high concurrent data
To ability.
Multiple Mark reaction message queues can be used in the present invention, and the priority of each Mark reaction message queue can be not phase
With, the priority that the priority of preferably each Mark reaction message queue may be assigned to the data received is corresponding
, so that the data no matter received are assigned to any priority, corresponding Mark reaction message queue can be found.
It is further used as preferred embodiment, data are stored in Mark reaction by the priority order according to distribution
The step for message queue, specifically includes:
Each Mark reaction message queue is scanned, matching queue is therefrom found out and the storage for detecting matching queue is empty
Between；The matching queue is made of the one or more in each Mark reaction message queue, the matching queue and data to be stored
With equal priority sequence；
When the memory space for judging the matching queue is enough to store data to be stored completely, then data to be stored are copied
Shellfish is into the matching queue, conversely, data to be stored are then resolved into first part and second part, the first part
It takes up space equal with the matching memory space of queue, the second part is its remaining part of data to be stored in addition to first part
Point, then first part is copied in the matching queue, copies second part to priority order inferior to matching queue
Mark reaction message queue in.
By being scanned to each Mark reaction message queue, can find has equal priority sequence with data to be stored
One or more matching queues.At least two situations will be faced at this time, the first is the single or multiple storages for matching queues
The sum of space is enough to store data to be stored completely, then just by data copy to be stored into the matching queue.If single
The sum of the memory space of a or multiple matching queues is available free, but is not enough to store data to be stored completely, then just will be wait deposit
It puts data and resolves into first part and second part, wherein the size of first part can just fill up matching queue, then will
First part is stored in matching queue, copies second part Mark reaction message team of the priority order inferior to matching queue to
In column.Preferably, for storing the priority order level-one more secondary than matching queue of the Mark reaction message queue of second part.
Preferably, if facing the third situation, i.e., the memory spaces of single or multiple matching queues are zero, then can be with
Data to be stored are rejected, and are fed back to corresponding data source.
It is further used as preferred embodiment, it is described to copy second part to priority order inferior to matching queue
It the step in Mark reaction message queue, specifically includes:
Each Mark reaction message queue is scanned, secondary queue is therefrom found out and detects the storage sky of secondary queue
Between；The secondary queue is made of the one or more in each Mark reaction message queue, the priority order of the secondary queue
Than the priority order time level-one for matching queue；
When the memory space for judging the secondary queue is enough to store the second part completely, then second part is copied
Shellfish is into the secondary queue, conversely, second part is then resolved into first unit and second unit, the first unit is accounted for
Equal with the secondary memory space of queue according to space, the second unit is rest part of the second part in addition to first unit,
Then first unit is copied in the matching queue, copies second unit to card that priority order is inferior to secondary queue
In husband's card message queue.
When second part is copied in other Mark reaction message queues, it is possible to face three kinds of situations, i.e., it is single or
The sum of the memory space of multiple secondary queues is enough to store the memory space of data to be stored, single or multiple secondary queues completely
The sum of memory space that is available free but being not enough to store data to be stored and single or multiple secondary queues completely be zero.It can
With referring to method that data to be stored are decomposed into first part and second part, second part is resolved into first unit and the
Then Unit two carry out respective handling.
Embodiment 2
Present embodiments provide it is a kind of resist concurrent data writing systems, referring to Fig. 2, comprising: data staging module, preferential
Weigh distribution module, Mark reaction message queue module, data refusal module and Data write. module.
The data staging module is used to be classified the data received according to urgency level in peak hours/period；Institute
It states peak hours/period and refers to that load reaches the period or preset period of preset value；
The priority allocation module is used for according to classification results, to data allocation priority；
The service class of priority order and data that the Mark reaction message queue module is used to be assigned to according to data
Data are stored in corresponding Mark reaction message queue by type；The Mark reaction message queue has corresponding type of service, described
Mark reaction message queue is used to receive the data of identical services type；
The data refusal module, which is used to work as, to be detected the Mark reaction message queue there is no identical services type and causes
When data storage failure, rejection fails the data being stored in Mark reaction message queue, and carries out to corresponding data source
Feedback；
The Data write. module is used to that the data stored in Mark reaction message queue to be read and be write in non-peak hours/period
Enter into database.
Existing server architecture can be used in present system, and used hardware module and attaching method thereof is ok
It is realized using the prior art.Present system is able to carry out the method for the present invention, but the method for the present invention does not depend on present system
Hardware realization.
To sum up, the beneficial effects of the present invention are:
The data that peak hours/period receives are cached using Mark reaction message queue, and in non-peak hours/period by Kraft
Data in card message queue are transferred in database, and by exchanging the strategy in space for the time, peak hours/period clothes are greatly reduced
The load of business device, while can guarantee that database can be written in important data.The present invention is not necessarily to multiple server hardware devices,
It can use simple computer program to realize, reduce the use cost of system.Simultaneously present invention can ensure that the number received
According to integrality, and the load of server will not be aggravated.
It is to be illustrated to preferable implementation of the invention, but the implementation is not limited to the invention above
Example, those skilled in the art can also make various equivalent variations on the premise of without prejudice to spirit of the invention or replace
It changes, these equivalent deformations or replacement are all included in the scope defined by the claims of the present application.
Claims (10)
1. a kind of resist concurrent method for writing data, which comprises the following steps:
In peak hours/period, the data received are classified according to urgency level；The peak hours/period refers to that load reaches default
The period of value or preset period；
According to classification results, to data allocation priority；
Data are stored in corresponding Mark reaction message by the type of service of the priority order and data that are assigned to according to data
Queue；The Mark reaction message queue has corresponding type of service, and the Mark reaction message queue is for receiving identical services
The data of type；
When detecting the Mark reaction message queue there is no identical services type and lead to data storage failure, rejection is not
The data that can be stored in Mark reaction message queue, and fed back to corresponding data source；
In non-peak hours/period, the data stored in Mark reaction message queue are read and are written in database.
A kind of resist concurrent method for writing data 2. according to claim 1, which is characterized in that the method also includes with
Lower step:
In non-peak hours/period, to the request for being rejected the corresponding data source of received data and issuing the data that retransfer；
The data received are written in database.
A kind of resist concurrent method for writing data 3. according to claim 1 or 2, which is characterized in that the Mark reaction disappears
Cease queue quantity be it is multiple, each Mark reaction message queue corresponds to different priority, and each Mark reaction message queue is matched respectively
Be set to it is readable can WriteMode, reading mode or only WriteMode.
A kind of resist concurrent method for writing data 4. according to claim 3, which is characterized in that described according to the excellent of distribution
First Quan Shunxu, is specifically included the step for data are stored in Mark reaction message queue:
Each Mark reaction message queue is scanned, matching queue is therefrom found out and detects the memory space of matching queue；Institute
It states matching queue to be made of the one or more in each Mark reaction message queue, the matching queue has phase with data to be stored
Same priority order；
When the memory space for judging the matching queue is enough to store data to be stored completely, then data copy to be stored is arrived
In the matching queue, conversely, data to be stored are then resolved into first part and second part, then first part is copied
Into the matching queue, second part is copied in Mark reaction message queue of the priority order inferior to matching queue；Its
In, taking up space for the first part is equal with the matching memory space of queue.
A kind of resist concurrent method for writing data 5. according to claim 4, which is characterized in that described to copy second part
Shellfish is inferior to the step in the Mark reaction message queue of matching queue to priority order, specifically includes:
Each Mark reaction message queue is scanned, secondary queue is therefrom found out and detects the memory space of secondary queue；Institute
It states secondary queue to be made of the one or more in each Mark reaction message queue, the priority order of the secondary queue is than matching
The priority order time level-one of queue；
When the memory space for judging the secondary queue is enough to store the second part completely, then second part is copied to
In the secondary queue, conversely, second part is then resolved into first unit and second unit, the first unit occupies sky
Between it is equal with the memory space of secondary queue, the second unit is rest part of the second part in addition to first unit, then
First unit is copied in the matching queue, copies second unit to Mark reaction that priority order is inferior to secondary queue
In message queue.
6. a kind of resist concurrent data writing systems characterized by comprising
Data staging module, for being classified to the data received according to urgency level in peak hours/period；When described busy
Section refers to that load reaches the period or preset period of preset value；
Priority allocation module is used for according to classification results, to data allocation priority；
Mark reaction message queue module, the type of service of the priority order and data that are assigned to according to data, data are deposited
It is put into corresponding Mark reaction message queue；The Mark reaction message queue has corresponding type of service, the Mark reaction message
Queue is used to receive the data of identical services type；
Data refuse module, when detect there is no identical services type Mark reaction message queue and cause data storage failure
When, rejection fails the data being stored in Mark reaction message queue, and is fed back to corresponding data source；
Data write. module, for the data stored in Mark reaction message queue being read and are written to number in non-peak hours/period
According in library.
A kind of resist concurrent data writing systems 7. according to claim 6, which is characterized in that the system also includes weights
New request module, the re-request module are used to send out in non-peak hours/period to the corresponding data source of received data is rejected
The request for the data that retransfer out；The data that the Data write. module is also used to receive are written in database.
A kind of resist concurrent data writing systems 8. according to claim 6 or 7, which is characterized in that the Mark reaction disappears
Cease queue quantity be it is multiple, each Mark reaction message queue corresponds to different priority, and each Mark reaction message queue is matched respectively
Be set to it is readable can WriteMode, reading mode or only WriteMode.
A kind of resist concurrent data writing systems 9. according to claim 8, which is characterized in that Mark reaction message team
Column module includes the first submodule, and first submodule is specifically used for:
Each Mark reaction message queue is scanned, matching queue is therefrom found out and detects the memory space of matching queue；Institute
It states matching queue to be made of the one or more in each Mark reaction message queue, the matching queue has phase with data to be stored
Same priority order；
When the memory space for judging the matching queue is enough to store data to be stored completely, then data copy to be stored is arrived
In the matching queue, conversely, data to be stored are then resolved into first part and second part, then first part is copied
Into the matching queue, second part is copied in Mark reaction message queue of the priority order inferior to matching queue；Its
In, taking up space for the first part is equal with the matching memory space of queue.
A kind of resist concurrent data writing systems 10. according to claim 9, which is characterized in that the Mark reaction message
Queue module further includes second submodule, and the second submodule is specifically used for:
Each Mark reaction message queue is scanned, secondary queue is therefrom found out and detects the memory space of secondary queue；Institute
It states secondary queue to be made of the one or more in each Mark reaction message queue, the priority order of the secondary queue is than matching
The priority order time level-one of queue；
When the memory space for judging the secondary queue is enough to store the second part completely, then second part is copied to
In the secondary queue, conversely, second part is then resolved into first unit and second unit, the first unit occupies sky
Between it is equal with the memory space of secondary queue, the second unit is rest part of the second part in addition to first unit, then
First unit is copied in the matching queue, copies second unit to Mark reaction that priority order is inferior to secondary queue
In message queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811265135.5A CN109522136A (en) | 2018-10-29 | 2018-10-29 | It is a kind of to resist concurrent method for writing data and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811265135.5A CN109522136A (en) | 2018-10-29 | 2018-10-29 | It is a kind of to resist concurrent method for writing data and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109522136A true CN109522136A (en) | 2019-03-26 |
Family
ID=65772468
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811265135.5A Pending CN109522136A (en) | 2018-10-29 | 2018-10-29 | It is a kind of to resist concurrent method for writing data and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109522136A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111831458A (en) * | 2020-06-11 | 2020-10-27 | 武汉烽火技术服务有限公司 | High-concurrency high-decoupling data processing method and data center system |
-
2018
- 2018-10-29 CN CN201811265135.5A patent/CN109522136A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111831458A (en) * | 2020-06-11 | 2020-10-27 | 武汉烽火技术服务有限公司 | High-concurrency high-decoupling data processing method and data center system |
| CN111831458B (en) * | 2020-06-11 | 2024-04-26 | 武汉烽火技术服务有限公司 | High-concurrency high-decoupling data processing method and data center system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dobbelaere et al. | Kafka versus RabbitMQ: A comparative study of two industry reference publish/subscribe implementations: Industry Paper | |
| US8943271B2 (en) | Distributed cache arrangement | |
| CN101854388B (en) | Method and system concurrently accessing a large amount of small documents in cluster storage | |
| KR20170097132A (en) | System for efficient processing of transaction requests related to an account in a database | |
| US8161244B2 (en) | Multiple cache directories | |
| US8108612B2 (en) | Location updates for a distributed data store | |
| CN108139941A (en) | Dynamic resource allocation based on network flow control | |
| EP3346379B1 (en) | Database management system with dynamic allocation of database requests | |
| US10706027B2 (en) | Database management system with dynamic allocation of database requests | |
| US7734785B2 (en) | On demand message based financial network integration middleware | |
| CN106339386B (en) | Database flexible scheduling method and device | |
| CN103914399A (en) | Disk cache method and device in parallel computer system | |
| WO2010121218A2 (en) | Policy-based storage structure distribution | |
| CN104102693A (en) | Object processing method and device | |
| CN111600957A (en) | File transmission method, device and system and electronic equipment | |
| US20200294124A1 (en) | Blockchain-based method, apparatus, and device | |
| US9083725B2 (en) | System and method providing hierarchical cache for big data applications | |
| US20160078065A1 (en) | Policy-based Storage Structure Distribution | |
| CN104392377A (en) | Cloud transaction system | |
| US11138178B2 (en) | Separation of computation from storage in database for better elasticity | |
| CN109522136A (en) | It is a kind of to resist concurrent method for writing data and system | |
| CN110659303A (en) | Read-write control method and device for database nodes | |
| CN111698301A (en) | Service management method, device and storage medium for ensuring service continuation | |
| CN102542040B (en) | Capacity acquiring method and system | |
| CN111294383B (en) | Internet of things service management system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190326 |
|
| WD01 | Invention patent application deemed withdrawn after publication |