CN109462631A - Data processing method, device, storage medium and electronic device - Google Patents
Data processing method, device, storage medium and electronic device Download PDFInfo
- Publication number
- CN109462631A CN109462631A CN201811021844.9A CN201811021844A CN109462631A CN 109462631 A CN109462631 A CN 109462631A CN 201811021844 A CN201811021844 A CN 201811021844A CN 109462631 A CN109462631 A CN 109462631A
- Authority
- CN
- China
- Prior art keywords
- data
- block chain
- request
- target data
- result
- 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
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Abstract
The invention discloses a kind of data processing method, device, storage medium and electronic devices.Wherein, this method comprises: receiving the first request, wherein the first request writes first data into block chain for requesting；By the storage of the first data into pending data set；Target data is obtained from pending data set according to the current data-handling capacity of block chain, wherein the data volume of target data is less than or equal to the data volume that block chain currently allows to handle；Target data is written in block chain.The present invention solves technical problem of the processing for requesting treatment effeciency when writing data into the request of block chain lower in the related technology.
Description
Technical field
The present invention relates to computer fields, in particular to a kind of data processing method, device, storage medium and electricity
Sub-device.
Background technique
In block chain field, request cochain (i.e. request writes data into block chain) in the related technology is all to receive
With regard to the data of its requested cochain are directly carried out cochain processing after request.But this mode is larger in the number of concurrent of request
The phenomenon that either failing in the lower situation of block chain processing capacity it is easy to appear request failure or cochain.
For above-mentioned problem, currently no effective solution has been proposed.
Summary of the invention
The embodiment of the invention provides a kind of data processing method, device, storage medium and electronic devices, at least to solve
Technical problem of the processing for requesting treatment effeciency when writing data into the request of block chain lower in the related technology.
One side according to an embodiment of the present invention provides a kind of data processing method, comprising: the first request is received,
In, first request writes first data into block chain for requesting；By first data storage to pending data collection
In conjunction；Target data is obtained from the pending data set according to the current data-handling capacity of the block chain, wherein
The data volume of the target data is less than or equal to the data volume that the block chain currently allows to handle；By the target data
It is written in the block chain.
One side according to an embodiment of the present invention additionally provides a kind of data processing equipment, comprising: the first receiving module,
For receiving the first request, wherein first request writes first data into block chain for requesting；First memory module,
For storing first data into pending data set；First obtains module, for current according to the block chain
Data-handling capacity obtain target data from the pending data set, wherein the data volume of the target data is small
In or equal to the block chain currently allow handle data volume；First writing module, for the target data to be written
In the block chain.
One side according to an embodiment of the present invention additionally provides a kind of storage medium, which is characterized in that the storage medium
In be stored with computer program, wherein the computer program be arranged to operation when execute any of the above-described described in number
According to processing method.
One side according to an embodiment of the present invention additionally provides a kind of electronic device, including memory and processor, special
Sign is, computer program is stored in the memory, and the processor is arranged to execute by the computer program
Data processing method described in any of the above-described.
In embodiments of the present invention, it is requested using reception first, wherein the first request writes first data into for requesting
Block chain；By the storage of the first data into pending data set；According to the current data-handling capacity of block chain to be processed
Target data is obtained in data acquisition system, wherein the data volume of target data is less than or equal to what block chain currently allowed to handle
Data volume；Target data is written in block chain.After receiving the first request for requesting to write first data into block chain,
First data can be stored in the pending data set in block chain, and the data-handling capacity current according to block chain
Target data is obtained from pending data set and carries out cochain processing, is easy when the request of big number of concurrent so as to avoid receiving
It causes data jamming and causes data cochain efficiency lower or the phenomenon that data cochain fails, increase the concurrent of request
Number improves the technical effect that processing is used to request treatment effeciency when writing data into the request of block chain to realize, into
And solves processing in the related technology for requesting the lower technology of the treatment effeciency when request for writing data into block chain to be asked
Topic.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present invention, constitutes part of this application, this hair
Bright illustrative embodiments and their description are used to explain the present invention, and are not constituted improper limitations of the present invention.In the accompanying drawings:
Fig. 1 is a kind of schematic diagram of optional data processing method according to an embodiment of the present invention；
Fig. 2 is a kind of topological structure schematic diagram one of optional data processing method according to an embodiment of the present invention；
Fig. 3 is a kind of topological structure schematic diagram two of optional data processing method according to an embodiment of the present invention；
Fig. 4 is a kind of application environment schematic diagram of optional data processing method according to an embodiment of the present invention；
Fig. 5 is a kind of schematic diagram of optional data processing method of optional embodiment according to the present invention；
Fig. 6 is a kind of schematic diagram of optional data processing equipment according to an embodiment of the present invention；
Fig. 7 is a kind of schematic diagram of optional data processing method according to an embodiment of the present invention；And
Fig. 8 is a kind of schematic diagram of optional electronic device according to an embodiment of the present invention.
Specific embodiment
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only
The embodiment of a part of the invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill people
The model that the present invention protects all should belong in member's every other embodiment obtained without making creative work
It encloses.
It should be noted that description and claims of this specification and term " first " in above-mentioned attached drawing, "
Two " etc. be to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should be understood that using in this way
Data be interchangeable under appropriate circumstances, so as to the embodiment of the present invention described herein can in addition to illustrating herein or
Sequence other than those of description is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that cover
Cover it is non-exclusive include, for example, the process, method, system, product or equipment for containing a series of steps or units are not necessarily limited to
Step or unit those of is clearly listed, but may include be not clearly listed or for these process, methods, product
Or other step or units that equipment is intrinsic.
According to an aspect of an embodiment of the present invention, a kind of data processing method is provided, which can be with
Applied in block chain node, block chain node can be the calculating equipment for referring to and participating in data calculation processing in block chain network,
Such as computer, the equipment that mobile phone, mine machine, desktop computer or server etc. possess computing capability can be used as in block chain network
Node.For example, in bit coin network, it, should after running bitcoind program on the computer for be already connected to internet
Computer also just becomes a node in bit coin network.As shown in Figure 1, this method comprises:
S102 receives the first request, wherein the first request writes first data into block chain for requesting；
S104, by the storage of the first data into pending data set, optionally, block chain node can be by the first data
Store be located at block chain in pending data set in either by the first data storage to be located at block chain except to
It handles in data acquisition system；
S106 obtains target data from pending data set according to the current data-handling capacity of block chain, wherein
The data volume of target data is less than or equal to the data volume that block chain currently allows to handle；
Target data is written in block chain S108.
Optionally, in the present embodiment, it can be, but not limited to include multiple node devices, area in the topological structure of block chain
Node device in block chain can be divided into block chain application layer and block chain buffer layer on function structure, and block chain application layer connects
It receiving for requesting write first data into block chain first to request, block chain buffer layer gets up the first data buffer storage, when
Block chain buffer layer takes data to be processed from caching when the current processing capacity of block chain meets the treatment conditions of data
Out, then to data the processing of write-in block chain is carried out.Such as: the data broadcasting of cochain will be needed to other nodes, generate block
It knows together, write-in block chain etc..
Optionally, in the present embodiment, different deployment, area can be carried out to block chain buffer layer according to different needs
Block chain buffer layer can be set in each node device, i.e., one storage region of deployment and storage machine in each node device
System.Alternatively, block chain buffer layer can be set in the part of nodes equipment in block chain, that is to say, that block chain application layer
Multiple node devices and block chain buffer layer buffering equipment between can be one-to-one connection, be also possible to many-to-one
Connection.
Optionally, in the present embodiment, as shown in Fig. 2, including multiple in an optional topological structure of block chain
Node device a, wherein buffer area is deployed in each node device as block chain buffer layer, for storing request
The data of cochain.The data of request are stored in the pending data set of buffer area after receiving request by each node device
In, subsequent condition to be processed is met the requirements, such as when the load of block catenary system is low, then cochain required for request by storage
Data broadcasting gives other nodes, generates block and knows together, block chain is written.
Optionally, in the present embodiment, as shown in figure 3, including more in another optional topological structure of block chain
A buffering equipment is as block chain buffer layer and multiple node devices as block chain application layer, wherein multiple node devices with
Have plenty of one-to-one connection relationship in multiple buffering equipment, has plenty of many-to-one connection relationship, then by multiple buffering equipment
It is connected to other node devices.Buffering equipment stores the data of request after receiving the request that node device is sent, after
Continue condition to be processed to meet the requirements, such as when the load of block catenary system is low, then the data of cochain required for request by storage
Other nodes are broadcast to, block is generated and knows together, block chain is written.
Optionally, in the present embodiment, by taking block chain buffer layer is to be deployed in the buffer area of each node device as an example,
Above-mentioned data processing method can be applied to 406 node devices 402 as shown in Figure 4, node device 404 and node device structures
At hardware environment in.As shown in figure 4, the buffer layer of node device 402 receives by taking the treatment process of node device 402 as an example
The first request that the application layer of node device 402 is sent, wherein the first request writes first data into block chain for requesting；
By the storage of the first data into the pending data set in node device 402；According to the current data-handling capacity of block chain
Target data is obtained from pending data set, wherein the data volume of target data is less than or equal to block chain and currently permits
Perhaps the data volume handled；Target data is written in node device 404 and node device 406.
Optionally, in the present embodiment, above-mentioned data processing method can be, but not limited to be applied to treat write-in block chain
The scene that is handled of data in.Wherein, above-mentioned node device can be, but not limited to be applied to every field, for example, online
Education sector, instant messaging field, community space field, field of play, shopping area, browser field, financial field, more matchmakers
Body field, live streaming field etc..Specifically, can be, but not limited to be applied to treat the data of write-in block chain in above-mentioned financial field
In the scene handled, or can with but be not limited to be applied to above-mentioned shopping area treat write-in block chain data carry out
In the scene of processing, to improve processing for requesting treatment effeciency when writing data into the request of block chain.Above-mentioned is only one
Example is planted, does not do any restriction to this in the present embodiment.
Optionally, in the present embodiment, above-mentioned data processing method can be executed by the arbitrary node in block chain, can also
To be executed in by block chain as the node device of block chain buffer layer.Such as: if buffered by node device as block chain
Layer then executes above-mentioned steps S102 to step S108 by node device；In addition to this it is possible to be held by the equipment except block chain
The above-mentioned data processing method of row.If by buffer layer of the special buffering equipment as block chain except block chain, by by
Special buffering equipment except block chain executes above-mentioned steps S102 to step S108.
Optionally, in the present embodiment, the first data can be, but not limited to be stored in database (DB), or can also
To be stored by other forms, such as: being buffered in the memory of node device etc..Pending data set can be located at
In some node device in block chain, it can also be located in the equipment except block chain.
Optionally, in the present embodiment, it can be, but not limited to carry the first data in the first request.If the first request
In carry the first data, then by first request carry the first data store into pending data set.If first asks
Without carrying the first data in asking, then the first data are got according to the instruction of the first request first, then will acquire first
Data are stored into pending data set.
Optionally, in the present embodiment, the first request is for requesting certain data to be written in block chain, for not
The mode of same block chain implementation, possible data write-in is not also identical, will be used to request to write data into block chain herein
Information be referred to as requesting.
Optionally, in the present embodiment, the first request can be, but not limited to be the equipment for executing above-mentioned data processing method
What itself was generated, what the user terminal that the equipment for being also possible to execute above-mentioned data processing method is connected was sent.
In an optional embodiment, as shown in figure 5, being deployed on node device with block chain buffer layer and being
Example, the process of data processing the following steps are included:
Step 1, the buffer layer of node device receives the first request that application layer is sent, wherein the first request is for requesting
Write first data into block chain；
Step 2, the buffer layer of node device stores the first data to the pending data set being located in application memory
In；
Step 3, the buffer layer of node device is according to the current data-handling capacity of block chain from pending data set
Obtain target data, wherein the data volume of target data is less than or equal to the data volume that block chain currently allows to handle；
Step 4, target data is written in object block chain link point included in block chain the buffer layer of node device.
It is understood that object block chain link point included in the block chain includes in block chain except execution data
One or more any other node device except the node device of processing method.When data processing method is by block chain
Except other equipment when executing, object block chain link point included in the block chain includes any one in block chain
Or multiple block chain nodes.
As it can be seen that through the above steps, receive the after the first request for requesting to write first data into block chain
One data are stored in the pending data set in block chain, and according to the current data-handling capacity of block chain to be processed
Target data is obtained in data acquisition system and carries out cochain processing, be easy to cause data when the request of big number of concurrent so as to avoid receiving
Block and causes data cochain efficiency lower or the phenomenon that data cochain fails, increase the number of concurrent of request, thus
It realizes and improves processing for requesting the technical effect for the treatment of effeciency when writing data into the request of block chain, and then solve
Technical problem of the processing for requesting treatment effeciency when writing data into the request of block chain lower in the related technology.
It include: current in block chain into pending data set by the storage of the first data as a kind of optional scheme
In the case that the data volume for allowing to handle is less than or equal to target data amount, by the storage of the first data in block chain
In pending data set；
Obtaining target data from pending data set according to the current data-handling capacity of block chain includes: in block
The data volume that chain currently allows to handle by being less than or equal in the case that target data amount is converted to greater than target data amount, from
Target data is obtained in pending data set.
Optionally, in the present embodiment, the pending data collection of block chain buffer layer is arrived in the request storage that will be received
After conjunction, a collection of target data can be obtained from pending data set and is sent to block chain, to hold to these target datas
Row uplink operation can carry out cochain.
Optionally, in the present embodiment, target data can be, but not limited to request from one or more.Number of targets
According to being got according to the current data-handling capacity of block chain, one can be met in the current data-handling capacity of block chain
When fixed condition, mesh of the data volume no more than the data volume that block chain currently allows to handle is obtained from pending data set
Mark data are handled.
Optionally, in the present embodiment, the data volume that currently can allow to handle in block chain is less than or equal to target
In the case where data volume, by the storage of the first data into the pending data set being located in block chain, and it is current in block chain
In the case that the data volume for allowing to handle is greater than target data amount, object included in block chain is directly write first data into
In block chain node, to guarantee the phenomenon that block chain accumulation layer is not in request congestion, to improve the speed of request processing
Degree.
Optionally, in the present embodiment, after being stored the first data, can condition maturity (such as: block
Catenary system load is lower) when will need the first data broadcasting of cochain to other nodes again, generate block and know together, write area
Block chain.
As a kind of optional scheme, after by the storage of the first data into pending data set, further includes:
S1 generates the first storage result information, wherein the first storage result in the case where successfully storing the first data
Information is used to indicate the first data and stores successfully；
S2 receives the second request, wherein for requesting block chain is written in the second data by the second request；
S3, by the storage of the second data into pending data set.
Optionally, in the present embodiment, if the first data are successfully stored by block chain buffer layer, it can be generated one
A successful first storage result information notice block chain application layer of the first data storage that is used to indicate can continue to
Other are requested, and block chain application layer can respond the first storage result information and receive for requesting the second data institute is written
The second request of block chain is stated, and is stored the second data to the number to be processed being located in block chain by block chain buffer layer
According in set, so that block chain application layer need not wait the processing result of request that can continue to other requests, to realize
Half synchronization process of cochain request, compared with the mechanism of synchronization process, which is capable of increasing the concurrent of request
Number, compared with the mechanism of asynchronous process, which can be realized the control to number of concurrent.
In an optional embodiment, by taking block chain buffer layer is deployed on node device as an example, data processing
Process the following steps are included:
Step 1, the block chain buffer layer of node device receives the first request that block chain application layer is sent, wherein first
Request writes first data into block chain for requesting；
Step 2, the block chain buffer layer of node device stores the first data to the number to be processed being located in application memory
According in set；
Step 3, the block chain buffer layer of node device generates the first storage knot in the case where successfully storing the first data
Fruit information simultaneously sends it to block chain application layer, wherein the first storage result information is used to indicate the first data and stores successfully；
Step 4, the block chain application layer of node device responds the first storage result information and receives the second request, wherein the
For requesting block chain is written in second data by two requests；
Step 5, the block chain buffer layer of node device stores the second data to the pending data being located in block chain
In set；
Step 6, the buffer layer of node device is according to the current data-handling capacity of block chain from pending data set
Obtain target data, wherein the data volume of target data is less than or equal to the data volume that block chain currently allows to handle；
Step 7, target data is written in object block chain link point included in block chain the buffer layer of node device.
It should be noted that in the present embodiment, not limiting the sequence that executes between above-mentioned steps 6 and above-mentioned steps 3, i.e.,
The buffer layer of node device can be from pending data set when the current data-handling capacity of block chain meets treatment conditions
Middle acquisition target data is handled.The block chain application layer of node device can continue after determining that the first data store successfully
Receive other requests.The execution of the two is independent of each other.
As a kind of optional scheme, after target data is written in block chain, further includes:
S1 obtains processing result corresponding with target data, wherein processing result is used to indicate whether target data succeeds
It is written in object block chain link point included in block chain；
S2 records the target data and processing result with corresponding relationship.
Optionally, in the present embodiment, the processing result for the target data that the node in block chain returns is received, and will be each
The corresponding processing result of a target data is recorded.
Optionally, in the present embodiment, record have corresponding relationship target data and processing result mode can with but
It is not limited to record the mark of target data and its mark of corresponding processing result in log, such as: as shown in table 1, day
The processing result of data 1 to data N is had recorded in will in a tabular form, it is at 0 expression that processing result, which is that 1 expression is handled successfully,
Reason failure.
Table 1
| Data Identification | Processing result |
| Data 1 | 0 |
| Data 2 | 1 |
| Data 3 | 0 |
| Data 4 | 1 |
| …… | …… |
| Data N | 1 |
The processing result of each processed data can be found by table 1, as can be seen from Table 1 data 2, data 4, number
It is handled successfully according to N, data 1,3 processing failure of data.
Optionally, in the present embodiment, record have corresponding relationship target data and processing result mode can with but
It is not limited to target data and processing result that storage has corresponding relationship.
As a kind of optional scheme, after recording the target data and processing result with corresponding relationship, further includes:
S1, from processing result is the 4th data of third result in delete target data in pending data set, wherein
Third result is used to indicate the 4th data and is successfully written in object block chain link point included in block chain.
Optionally, in the present embodiment, it after having recorded target data processing result corresponding with its, can will store
Data in processing successful data delete, so as to make memory space store more data, to economize on resources.
As a kind of optional scheme, after obtaining processing result corresponding with target data, further includes:
S1, the processing result that record is obtained from the target data of storage is the third data of the first result, wherein first
As a result it third data is used to indicate fails and be written in object block chain link point included in block chain；
S2 re-writes third data in object block chain link point included in block chain, until receiving object
The second result that block chain node returns, wherein the second result is used to indicate third data and is successfully written included in block chain
Object block chain link point in.
Optionally, in the present embodiment, if during cochain, cochain is caused due to abnormal outside the systems such as network
Failure, due to the presence of data buffer storage mechanism, can regularly replay data, until data processing success, to improve number
According to the success rate of processing.
As a kind of optional scheme, after the second result for receiving the return of object block chain link point, further includes:
S1, third data and the first result by record with corresponding relationship are updated to the third number with corresponding relationship
According to the second result.
Optionally, in the present embodiment, failed data are handled after handling successfully again, can be had to record
The data and processing result of corresponding relationship are updated.Such as: the failed data weight of data 1 and data 3 in table 1 etc.
After new transmission processing, receives and be used to indicate the successful processing result of data 1 and data 3 etc. processing, then as shown in table 2, by
The processing result of data 1 and data 3 is updated to 1 by 0 in table 1.
Table 2
| Data Identification | Processing result |
| Data 1 | 1 |
| Data 2 | 1 |
| Data 3 | 1 |
| Data 4 | 1 |
| …… | …… |
| Data N | 1 |
Optionally, in the present embodiment, since third data have been handled successfully, the third data of storage can be deleted
It removes, to save memory space.
As a kind of optional scheme, after recording the target data and processing result with corresponding relationship, further includes:
S1, by with corresponding relationship target data and processing result be sent to destination request corresponding to target data
Sender；Alternatively,
S2 receives the inquiry request that the sender of third request sends, wherein inquiry request is for requesting inquiry third to be asked
Seek the processing result for requesting the data of write-in block chain；Is obtained from target data and processing result with corresponding relationship
Corresponding 4th result of three requests；4th result is sent to the sender of third request.
Optionally, in the present embodiment, obtained processing result proactive notification can be given to request sender, alternatively,
It can receive the inquiry request that request sender sends, respond the processing result hair that the inquiry request is requested the request of inquiry
Give request sender.
As a kind of optional scheme, after by the storage of the first data into pending data set, further includes:
S1 sends the sender of the second storage result information to the first request in the case where storing the first data failure,
Wherein, the second storage result information is used to indicate the first data failure of storage；
S2, the sender for receiving the first request respond the first request that the second storage result information is sent.
Optionally, in the present embodiment, if the first data storage has failed, the result of failure can be sent to and is asked
Sender is asked, request sender will retransmit the first request as needed.
It should be noted that for the various method embodiments described above, for simple description, therefore, it is stated as a series of
Combination of actions, but those skilled in the art should understand that, the present invention is not limited by the sequence of acts described because
According to the present invention, some steps may be performed in other sequences or simultaneously.Secondly, those skilled in the art should also know
It knows, the embodiments described in the specification are all preferred embodiments, and related actions and modules is not necessarily of the invention
It is necessary.
Through the above description of the embodiments, those skilled in the art can be understood that according to above-mentioned implementation
The method of example can be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but it is very much
In the case of the former be more preferably embodiment.Based on this understanding, technical solution of the present invention is substantially in other words to existing
The part that technology contributes can be embodied in the form of software products, which is stored in a storage
In medium (such as ROM/RAM, magnetic disk, CD), including some instructions are used so that a terminal device (can be mobile phone, calculate
Machine, server or network equipment etc.) execute method described in each embodiment of the present invention.
According to an aspect of an embodiment of the present invention, it additionally provides a kind of for implementing the data of above-mentioned data processing method
Processing unit, as shown in fig. 6, the device includes:
First receiving module 62, for receiving the first request, wherein the first request writes first data into area for requesting
Block chain；
First memory module 64, for storing the first data into pending data set；
First obtains module 66, for being obtained from pending data set according to the current data-handling capacity of block chain
Target data, wherein the data volume of target data is less than or equal to the data volume that block chain currently allows to handle；
First writing module 68, for target data to be written in block chain.
As a kind of optional scheme, the first memory module 64 is used for: small in the data volume that block chain currently allows to handle
In or be equal to target data amount in the case where, by the first data storage to be located at block chain in pending data set in；
First acquisition module 66 is used for: in the data volume that block chain currently allows to handle by being less than or equal to target data
In the case that amount is converted to greater than target data amount, target data is obtained from pending data set.
Optionally, in the present embodiment, the pending data collection of block chain buffer layer is arrived in the request storage that will be received
After conjunction, a collection of target data can be obtained from pending data set and is sent to block chain, to hold to these target datas
Row uplink operation can carry out cochain.
Optionally, in the present embodiment, target data can be, but not limited to request from one or more.Number of targets
According to being got according to the current data-handling capacity of block chain, one can be met in the current data-handling capacity of block chain
When fixed condition, mesh of the data volume no more than the data volume that block chain currently allows to handle is obtained from pending data set
Mark data are handled.
Optionally, in the present embodiment, the data volume that currently can allow to handle in block chain is less than or equal to target
In the case where data volume, by the storage of the first data into the pending data set being located in block chain, and it is current in block chain
In the case that the data volume for allowing to handle is greater than target data amount, object included in block chain is directly write first data into
In block chain node, to guarantee the phenomenon that block chain accumulation layer is not in request congestion, to improve the speed of request processing
Degree.
Optionally, in the present embodiment, after being stored the first data, can condition maturity (such as: block
Catenary system load is lower) when will need the first data broadcasting of cochain to other nodes again, generate block and know together, write area
Block chain.
As a kind of optional scheme, above-mentioned apparatus further include:
Generation module, for generating the first storage result information in the case where successfully storing the first data, wherein the
One storage result information is used to indicate the first data and stores successfully；
Second receiving module, for receiving the second request, wherein for requesting block is written in the second data by the second request
Chain；
Second memory module, for storing the second data into pending data set.
Optionally, in the present embodiment, if the first data are successfully stored by block chain buffer layer, it can be generated one
A successful first storage result information notice block chain application layer of the first data storage that is used to indicate can continue to
Other are requested, and block chain application layer can respond the first storage result information and receive for requesting the second data institute is written
The second request of block chain is stated, and is stored the second data to the number to be processed being located in block chain by block chain buffer layer
According in set, so that block chain application layer need not wait the processing result of request that can continue to other requests, to realize
Half synchronization process of cochain request, compared with the mechanism of synchronization process, which is capable of increasing the concurrent of request
Number, compared with the mechanism of asynchronous process, which can be realized the control to number of concurrent.
As a kind of optional scheme, above-mentioned apparatus further include:
Second obtains module, for obtaining processing result corresponding with target data, wherein processing result is used to indicate mesh
Whether mark data are successfully written in object block chain link point included in block chain；
Logging modle, for recording target data and processing result with corresponding relationship.
Optionally, in the present embodiment, the processing result for the target data that block chain returns is received, and by each number of targets
It is recorded according to corresponding processing result.
As a kind of optional scheme, above-mentioned apparatus further include:
Removing module, for from processing result is the 4 of third result in delete target data in pending data set
Data, wherein third result is used to indicate the 4th data and is successfully written in object block chain link point included in block chain.
Optionally, in the present embodiment, it after having recorded target data processing result corresponding with its, can will store
Data in processing successful data delete, so as to make memory space store more data, to economize on resources.
As a kind of optional scheme, above-mentioned apparatus further include:
Third obtains module, and the processing result for obtaining record from the target data of storage is the third of the first result
Data, wherein the first result, which is used to indicate third data and fails, is written object block chain link point included in block chain
In；
Second writing module, for third data to be re-write in object block chain link point included in block chain,
Until receiving the second result that the object block chain link point returns, wherein the second result is used to indicate the success of third data
It is written in object block chain link point included in block chain.
Optionally, in the present embodiment, if during cochain, cochain is caused due to abnormal outside the systems such as network
Failure, due to the presence of data buffer storage mechanism, can regularly replay data, until data processing success, to improve number
According to the success rate of processing.
As a kind of optional scheme, above-mentioned apparatus further include:
Update module, for the third data with corresponding relationship of record and the first result to be updated to have corresponding pass
The third data and the second result of system.
Optionally, in the present embodiment, failed data are handled after handling successfully, having for record can be corresponded to
The data and processing result of relationship are updated.Optionally, in the present embodiment, since third data have been handled successfully,
The third data of storage can be deleted, to save memory space.
As a kind of optional scheme, above-mentioned apparatus further include:
First sending module, it is right for the target data with corresponding relationship and processing result to be sent to target data institute
The sender for the destination request answered；Alternatively,
Processing module, the inquiry request that the sender for receiving third request sends, wherein inquiry request is for requesting
Inquiry third requests the processing result of the data of write-in block chain；From target data and processing knot with corresponding relationship
Third is obtained in fruit requests corresponding 4th result；4th result is sent to the sender of third request.
Optionally, in the present embodiment, obtained processing result proactive notification can be given to request sender, alternatively,
It can receive the inquiry request that request sender sends, respond the processing knot that the inquiry request is requested the 5th request of inquiry
Fruit is sent to request sender.
As a kind of optional scheme, above-mentioned apparatus further include:
Second sending module, in the case where store the first data failure, the second storage result information of transmission to the
The sender of one request, wherein the second storage result information is used to indicate the first data failure of storage；
Third receiving module, the sender for receiving the first request respond the second storage result information is sent first and ask
It asks.
Optionally, in the present embodiment, if the first data storage has failed, the result of failure can be sent to and is asked
Sender is asked, request sender will retransmit the first request as needed.
The application environment of the embodiment of the present invention can be, but not limited to referring to the application environment in above-described embodiment, the present embodiment
In this is repeated no more.The embodiment of the invention provides the optional tools of one kind of the connection method for implementing above-mentioned real time communication
Body application example.
Timing diagram as shown in Figure 7, as a kind of optional embodiment, above-mentioned data processing method can be, but not limited to answer
In the scene of half synchronization process for cochain request.In this scene, concurrent greatly be total to can be carried based on BFT-RAFT etc.
Know on protocol basis, is dedicated to the technical issues of solving under high concurrent scene, improving using cochain speed.Application layer height simultaneously
In the case where hair, cochain speed is promoted to per second ten thousand grades, and guarantees high cochain success rate.
The half synchronous cochain tupe is suitable for game, and the scene of the needs such as electric business cochain concurrent greatly is solved big
Under concurrent scene, the equilibrium problem between system stability and cochain speed can guarantee in the case where guaranteeing that system is stablized
Maximum cochain speed, to promote user experience.
Partly synchronize chain pattern are as follows: between block chain application layer and the storage of block chain, increase a block chain buffer layer.
This layer receives the request of application, and by request caching to DB or other storages, is then returned to the successful information of application cache,
Asynchronous carry out uplink operation again.Application layer is subsequent can be by inquiring or waiting notice to obtain cochain result.As shown in fig. 7,
Partly synchronize the process of chain pattern the following steps are included:
Step 1, block chain application layer receives the cochain request of user's transmission.
Step 2, block chain application layer performs some processing data.
Step 3, block chain application layer sends cochain request to block chain buffer layer.
Step 4, user is requested temporal cache into application memory by block chain buffer layer, and is returned to block chain application layer
Cache successful information.
Step 5, subsequent block chain buffer layer interacts the request to storage with block chain storage and carries out cochain processing, and receives
The cochain result that the storage of block chain returns.
Step 6, block chain buffer layer updates the cochain result received into application memory.
Step 7, block chain buffer layer is asynchronous notifies cochain result to block chain application layer.
Optionally, in the present embodiment, as follows to the processing of cochain failure: if during cochain, due to network etc.
Fail caused by exception outside system, it, can regularly playback request due to the presence of caching mechanism.
Through the above steps, since the request of buffered in advance application layer cochain can be with spontaneous heavy after cochain failure
Examination improves cochain success rate.Application layer need not wait cochain can wait notices or inquiry to learn as a result, cochain result is subsequent.
The concurrency of application layer can be increased.Concurrency can be effectively controlled by the mode, when application layer faces very big pressure
When, after the request that processing is not come caches, is reset subsequently through additional batch race or script, postpone cochain.From
And guarantee the stability of system.
Another aspect according to an embodiment of the present invention additionally provides a kind of electronics dress for implementing above-mentioned data processing
It sets, as shown in figure 8, the electronic device includes: one or more (only showing one in figure) processors 802, memory 804, passes
Sensor 806, encoder 808 and transmitting device 810 are stored with computer program in the memory, which is arranged to
The step in any of the above-described embodiment of the method is executed by computer program.
Optionally, in the present embodiment, above-mentioned electronic device can be in multiple network equipments of computer network
At least one network equipment.
Optionally, in the present embodiment, above-mentioned processor can be set to execute following steps by computer program:
S1 receives the first request, wherein the first request writes first data into block chain for requesting；
S2, by the storage of the first data into pending data set；
S3 obtains target data from pending data set according to the current data-handling capacity of block chain, wherein mesh
The data volume of mark data is less than or equal to the data volume that block chain currently allows to handle；
Target data is written in block chain S4.
Optionally, it will appreciated by the skilled person that structure shown in Fig. 8 is only to illustrate, electronic device can also
To be smart phone (such as Android phone, iOS mobile phone), tablet computer, palm PC and mobile internet device
The terminal devices such as (Mobile Internet Devices, MID), PAD.Fig. 8 it does not cause to the structure of above-mentioned electronic device
It limits.For example, electronic device may also include more or less component (such as network interface, display device than shown in Fig. 8
Deng), or with the configuration different from shown in Fig. 8.
Wherein, memory 802 can be used for storing software program and module, such as the data processing side in the embodiment of the present invention
Method and the corresponding program instruction/module of device, processor 804 by the software program that is stored in memory 802 of operation and
Module realizes the control method of above-mentioned target element thereby executing various function application and data processing.Memory
802 may include high speed random access memory, can also include nonvolatile memory, as one or more magnetic storage device,
Flash memory or other non-volatile solid state memories.In some instances, memory 802 can further comprise relative to processing
The remotely located memory of device 804, these remote memories can pass through network connection to terminal.The example of above-mentioned network includes
But be not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.
Above-mentioned transmitting device 810 is used to that data to be received or sent via a network.Above-mentioned network specific example
It may include cable network and wireless network.In an example, transmitting device 810 includes a network adapter (Network
Interface Controller, NIC), can be connected by cable with other network equipments with router so as to interconnection
Net or local area network are communicated.In an example, transmitting device 810 is radio frequency (Radio Frequency, RF) module,
For wirelessly being communicated with internet.
Wherein, specifically, memory 802 is for storing application program.
The embodiments of the present invention also provide a kind of storage medium, computer program is stored in the storage medium, wherein
The computer program is arranged to execute the step in any of the above-described embodiment of the method when operation.
Optionally, in the present embodiment, above-mentioned storage medium can be set to store by executing based on following steps
Calculation machine program:
S1 receives the first request, wherein the first request writes first data into block chain for requesting；
S2, by the storage of the first data into pending data set；
S3 obtains target data from pending data set according to the current data-handling capacity of block chain, wherein mesh
The data volume of mark data is less than or equal to the data volume that block chain currently allows to handle；
Target data is written in block chain S4.
Optionally, storage medium is also configured to store for executing step included in the method in above-described embodiment
Computer program, this is repeated no more in the present embodiment.
Optionally, in the present embodiment, those of ordinary skill in the art will appreciate that in the various methods of above-described embodiment
All or part of the steps be that the relevant hardware of terminal device can be instructed to complete by program, the program can store in
In one computer readable storage medium, storage medium may include: flash disk, read-only memory (Read-Only Memory,
ROM), random access device (Random Access Memory, RAM), disk or CD etc..
The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.
If the integrated unit in above-described embodiment is realized in the form of SFU software functional unit and as independent product
When selling or using, it can store in above-mentioned computer-readable storage medium.Based on this understanding, skill of the invention
Substantially all or part of the part that contributes to existing technology or the technical solution can be with soft in other words for art scheme
The form of part product embodies, which is stored in a storage medium, including some instructions are used so that one
Platform or multiple stage computers equipment (can be personal computer, server or network equipment etc.) execute each embodiment institute of the present invention
State all or part of the steps of method.
In the above embodiment of the invention, it all emphasizes particularly on different fields to the description of each embodiment, does not have in some embodiment
The part of detailed description, reference can be made to the related descriptions of other embodiments.
In several embodiments provided herein, it should be understood that disclosed client, it can be by others side
Formula is realized.Wherein, the apparatus embodiments described above are merely exemplary, such as the division of the unit, and only one
Kind of logical function partition, there may be another division manner in actual implementation, for example, multiple units or components can combine or
It is desirably integrated into another system, or some features can be ignored or not executed.Another point, it is shown or discussed it is mutual it
Between coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING or communication link of unit or module
It connects, can be electrical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.
Claims (15)
1. a kind of data processing method characterized by comprising
Receive the first request, wherein first request writes first data into block chain for requesting；
By first data storage into pending data set；
Target data is obtained from the pending data set according to the current data-handling capacity of the block chain, wherein
The data volume of the target data is less than or equal to the data volume that the block chain currently allows to handle；
The target data is written in the block chain.
2. the method according to claim 1, wherein
Described store first data into pending data set includes: the number for currently allowing to handle in the block chain
According to amount be less than or equal to target data amount in the case where, by first data storage to be located at the block chain in wait locate
It manages in data acquisition system；
Obtaining target data from the pending data set according to the current data-handling capacity of the block chain includes:
The block chain currently allows the data volume handled to be converted to by being less than or equal to the target data amount greater than the target
In the case where data volume, the target data is obtained from the pending data set.
3. the method according to claim 1, wherein storing by first data to the pending data
After in set, the method also includes:
In the case where successfully storing first data, the first storage result information is generated, wherein first storage result
Information is used to indicate first data and stores successfully；
Receive the second request, wherein for requesting the block chain is written in the second data by second request；
By second data storage into the pending data set.
4. the method according to claim 1, wherein it in the block chain is written in the target data
Afterwards, the method also includes:
Obtain processing result corresponding with the target data, wherein the processing result, which is used to indicate the target data, is
It is no to be successfully written in object block chain link point included in the block chain；
Record the target data and the processing result with corresponding relationship.
5. according to the method described in claim 4, it is characterized in that, there is the target data and the institute of corresponding relationship in record
After stating processing result, the method also includes:
The 4th data that processing result described in the target data is third result are deleted from the pending data set,
Wherein, the third result is used to indicate the 4th data and is successfully written object block chain link included in the block chain
Point in.
6. according to the method described in claim 4, it is characterized in that, obtaining the processing knot corresponding with the target data
After fruit, the method also includes:
The processing result that record is obtained from the target data of storage is the third data of the first result, wherein institute
It states the first result and is used to indicate the third data and fails and object block chain link point included in the block chain is written
In；
The third data are re-write in object block chain link point included in the block chain, until receiving described
The second result that object block chain link point returns, wherein second result is used to indicate the third data and is successfully written institute
It states in object block chain link point included in block chain.
7. according to the method described in claim 6, it is characterized in that, receiving the second knot that the object block chain link point returns
After fruit, the method also includes:
The third data and first result by record with corresponding relationship are updated to have described in corresponding relationship
Third data and second result.
8. according to the method described in claim 4, it is characterized in that, there is the target data and the institute of corresponding relationship in record
After stating processing result, the method also includes:
By with corresponding relationship the target data and the processing result be sent to target corresponding to the target data
The sender of request；Alternatively,
Receive the inquiry request that the sender of third request sends, wherein the inquiry request inquires the third for requesting
Request to be written the processing result of the data of the block chain；From with corresponding relationship the target data and it is described from
The third, which is obtained, in reason result requests corresponding 4th result；4th result is sent to the transmission of the third request
Side.
9. the method according to claim 1, wherein storing by first data to the pending data
After in set, the method also includes:
In the case where storing first data failure, the transmission of the second storage result information to first request is sent
Side, wherein the second storage result information is used to indicate storage first data failure；
The sender for receiving first request responds first request that the second storage result information is sent.
10. a kind of data processing equipment characterized by comprising
First receiving module, for receiving the first request, wherein first request writes first data into block for requesting
Chain；
First memory module, for storing first data into pending data set；
First obtains module, for being obtained from the pending data set according to the current data-handling capacity of the block chain
Take target data, wherein the data volume of the target data is less than or equal to the data that the block chain currently allows to handle
Amount；
First writing module, for the target data to be written in the block chain.
11. device according to claim 10, which is characterized in that
First memory module is used for: being less than or equal to target data in the data volume that the block chain currently allows to handle
In the case where amount, by first data storage into the pending data set being located in the block chain；
The module that obtains is used for: in the data volume that the block chain currently allows to handle by being less than or equal to the number of targets
In the case where being converted to according to amount greater than the target data amount, the target data is obtained from the pending data set.
12. device according to claim 10, which is characterized in that described device further include:
Generation module, for generating the first storage result information, wherein institute in the case where successfully storing first data
It states the first storage result information and is used to indicate first data and store successfully；
Second receiving module, for receive second request, wherein it is described second request for request will the second data write-in described in
Block chain；
Second memory module, for storing second data into the pending data set.
13. device according to claim 10, which is characterized in that described device further include:
Second obtains module, for obtaining processing result corresponding with the target data, wherein the processing result is for referring to
Show whether the target data is successfully written in object block chain link point included in the block chain；
Logging modle, for recording the target data and the processing result with corresponding relationship.
14. a kind of storage medium, which is characterized in that be stored with computer program in the storage medium, wherein the computer
Program is arranged to execute method described in any one of claim 1 to 9 when operation.
15. a kind of electronic device, including memory and processor, which is characterized in that be stored with computer journey in the memory
Sequence, the processor are arranged to execute side described in any one of claim 1 to 9 by the computer program
Method.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910673636.5A CN110401711B (en) | 2018-08-31 | 2018-08-31 | Data processing method, device, system and storage medium |
| CN201811021844.9A CN109462631B (en) | 2018-08-31 | 2018-08-31 | Data processing method, data processing device, storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811021844.9A CN109462631B (en) | 2018-08-31 | 2018-08-31 | Data processing method, data processing device, storage medium and electronic device |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910673636.5A Division CN110401711B (en) | 2018-08-31 | 2018-08-31 | Data processing method, device, system and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109462631A true CN109462631A (en) | 2019-03-12 |
| CN109462631B CN109462631B (en) | 2021-11-19 |
Family
ID=65606477
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910673636.5A Active CN110401711B (en) | 2018-08-31 | 2018-08-31 | Data processing method, device, system and storage medium |
| CN201811021844.9A Active CN109462631B (en) | 2018-08-31 | 2018-08-31 | Data processing method, data processing device, storage medium and electronic device |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910673636.5A Active CN110401711B (en) | 2018-08-31 | 2018-08-31 | Data processing method, device, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN110401711B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110070444A (en) * | 2019-04-25 | 2019-07-30 | 中钞信用卡产业发展有限公司杭州区块链技术研究院 | A kind of block chain transaction flow management method and relevant apparatus |
| CN110189161A (en) * | 2019-04-26 | 2019-08-30 | 华中科技大学 | For realizing marketing label shared block chain common recognition method and block chain network |
| CN110334148A (en) * | 2019-05-23 | 2019-10-15 | 深圳壹账通智能科技有限公司 | The method and device of data write-in block chain network in enterprise resource planning |
| CN110689909A (en) * | 2019-10-15 | 2020-01-14 | 腾讯科技（深圳）有限公司 | Dubbing information recording method, query method, device and equipment based on block chain |
| CN110716982A (en) * | 2019-09-09 | 2020-01-21 | 平安普惠企业管理有限公司 | Block chain real-time storage method and device, computer equipment and storage medium |
| CN111274258A (en) * | 2020-02-10 | 2020-06-12 | 刘翱天 | Block chain data uplink method |
| CN113032484A (en) * | 2021-03-16 | 2021-06-25 | 中国互联网络信息中心 | Block chain-based data system congestion management method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106411774A (en) * | 2016-09-06 | 2017-02-15 | 联动优势科技有限公司 | Method and device for controlling transaction data volume |
| US20170132625A1 (en) * | 2015-11-05 | 2017-05-11 | Mastercard International Incorporated | Method and system for use of a blockchain in a transaction processing network |
| CN107025289A (en) * | 2017-04-14 | 2017-08-08 | 腾讯科技（深圳）有限公司 | The method and relevant device of a kind of data processing |
| US20170243025A1 (en) * | 2016-02-22 | 2017-08-24 | Bank Of America Corporation | System for external validation of distributed resource status |
| CN107395665A (en) * | 2017-05-22 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of block chain service handling and business common recognition method and device |
| CN107508863A (en) * | 2017-07-27 | 2017-12-22 | 北京瑞卓喜投科技发展有限公司 | Information processing method and device applied to block chain |
| CN107528882A (en) * | 2017-07-14 | 2017-12-29 | 阿里巴巴集团控股有限公司 | The method, apparatus and electronic equipment of processing common recognition request in block chain common recognition network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106446067B (en) * | 2016-09-06 | 2020-02-18 | 联动优势科技有限公司 | Method and device for acquiring transaction data |
| CN106372868B (en) * | 2016-09-06 | 2020-02-18 | 联动优势科技有限公司 | Verification method and device for transaction data written into block chain |
| CN107767127A (en) * | 2017-10-23 | 2018-03-06 | 中国联合网络通信集团有限公司 | Exchange information processing method and device in block chain |
-
2018
- 2018-08-31 CN CN201910673636.5A patent/CN110401711B/en active Active
- 2018-08-31 CN CN201811021844.9A patent/CN109462631B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170132625A1 (en) * | 2015-11-05 | 2017-05-11 | Mastercard International Incorporated | Method and system for use of a blockchain in a transaction processing network |
| US20170243025A1 (en) * | 2016-02-22 | 2017-08-24 | Bank Of America Corporation | System for external validation of distributed resource status |
| CN106411774A (en) * | 2016-09-06 | 2017-02-15 | 联动优势科技有限公司 | Method and device for controlling transaction data volume |
| CN107025289A (en) * | 2017-04-14 | 2017-08-08 | 腾讯科技（深圳）有限公司 | The method and relevant device of a kind of data processing |
| CN107395665A (en) * | 2017-05-22 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of block chain service handling and business common recognition method and device |
| CN107528882A (en) * | 2017-07-14 | 2017-12-29 | 阿里巴巴集团控股有限公司 | The method, apparatus and electronic equipment of processing common recognition request in block chain common recognition network |
| CN107508863A (en) * | 2017-07-27 | 2017-12-22 | 北京瑞卓喜投科技发展有限公司 | Information processing method and device applied to block chain |
Non-Patent Citations (2)
| Title |
|---|
| LUYU LI; HOUXIANG JI: ""Favorable Block First: A Comprehensive Cache Scheme to Accelerate Partial Stripe Recovery of Triple Disk Failure Tolerant Arrays"", 《2017 46TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP)》 * |
| 徐蕾: ""基于区块链的云取证系统研究与实现"", 《中国优秀硕士学位论文全文数据库（电子期刊）信息科技辑》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110070444A (en) * | 2019-04-25 | 2019-07-30 | 中钞信用卡产业发展有限公司杭州区块链技术研究院 | A kind of block chain transaction flow management method and relevant apparatus |
| CN110189161A (en) * | 2019-04-26 | 2019-08-30 | 华中科技大学 | For realizing marketing label shared block chain common recognition method and block chain network |
| CN110189161B (en) * | 2019-04-26 | 2022-06-17 | 华中科技大学 | Block chain consensus method and system for realizing marketing label sharing |
| CN110334148A (en) * | 2019-05-23 | 2019-10-15 | 深圳壹账通智能科技有限公司 | The method and device of data write-in block chain network in enterprise resource planning |
| CN110716982A (en) * | 2019-09-09 | 2020-01-21 | 平安普惠企业管理有限公司 | Block chain real-time storage method and device, computer equipment and storage medium |
| CN110716982B (en) * | 2019-09-09 | 2024-02-02 | 深圳点链科技有限公司 | Block chain real-time storage method, device, computer equipment and storage medium |
| CN110689909A (en) * | 2019-10-15 | 2020-01-14 | 腾讯科技（深圳）有限公司 | Dubbing information recording method, query method, device and equipment based on block chain |
| CN110689909B (en) * | 2019-10-15 | 2021-10-29 | 腾讯科技（深圳）有限公司 | Dubbing information recording method, query method, device and equipment based on block chain |
| CN111274258A (en) * | 2020-02-10 | 2020-06-12 | 刘翱天 | Block chain data uplink method |
| CN113032484A (en) * | 2021-03-16 | 2021-06-25 | 中国互联网络信息中心 | Block chain-based data system congestion management method and system |
| CN113032484B (en) * | 2021-03-16 | 2024-01-02 | 中国互联网络信息中心 | Block chain-based data system congestion management method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109462631B (en) | 2021-11-19 |
| CN110401711A (en) | 2019-11-01 |
| CN110401711B (en) | 2021-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109462631A (en) | Data processing method, device, storage medium and electronic device | |
| CN104820701B (en) | Data record and synchronous method and system | |
| CN109327539A (en) | A kind of distributed block storage system and its data routing method | |
| CN105553993B (en) | A kind of remote service calling method, device and server | |
| CN105337923B (en) | Data distributing method and system and data sending device and data sink | |
| CN110300115A (en) | A kind of data transmission method and relevant apparatus based on multichannel | |
| CN110290217A (en) | Processing method and processing device, storage medium and the electronic device of request of data | |
| CN105264930B (en) | Sending node and its reporting cached state method | |
| CN104202387B (en) | A kind of metadata restoration methods and relevant apparatus | |
| CN106506715A (en) | Domain name analytic method and device | |
| CN106101264A (en) | Content distributing network daily record method for pushing, device and system | |
| CN105897850A (en) | Response processing method and system and scheduling proxy server for CDN platform | |
| CN108737500A (en) | Target resource acquisition, providing method, device, storage medium and computer equipment | |
| CN108696581A (en) | Caching method, device, computer equipment and the storage medium of distributed information | |
| CN108833479A (en) | A kind of method of data synchronization and device | |
| CN103546771B (en) | A kind of TV programme comment processing method and system based on intelligent terminal | |
| CN105357271B (en) | A kind of information processing method and corresponding intrument | |
| CN108600281A (en) | A kind of cloud storage system, media data storage method and system | |
| CN108347459A (en) | A kind of high in the clouds data quick storage method and device | |
| CN107231400A (en) | The synchronous method and device of a kind of data | |
| CN105871955A (en) | Distributed file system-based processing method, server and client | |
| CN110351569A (en) | A kind of live content processing method, device, equipment and medium | |
| CN109241128A (en) | A kind of expired events automatic trigger method and system | |
| CN105893429A (en) | Method and system for optimizing WEB cache | |
| CN110339571A (en) | Event generation method and device, storage medium and electronic device |
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 |