CN109428906A - Request processing method, device, system and terminal - Google Patents
Request processing method, device, system and terminal Download PDFInfo
- Publication number
- CN109428906A CN109428906A CN201710724782.7A CN201710724782A CN109428906A CN 109428906 A CN109428906 A CN 109428906A CN 201710724782 A CN201710724782 A CN 201710724782A CN 109428906 A CN109428906 A CN 109428906A
- Authority
- CN
- China
- Prior art keywords
- block
- request
- data
- block chain
- account
- 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
-
- 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/104—Peer-to-peer [P2P] networks
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the invention provides a kind of request processing method, device, system and terminals.The embodiment of the present invention is by being arranged at least one block chain in specified network, and block account is screened the corresponding request of data of this account and is handled out, one is enabled to go out block account output 1 or more block simultaneously, and enables and the block account that goes out in the different nodes in network is specified to go out block parallel, therefore improve whole network goes out block speed, and then improve the treatment effeciency of whole network, it solves in the prior art that the request processing network based on block chain goes out that block speed is slow to a certain extent, leads to the problem that treatment effeciency is lower.
Description
[technical field]
This programme is related to the communications field more particularly to a kind of request processing method, device, system and terminal.
[background technique]
Block chain is a kind of a kind of chain type number for being sequentially in time combined into data block in such a way that sequence is connected
According to structure, it guarantees that data can not be distorted and can not be forged in a manner of cryptography.
Request processing network based on block chain is P2P (Peer-to-Peer, equity) network of a decentralization, should
It include block account and non-block account out in network.Wherein, block account has block permission out, and block refers to creation block chain most out
New block, and data information (such as Transaction Information) is recorded in the newest block.Non- block account out does not go out block permission.
In the prior art, the request processing network based on block chain only has a block chain, and each block only corresponds to one
It is a have block permission go out block account, that is to say, that cannot there are two or it is more than two go out block account have to same
Block goes out block permission.Assuming that request processing network has 5 nodes, wherein the account on 3 nodes is block account, respectively
Out block account A, go out block account B and block account C out, block chain Chain0 is used to record the data letter in request processing network
Breath, block account A has the 2nd block Block2's of block chain Chain0 to go out block permission out, and block account B has block chain out
The 3rd block Block2's of Chain0 goes out block permission, and block account C has the 4th block Block2 of block chain Chain0 out
Go out block permission (assuming that known in advance with each block go out block permission account).So, the request of the network is processed
Cheng Shi:
At the t1 moment, request of data existing for the t1 moment is recorded in block Block2 as going out block account A, that is, is gone out
Block account A output block Block2, other nodes being then sent to block Block2 in network；
T2 (t2 is greater than t1) moment after block operation is completed out in block account A out, as going out block account B to existing for the t2 moment
(record includes the t1 moment to the request of data newly increased between the t2 moment to request of data record, it is also possible to be included in the t1 moment
Due to the request of data that request of data total amount is more than the maximum size of block and is not handled) into block Block3, also
It is block account B output block Block3 out, other nodes being then sent to block Block3 in network；
T3 (t3 is greater than t2) moment after block operation is completed out in block account B out, as going out block account C to existing for the t3 moment
Request of data is recorded in block Block4, that is, block account C output block Block4 out, then sends block Block4
To other nodes in network.
As it can be seen that can only there is one to go out block account in the same time in the prior art and execute out block operation, that is, one goes out
Block account one goes out block with going out block account, and whole network goes out the process that block process is a serial block out, therefore block speed out
Slowly, cause treatment effeciency lower.
[summary of the invention]
In view of this, this programme embodiment provides a kind of request processing method, device, system and terminal, to solve
The request processing network based on block chain goes out that block speed is slow in the prior art, leads to the problem that treatment effeciency is lower.
In a first aspect, this programme embodiment provides a kind of request processing method, go out block account applied in specified network
The node at place, the specified network have at least one block chain, and each block in the specified network is both provided with institute
Belong to the block chain identification information of block chain, which comprises
From currently pending all request of data, according to specified screening conditions, screening originally goes out the corresponding institute of block account
There is request of data, as the first request of data, and determines the corresponding target block chain of first request of data；
Selection originally goes out this request of data to be processed of block account from first request of data, asks as the second data
It asks；
New block is created in the target block chain, institute is recorded in the corresponding data information of second request of data
It states in new block；
The new block is sent to other nodes in the specified network.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, from currently to from
In all request of data of reason, this goes out the corresponding all request of data of block account for screening, as the first request of data, and determines
The corresponding target block chain of first request of data, comprising:
For each request of data to be processed, the input address of the request of data is obtained, is calculated based on consistency Hash
Method carries out operation to the input address of the request of data, obtains operation result, according to the operation result, determine the number
According to the corresponding block chain of request；
It obtains this and goes out block account with block chain belonging to the block for going out block permission, as target block chain；
According to the corresponding block chain of all request of data to be processed, select corresponding block chain for the target block chain
Request of data, as the first request of data.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation is based on consistency
Hash algorithm carries out operation to the input address of the request of data, obtains operation result, comprising: to the request of data
Input address carries out the complementation operation of consistency Hash, obtains complementation result；
According to the operation result, the corresponding block chain of the request of data is determined, comprising: determine the complementation result institute
The key value subrange of category；The corresponding block chain of the key value subrange is searched, by the key value subrange pair
The block chain answered is as the corresponding block chain of the request of data.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the method is also
Include:
Whether judgement currently meets dilatation condition；
When currently meeting the dilatation condition, first block of new block chain and the new block chain is added.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation meets currently
When the dilatation condition, first block of new block chain and the new block chain is added, comprising:
The block account out for going out block permission for searching the currently block with first block chain, goes out block account as dilatation,
First block chain is the block chain generated at first in network；
When the dilatation goes out block account and goes out block account for this, new block chain is created, and create the of the new block chain
One block；
Other nodes first block being sent in the specified network.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation meets currently
When the dilatation condition, first block of new block chain and the new block chain is added, comprising:
The block account out for going out block permission for searching the currently block with first block chain, goes out block account as dilatation,
First block chain is the block chain generated at first in network；
When it is that this goes out block account that the dilatation, which goes out block account not, the new block chain that the dilatation goes out block account creation is received
First block, and the new block chain is added according to first block.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, each block chain
With corresponding key value subrange, the key value subrange belongs to key value total size, and the key value is total
Range is the range of all input address that can issue request of data obtained key value after specifying operation；
When currently meeting the dilatation condition, add new block chain and the new block chain first block it
Afterwards, the method also includes:
Obtain key value total size and block chain quantity；
According to the block chain quantity, the key value total size is divided into several key value subranges；
According to assignment of allocation rule, several key value subranges are distributed into each block chain.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, judgement are currently
It is no to meet dilatation condition, comprising:
Judge whether the block total amount of block to be detected reaches amount threshold, the block to be detected refers to from last dilatation
From when detection, by the end of block generated in the period at current time；
When the block total amount reaches the amount threshold, counting block size in the block to be detected is more than capacity
The number of blocks of the block of threshold value；
When the ratio that the number of blocks accounts for the block total amount is more than the first proportion threshold value, determines and currently meet dilatation
Condition；When the ratio that the number of blocks accounts for the block total amount is less than first proportion threshold value, determine current discontented
The foot dilatation condition.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, judgement are currently
It is no to meet dilatation condition, comprising:
Judge that last dilatation detects whether the time span at current time reaches designated value；
When whether the time span reaches the designated value, the block total amount of block to be detected is counted, it is described to be checked
Block is surveyed to refer to last dilatation detection, by the end of block generated in the period at current time；
Obtain the number of blocks that block size in the block to be detected is more than the block of capacity threshold；
When the ratio that the number of blocks accounts for the block total amount is more than the second proportion threshold value, determines and currently meet dilatation
Condition；When the ratio that the number of blocks accounts for the block total amount is less than second proportion threshold value, determine current discontented
The foot dilatation condition.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, judgement are currently
It is no to meet dilatation condition, comprising:
It votes and applies in response to dilatation, receive ballot；
It counts in all ballots, agrees to the digital cash quantity that the account of dilatation possesses；
When the ratio that the digital cash quantity accounts for digital cash total amount in the whole network is more than third proportion threshold value, determination is worked as
Before meet dilatation condition；Alternatively, the ratio for accounting for digital cash total amount in the whole network when the digital cash quantity is less than described the
When three proportion threshold values, determination is currently unsatisfactory for the dilatation condition.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, from described first
Selection originally goes out the secondary request of data being recorded in block of block account sheet in request of data, as the second request of data, comprising:
Legitimacy verifies are carried out to each first request of data, obtain all the first legal request of data；
Count the data volume of all legal corresponding data informations of the first request of data；
When the data volume is less than block maximum size value, all the first legal request of data are selected, as the
Two request of data；Alternatively, when the data volume is more than the block maximum size value, from all the first legal request of data
A part of first request of data of middle selection, as the second request of data, the data volume of a part of first request of data does not surpass
Cross the block maximum size value.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the specified sieve
Select condition are as follows: a request of data corresponding one goes out block account, and the corresponding target block chain of a request of data.
Second aspect, this programme embodiment provide a kind of request processing unit, are set in specified network and go out block account
The node at place, the specified network have at least one block chain, and each block in the specified network is both provided with institute
Belong to the block chain identification information of block chain, described device includes:
Screening and determining module, for from currently pending all request of data, it is corresponding that screening originally goes out block account
All request of data as the first request of data, and determine the corresponding target block chain of first request of data；
Selecting module, for selecting this to go out this request of data to be processed of block account from first request of data,
As the second request of data；
Block module out, for creating new block in the target block chain, by the corresponding number of second request of data
It is believed that breath is recorded in the new block；
Sending module, other nodes for being sent to the new block in the specified network.
The third aspect, this programme embodiment provide a kind of terminal, and the terminal is provided at request described in second aspect
Manage device.
Fourth aspect, this programme embodiment provide a kind of demand processing system, described more the system comprises multiple nodes
Point-to-point communication is able to carry out between any two node in a node, each node in the multiple node is provided with
Request processing unit described in two aspects.
The embodiment of the present invention has the advantages that
The embodiment of the present invention, by the way that at least one block chain is arranged in specified network, and block account screens this account out
The corresponding request of data in family is handled, and enables one to go out block account output 1 or more block simultaneously, and to refer to
The block account out determined in the different nodes in network can go out block parallel, therefore improve the block speed out of whole network, in turn
Improve the treatment effeciency of whole network.
[Detailed description of the invention]
It, below will be to needed in the embodiment attached in order to illustrate more clearly of the technical solution of this programme embodiment
Figure is briefly described, it should be apparent that, the accompanying drawings in the following description is only some embodiments of this programme, for this field
For those of ordinary skill, without any creative labor, it can also be obtained according to these attached drawings other attached
Figure.
Fig. 1 is the first pass exemplary diagram of request processing method provided in an embodiment of the present invention.
Fig. 2 is the second procedure exemplary diagram of request processing method provided in an embodiment of the present invention.
Fig. 3 is the functional block diagram of request processing unit provided in an embodiment of the present invention.
[specific embodiment]
In order to better understand the technical solution of this programme, this programme embodiment is retouched in detail with reference to the accompanying drawing
It states.
It will be appreciated that described embodiment is only this programme a part of the embodiment, instead of all the embodiments.Base
Embodiment in this programme, it is obtained by those of ordinary skill in the art without making creative efforts it is all its
Its embodiment belongs to the range of this programme protection.
The term used in this programme embodiment is only to be not intended to be limiting merely for for the purpose of describing particular embodiments
This programme.In this programme embodiment and the "an" of singular used in the attached claims, " described " and "the"
It is also intended to including most forms, unless the context clearly indicates other meaning.
It should be appreciated that term "and/or" used herein is only a kind of incidence relation for describing affiliated partner, indicate
There may be three kinds of relationships, for example, A and/or B, can indicate: individualism A, exist simultaneously A and B, individualism B these three
Situation.In addition, character "/" herein, typicallys represent the relationship that forward-backward correlation object is a kind of "or".
Depending on context, word as used in this " if " can be construed to " ... when " or " when ...
When " or " in response to determination " or " in response to detection ".Similarly, depend on context, phrase " if it is determined that " or " if detection
(condition or event of statement) " can be construed to " when determining " or " in response to determination " or " when the detection (condition of statement
Or event) when " or " in response to detection (condition or event of statement) ".
Embodiment one
Fig. 1 is the first pass exemplary diagram of request processing method provided in an embodiment of the present invention.In the present embodiment, at request
Reason method is applied to the node gone out where block account in specified network, wherein specified network has at least one block chain, refers to
Determine the block chain identification information that each block in network is both provided with affiliated block chain.As shown in Figure 1, request processing method can
To include the following steps:
S101, from currently pending all request of data, according to specified screening conditions, it is corresponding that screening originally goes out block account
All request of data, as the first request of data, and determine the corresponding target block chain of the first request of data.
S102, selection originally goes out this request of data to be processed of block account from the first request of data, as the second data
Request.
S103 creates new block in target block chain, and new district is recorded in the corresponding data information of the second request of data
In block.
S104, other nodes new block being sent in specified network.
Wherein, specified network can be the processing network of the request based on block chain, for example, trade network.
Since specified network has at least one block chain, every block chain has the block of a block, therefore, tool
The quantity for going out block account for having block permission out is at least one.It can be held in this way, at least one will be existed simultaneously and go out block account
Row goes out block operation, that is to say, that request of data can be handled by existing simultaneously at least one and going out block account.
Wherein, during an illustrative realization, screening conditions are specified are as follows: a request of data corresponding one goes out block
Account, and the corresponding target block chain of a request of data.
Each node of specified network has the caching of oneself, specifies all request of data currently pending in network
It is all stored on the caching of each node.In this way, the account on node can currently have by the caching of place node to know
Which request of data to be processed.
In this way, it is necessary to by currently pending all request of data according to certain method of salary distribution, distribute to current each
A block account out go out with block permission.Specifically go out from the perspective of block account from one, it is necessary to from currently pending
Needs are picked out in all request of data, and those of block account processing request of data is gone out by this.Step S101 " from currently to from
In all request of data of reason, according to specified screening conditions, this goes out the corresponding all request of data of block account for screening, as first
Request of data " just solves this problem, and therefore, by step S101, this, which goes out block account, has picked out this is currently returned to go out block account
The total data request of family processing.
By step S101, the corresponding target block chain of the first request of data is further defined.
It should be noted that the quantity of target block chain can be 1,1 can also be greater than.That is, this goes out block account
Can currently have a block goes out block permission, can also go out block permission there are two the above block.Work as if this goes out block account
Preceding to go out block permission there are two the above block, which is belonging respectively to different block chains, at this point, one first number
According to a corresponding target block chain is requested, same first request of data cannot correspond to two or more target block chains.
It illustrates.Block account A currently has the block Block5's of block chain Chain1 to go out block permission and block out
The block Block6's of chain Chain2 goes out block permission.Request of data 2, request of data 4, request of data 6, request of data 8, data are asked
Ask 10, request of data 12 be screen go out the corresponding request of data of block account A, wherein request of data 2, request of data 6,
The corresponding target block chain of request of data 10 is block chain Chain1, and request of data 4, request of data 8, request of data 12 are corresponding
Target block chain is block chain Chain2.
In step S102, from the first request of data selection this go out this request of data to be processed of block account, as the
Two request of data.The main purpose of the step is that the request of data not by legitimacy verifies is removed from the first request of data,
And guarantee appearance of the data volume without departing from respective block of this corresponding data information of each block request of data to be recorded
Amount.
It illustrates.Assuming that block account B currently has the block Block7's of block chain Chain3 to go out block permission out.Data
Request 1, request of data 2 ... request of data 9, request of data 10 be screen go out the corresponding request of data of block account B,
Also, the corresponding target block chain of request of data 1~10 is block chain Chain3.Assuming that legal to the progress of request of data 1~10
Property verification after, request of data 9 is illegal, and request of data 1~8 and request of data 10 are legal；Further judge request of data 1~8
Whether exceed the capacity of the block Block7 of block chain Chain3 with the total amount of data of the corresponding data information of request of data 10, such as
Fruit without departing from, then request of data 1~8 and request of data 10 be all out block account B this processing request of data, if exceeded,
One or more request of data are then removed from request of data 1~8 and request of data 10, so that remaining request of data is corresponding
The capacity of block Block7 of the total amount of data of data information less than block chain Chain3, it is assumed that the corresponding number of request of data 1~8
It is believed that the capacity of block Block7 of the total amount of data of breath less than block chain Chain3, then request of data 10 is just left on caching
In request of data to be processed suffer.It in other embodiments, can also be by the total data of the corresponding data information of request of data
Amount is compared with block maximum size value, this processing how many request of data determined.
During an illustrative realization, select originally block account sheet is secondary out area is recorded from the first request of data
Request of data in block may include: to carry out legitimacy verifies to each first request of data, obtain as the second request of data
Obtain all the first legal request of data；Count the corresponding data information data amount of all the first legal request of data；In number
When being less than block maximum size value according to amount, all the first legal request of data are selected, as the second request of data；Alternatively,
When data volume is more than block maximum size value, a part of first data is selected to ask from all the first legal request of data
It asks, as the second request of data, the data volume of a part of first request of data is no more than block maximum size value.
By step S103, this goes out block account and handles the second request of data.It should be noted that if target area
Block chain has two or more, then, step S103 specifically: create new block in each target block chain, the second data are asked
Corresponding data information is asked to be recorded in the new block of corresponding target block chain.
With block permission and the area out that go out block account A and currently there is the block Block5 of block chain Chain1 of aforementioned citing
The case where block permission out of the block Block6 of block chain Chain2, illustrates.Due to request of data 2, request of data 6, request of data
10 corresponding target block chains are block chain Chain1, request of data 4, request of data 8, the corresponding target block of request of data 12
Chain is block chain Chain2, therefore, block Block5 is created in block chain Chain1, by request of data 2, request of data 6, number
It is recorded in the block Block5 of block chain Chain1 according to 10 corresponding data informations of request, creates area in block chain Chain2
The area of block chain Chain2 is recorded in request of data 4, request of data 8, the corresponding data information of request of data 12 by block Block6
In block Block6.It can be seen that this goes out block account, this goes out quantity of the quantity equal to target block amount of block, if target block
The quantity of amount is greater than 1, then this goes out block account, this goes out the quantity of block also greater than 1, that is to say, that one goes out block account and once goes out
The quantity of block can be greater than 1.In this way, increasing the quantity that single block account out once goes out block, individually go out block to improve
Account goes out block speed.Or it may also be said that the quantity that individual node once goes out block is increased, to improve individual node
Block speed out.
By step S104, this goes out block account and new block is sent to other nodes in specified network, in this way, other are saved
New block can be synchronized in the block chain locally saved by point, and the account in other nodes is made to know updated area
Block chain information.
The block account that goes out in each node in specified network can be right by executing step in embodiment illustrated in fig. 1
Request of data is handled, moreover, the block account out in different nodes can parallel be handled request of data, to realize
Go out block parallel.In this way, just improving the block speed out of entire specified network.
Block speed is faster out, illustrates that processed request of data is more in the unit time, therefore the embodiment of the present invention passes through
Block speed is improved out, the treatment effeciency of request of data is improved.
Embodiment illustrated in fig. 1, by the way that at least one block chain is arranged in specified network, and block account screens this account out
The corresponding request of data in family is handled, and enables one to go out block account output 1 or more block simultaneously, and to refer to
The block account out determined in the different nodes in network can go out block parallel, therefore improve the block speed out of whole network, in turn
Improve the treatment effeciency of whole network.
During an illustrative realization, from currently pending all request of data, screening originally goes out block account
Corresponding all request of data as the first request of data, and determine the corresponding target block chain of the first request of data, can be with
Include: that the input address of request of data is obtained for each request of data to be processed, is based on consistency hash algorithm, logarithm
Operation is carried out according to the input address of request, operation result is obtained, according to operation result, determines the corresponding block chain of request of data；
It obtains this and goes out block account with block chain belonging to the block for going out block permission, as target block chain；Owned according to be processed
The corresponding block chain of request of data selects corresponding block chain for the request of data of target block chain, as the first request of data.
During an illustrative realization, it is based on consistency hash algorithm, the input address of request of data is carried out
Operation obtains operation result, comprising: carries out the complementation operation of consistency Hash to the input address of request of data, obtains complementation knot
Fruit；According to operation result, the corresponding block chain of request of data is determined, comprising: determine the sub- model of key value belonging to complementation result
It encloses；The corresponding block chain of search key value subrange, using the corresponding block chain of key value subrange as request of data pair
The block chain answered.
The expression formula for carrying out the complementation operation of consistency Hash to the input address of request of data is as follows:
Key=Mode (Hash (Address))
Wherein, Key is keyword；Address is the input address of request of data, i.e. the ground of the node of sending request of data
Location；Mode (Hash (Address)) indicates to carry out the complementation operation of consistency Hash to Address.
Assuming that the total size of key value Key is 1~1000, share in network four block chain Chain0, Chain1,
The corresponding key value subrange of Chain2 and Chain3, block chain Chain0 is 1~250, the corresponding pass block chain Chain1
Key word value subrange is 251~500, and the corresponding key value subrange of block chain Chain2 is 501~750, block chain
The corresponding key value subrange of Chain3 is 751~1000.If the input address of request of data 1 is Address 1, it is assumed that
1 consistency Hash complementation operation of Address is 5, i.e. Key=Mode (Hash (Address1))=5, then, belong to due to 5
Key value subrange 1~250, and the corresponding block chain Chain0 of key value subrange 1~250, therefore, request of data 1 is right
Answer block chain Chain0.Similarly, it may be determined that the corresponding block chain of each request of data.
By the above process, it is determined that the corresponding relationship of each request of data and block chain.Assuming that this, which goes out block account, has
Block chain belonging to the block of block permission is block chain Chain0 and block chain Chain2 out, then block chain Chain0 and block
Chain Chain2 is target block chain, and the request of data of the request of data of corresponding block chain Chain0 and corresponding block chain Chain2 are all
It is the first request of data.
Consistency hash algorithm ensure that the input of the same address in certain period of time is fixed on a block chain,
The limitation that the request of data of the same address is serialized prevents " honeysuckle " phenomenon, ensure that data request processing
Accuracy.
Fig. 2 is the second procedure exemplary diagram of request processing method provided in an embodiment of the present invention.In the present embodiment, at request
Reason method is applied to the node gone out where block account in specified network, wherein specified network has at least one block chain, refers to
Determine the block chain identification information that each block in network is both provided with affiliated block chain.As shown in Fig. 2, request processing method can
To include the following steps:
S201, from currently pending all request of data, according to specified screening conditions, it is corresponding that screening originally goes out block account
All request of data, as the first request of data, and determine the corresponding target block chain of the first request of data.
S202, selection originally goes out this request of data to be processed of block account from the first request of data, as the second data
Request.
S203 creates new block in target block chain, and new district is recorded in the corresponding data information of the second request of data
In block.
S204, other nodes new block being sent in specified network.
Whether S205, judgement currently meet dilatation condition.
S206 adds first block of new block chain and new block chain when currently meeting dilatation condition.
It should be noted that the step number in the embodiment of the present invention do not represent step execute sequence.Therefore, step
S205 and S206 is not necessarily executed after step s 204.
Wherein, dilatation, which refers to, increases new block chain.
Each of specified network goes out block account when handling request of data, also judges whether need dilatation, such as
Fruit needs, then also carries out dilatation processing.
During an illustrative realization, new block chain caused by dilatation is by currently having first block chain
Block go out block permission go out block account to create.That is, currently which goes out block account with first block chain
Block go out block permission, block account is just gone out by which and operate to execute the creation of new block chain, it is current without first area
Other of block permission of going out of the block of block chain go out block account and can obtain first of new block chain by way of receiving broadcast
Block.
During an illustrative realization, when currently meeting dilatation condition, new block chain and new block are added
First block of chain may include: the block account out for going out block permission for searching the currently block with first block chain, make
Go out block account for dilatation, first block chain is the block chain generated at first in network；Go out block account in dilatation and goes out block account for this
When family, new block chain is created, and create first block of new block chain；First block is sent to its in specified network
His node.Go out when the going out block permission of block that block account currently has first block chain at this, it is new that this goes out block account creation
Block chain and its first block, and other nodes being sent in specified network.
During an illustrative realization, when currently meeting dilatation condition, new block chain and new block are added
First block of chain may include: the block account out for going out block permission for searching the currently block with first block chain, make
Go out block account for dilatation, first block chain is the block chain generated at first in network；Going out block account not in dilatation is that this goes out block
When account, first block that dilatation goes out the new block chain of block account creation is received, and new block is added according to first block
Chain.Go out when the going out block permission of block that block account does not have first block chain currently at this, this goes out block account and passes through reception
First block of new block chain add new block chain.
During an illustrative realization, each block chain has corresponding key value subrange, key value
Subrange belongs to key value total size, and key value total size is all input address that can issue request of data by referring to
Determine the range of obtained key value after operation；When currently meeting dilatation condition, new block chain and new block chain are added
First block after, request processing method can also include: to obtain key value total size and block chain quantity；According to area
Key value total size is divided into several key value subranges by block chain quantity；According to assignment of allocation rule, by several keys
Word value subrange distributes to each block chain.I.e. after dilatation, need to be redistributed according to the block chain quantity after dilatation
Key value subrange corresponding to each block chain.
Wherein, assignment of allocation rule can be mean allocation.
It illustrates.Assuming that the total size of key value Key is 1~1000, four areas are shared in network before dilatation
Block chain Chain0, Chain1, Chain2 and Chain3, the corresponding key value subrange of block chain Chain0 are 1~250, area
The corresponding key value subrange of block chain Chain1 is 251~500, and the corresponding key value subrange of block chain Chain2 is
The corresponding key value subrange of 501~750, block chain Chain3 is 751~1000.Five are shared after dilatation, in network
Block chain Chain0, Chain1, Chain2, Chain3 and Chain4, wherein Chain4 is new block chain.It is redistributed after dilatation
Key value subrange may is that block chain Chain0 correspond to key value subrange be 1~200, Chain1 pairs of block chain
Answering key value subrange is 201~400, and it is 401~600 that block chain Chain2, which corresponds to key value subrange, block chain
It is 601~800 that Chain3, which corresponds to key value subrange, and it is 801~1000 that block chain Chain4, which corresponds to key value subrange,.
Wherein, dilatation condition can be set as needed.
One it is illustrative realize during, whether judgement currently meets dilatation condition, may include: judge it is to be detected
Whether the block total amount of block reaches amount threshold, and block to be detected refers to from last dilatation detection, when current
Generated block in the period at quarter；When block total amount reaches amount threshold, it is super to count block size in block to be detected
The number of blocks of the block of overcapacity threshold value；When the ratio of number of blocks occupied area block total amount is more than the first proportion threshold value, determine
Currently meet dilatation condition；When the ratio of number of blocks occupied area block total amount is less than the first proportion threshold value, determine current discontented
Sufficient dilatation condition.This example detects whether to need dilatation when the block of generation reaches certain amount.
During an illustrative realization, whether judgement currently meets dilatation condition, may include: that judgement is last
Dilatation detects whether the time span at current time reaches designated value；When whether time span reaches designated value, statistics to
The block total amount of block is detected, block to be detected refers to from last dilatation detection, by the end of in the period at current time
Generated block；Obtain the number of blocks that block size in block to be detected is more than the block of capacity threshold；Work as number of blocks
When the ratio of occupied area block total amount is more than the second proportion threshold value, determines and currently meet dilatation condition；When number of blocks occupied area block total amount
Ratio when being less than the second proportion threshold value, determine and be currently unsatisfactory for dilatation condition.This example is in separated in time, detection
Whether dilatation is needed.
During an illustrative realization, it may include: in response to dilatation that whether judgement, which currently meets dilatation condition,
Ballot application, receives ballot；It counts in all ballots, agrees to the digital cash quantity that the account of dilatation possesses；Work as digital cash
When the ratio that quantity accounts for digital cash total amount in the whole network is more than third proportion threshold value, determines and currently meet dilatation condition；Alternatively, working as
When the ratio that digital cash quantity accounts for digital cash total amount in the whole network is less than third proportion threshold value, determines and be currently unsatisfactory for dilatation
Condition.This example detects whether to need dilatation when there is dilatation ballot application.
Embodiment illustrated in fig. 2 on the basis of embodiment shown in Fig. 1, can increase new block chain, be asked with extension to data
The processing capacity asked, so as to further increase out block speed by increasing new block chain, in turn when request of data increases
Improve treatment effeciency.
Request processing method provided in an embodiment of the present invention, by the way that at least one block chain is arranged in specified network, with
And block account is screened the corresponding request of data of this account and is handled out, enable one go out block account simultaneously output 1 with
On block, and enable the block account that goes out in the different nodes in specified network to go out block parallel, therefore improve entire
Network goes out block speed, and then improves the treatment effeciency of whole network.
Embodiment two
The embodiment of the invention also provides a kind of request processing unit, which can be realized previous embodiment
Each step of request processing method in one.
Fig. 3 is the functional block diagram of request processing unit provided in an embodiment of the present invention.In the present embodiment, request processing dress
The node gone out where block account being placed in specified network is installed, specifies network that there is at least one block chain, is specified in network
Each block be both provided with belonging to block chain block chain identification information, as shown in figure 3, request processing unit may include:
Screening and determining module 310, for from currently pending all request of data, it is corresponding that screening originally goes out block account
All request of data, as the first request of data, and determine the corresponding target block chain of the first request of data；
Selecting module 320 is made for selecting this to go out this request of data to be processed of block account from the first request of data
For the second request of data；
Block module 330 out, for creating new block in target block chain, by the corresponding data information of the second request of data
It is recorded in new block；
Sending module 340, other nodes for being sent to new block in specified network.
One it is illustrative realize during, screening and determining module 310 are for from currently pending all numbers
According in request, this goes out the corresponding all request of data of block account for screening, as the first request of data, and determines that the first data are asked
When seeking corresponding target block chain, it is specifically used for: for each request of data to be processed, with obtaining the input of request of data
Location is based on consistency hash algorithm, carries out operation to the input address of request of data, obtains operation result, according to operation result,
Determine the corresponding block chain of request of data；It obtains this and goes out block account with block chain belonging to the block for going out block permission, as mesh
Mark block chain；According to the corresponding block chain of all request of data to be processed, select corresponding block chain for target block chain
Request of data, as the first request of data.
During an illustrative realization, screening and determining module 310 are being used to be based on consistency hash algorithm, right
The input address of request of data carries out operation, when obtaining operation result, is specifically used for: to the input address of the request of data into
Row consistency Hash complementation operation, obtains complementation result；Screening and determining module 310 are for determining number according to operation result
When according to requesting corresponding block chain, being specifically used for: determining key value subrange belonging to complementation result；Search key value
The corresponding block chain of range, using the corresponding block chain of key value subrange as the corresponding block chain of request of data.
During an illustrative realization, request processing unit can also include: judgment module, current for judging
Whether dilatation condition is met；Dilatation module, for adding new block chain and new block chain when currently meeting dilatation condition
First block.
During an illustrative realization, dilatation module is for adding when currently meeting the dilatation condition
When first block of new block chain and the new block chain, it is specifically used for: searches area currently with first block chain
The block account out for going out block permission of block goes out block account as dilatation, and first block chain is the block chain generated at first in network；
When dilatation goes out block account and goes out block account for this, new block chain is created, and create first block of new block chain；By first
Block is sent to other nodes in specified network.
During an illustrative realization, dilatation module is for adding when currently meeting the dilatation condition
When first block of new block chain and the new block chain, it is specifically used for: searches area currently with first block chain
The block account out for going out block permission of block goes out block account as dilatation, and first block chain is the block chain generated at first in network；
When it is that this goes out block account that dilatation, which goes out block account not, first block that dilatation goes out the new block chain of block account creation is received, and
New block chain is added according to first block.
During an illustrative realization, each block chain has corresponding key value subrange, key value
Subrange belongs to key value total size, and key value total size is all input address that can issue request of data by referring to
Determine the range of obtained key value after operation；Requesting processing unit can also include: acquisition module, for obtaining keyword
It is worth total size and block chain quantity；Division module, for according to block chain quantity, key value total size to be divided into several passes
Key word value subrange；Distribution module, for according to assignment of allocation rule, several key value subranges to be distributed to each block
Chain.
During an illustrative realization, judgment module is when for judging currently whether to meet dilatation condition, tool
Body is used for: judging whether the block total amount of block to be detected reaches amount threshold, block to be detected refers to from last dilatation detection
Shi Qi, by the end of block generated in the period at current time；When block total amount reaches the amount threshold, statistics to
Detect the number of blocks that block size in block is more than the block of capacity threshold；When the ratio of number of blocks occupied area block total amount is more than
When the first proportion threshold value, determines and currently meet dilatation condition；When the ratio that number of blocks accounts for the block total amount is less than first
When proportion threshold value, determines and be currently unsatisfactory for dilatation condition.
During an illustrative realization, judgment module is when for judging currently whether to meet dilatation condition, tool
Body is used for: judging that last dilatation detects whether the time span at current time reaches designated value；Whether reached in time span
When to designated value, the block total amount of block to be detected is counted, block to be detected refers to from last dilatation detection, by the end of working as
Generated block in the period at preceding moment；Obtain the block that block size in block to be detected is more than the block of capacity threshold
Quantity；When the ratio of number of blocks occupied area block total amount is more than the second proportion threshold value, determines and currently meet dilatation condition；Work as block
When the ratio of quantity occupied area block total amount is less than second proportion threshold value, determines and be currently unsatisfactory for dilatation condition.
During an illustrative realization, judgment module is when for judging currently whether to meet dilatation condition, tool
Body is used for: being voted and is applied in response to dilatation, receives ballot；It counts in all ballots, agrees to the digital goods that the account of dilatation possesses
Coin quantity；When the ratio that digital cash quantity accounts for digital cash total amount in the whole network is more than third proportion threshold value, determine current full
Sufficient dilatation condition；Alternatively, when the ratio that digital cash quantity accounts for digital cash total amount in the whole network is less than third proportion threshold value,
It determines and is currently unsatisfactory for dilatation condition.
During an illustrative realization, selecting module 320 from the first request of data for selecting this to go out block
The account sheet secondary request of data being recorded in block is specifically used for when as the second request of data: asking to each first data
Carry out legitimacy verifies are sought, all the first legal request of data are obtained；It is corresponding to count all the first legal request of data
The data volume of data information；When data volume is less than block maximum size value, all the first legal request of data are selected, are made
For the second request of data；Alternatively, when data volume is more than the block maximum size value, from all the first legal request of data
A part of first request of data of middle selection, as the second request of data, the data volume of a part of first request of data is no more than area
Block maximum size value.
During an illustrative realization, screening conditions are specified are as follows: a request of data corresponding one goes out block account,
And the corresponding target block chain of a request of data.
Request processing method in previous embodiment, this implementation are able to carry out by request processing unit in this present embodiment
The part that example is not described in detail, can refer to the related description to request processing method in previous embodiment.
Request processing unit provided in an embodiment of the present invention, by the way that at least one block chain is arranged in specified network, with
And block account is screened the corresponding request of data of this account and is handled out, enable one go out block account simultaneously output 1 with
On block, and enable the block account that goes out in the different nodes in specified network to go out block parallel, therefore improve entire
Network goes out block speed, and then improves the treatment effeciency of whole network.
Embodiment three
The embodiment of the invention provides a kind of terminal, which is provided with any request processing dress in previous embodiment two
It sets.
Wherein, which can be personal computer, server etc..
Example IV
The embodiment of the invention provides a kind of demand processing system, which includes multiple nodes, in multiple node
Point-to-point communication is able to carry out between any two node, each node in multiple node is provided in previous embodiment two
Any request processing unit.
Wherein, the node device in each node in multiple node can be the terminal in previous embodiment three.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided by this programme, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, for example, multiple units or group
Part can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown
Or the mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, device or unit it is indirect
Coupling or communication connection can be electrical property, mechanical 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, each functional unit in each embodiment of this programme can integrate in 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 hardware adds SFU software functional unit.
The foregoing is merely the preferred embodiments of this programme, not to limit this programme, all essences in this programme
Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of this programme protection.
Claims (15)
1. a kind of request processing method, which is characterized in that applied to the node where the block account out in specified network, the finger
Determining network has at least one block chain, and each block in the specified network is both provided with the block chain mark of affiliated block chain
Know information, which comprises
From currently pending all request of data, according to specified screening conditions, screening originally goes out the corresponding all numbers of block account
According to request, as the first request of data, and the corresponding target block chain of first request of data is determined；
Selection originally goes out this request of data to be processed of block account from first request of data, as the second request of data；
New block is created in the target block chain, the corresponding data information of second request of data is recorded described new
In block；
The new block is sent to other nodes in the specified network.
2. the method according to claim 1, wherein screening is originally from currently pending all request of data
The corresponding all request of data of block account out as the first request of data, and determine the corresponding mesh of first request of data
Mark block chain, comprising:
For each request of data to be processed, the input address of the request of data is obtained, is based on consistency hash algorithm, it is right
The input address of the request of data carries out operation, obtains operation result, according to the operation result, determines the request of data
Corresponding block chain；
It obtains this and goes out block account with block chain belonging to the block for going out block permission, as target block chain；
According to the corresponding block chain of all request of data to be processed, select corresponding block chain for the number of the target block chain
According to request, as the first request of data.
3. according to the method described in claim 2, it is characterized in that, consistency hash algorithm is based on, to the request of data
Input address carries out operation, obtains operation result, comprising: carries out the complementation of consistency Hash to the input address of the request of data
Operation obtains complementation result；
According to the operation result, the corresponding block chain of the request of data is determined, comprising: determine belonging to the complementation result
Key value subrange；The corresponding block chain of the key value subrange is searched, the key value subrange is corresponding
Block chain is as the corresponding block chain of the request of data.
4. the method according to claim 1, wherein the method also includes:
Whether judgement currently meets dilatation condition；
When currently meeting the dilatation condition, first block of new block chain and the new block chain is added.
5. according to the method described in claim 4, it is characterized in that, adding new block when currently meeting the dilatation condition
First block of chain and the new block chain, comprising:
The block account out for going out block permission for searching the currently block with first block chain, goes out block account as dilatation, described
First block chain is the block chain generated at first in network；
When the dilatation goes out block account and goes out block account for this, new block chain is created, and create first of the new block chain
Block；
Other nodes first block being sent in the specified network.
6. according to the method described in claim 4, it is characterized in that, adding new block when currently meeting the dilatation condition
First block of chain and the new block chain, comprising:
The block account out for going out block permission for searching the currently block with first block chain, goes out block account as dilatation, described
First block chain is the block chain generated at first in network；
When the dilatation goes out block account not and is this and goes out block account, the dilatation goes out the new block chain of block account creation the is received
One block, and the new block chain is added according to first block.
7. according to the method described in claim 4, it is characterized in that, each block chain have corresponding key value subrange,
The key value subrange belongs to key value total size, and the key value total size can issue request of data to be all
Input address through specifying operation after obtained key value range；
When currently meeting the dilatation condition, after first block for adding new block chain and the new block chain, institute
State method further include:
Obtain key value total size and block chain quantity；
According to the block chain quantity, the key value total size is divided into several key value subranges；
According to assignment of allocation rule, several key value subranges are distributed into each block chain.
8. according to the method described in claim 4, it is characterized in that, whether judgement currently meets dilatation condition, comprising:
Judge whether the block total amount of block to be detected reaches amount threshold, the block to be detected refers to from last dilatation detection
Shi Qi, by the end of block generated in the period at current time；
When the block total amount reaches the amount threshold, counting block size in the block to be detected is more than capacity threshold
Block number of blocks；
When the ratio that the number of blocks accounts for the block total amount is more than the first proportion threshold value, determines and currently meet dilatation item
Part；When the ratio that the number of blocks accounts for the block total amount is less than first proportion threshold value, determination is currently unsatisfactory for
The dilatation condition.
9. according to the method described in claim 4, it is characterized in that, whether judgement currently meets dilatation condition, comprising:
Judge that last dilatation detects whether the time span at current time reaches designated value；
When whether the time span reaches the designated value, the block total amount of block to be detected, the area to be detected are counted
Block refers to last dilatation detection, by the end of block generated in the period at current time；
Obtain the number of blocks that block size in the block to be detected is more than the block of capacity threshold；
When the ratio that the number of blocks accounts for the block total amount is more than the second proportion threshold value, determines and currently meet dilatation item
Part；When the ratio that the number of blocks accounts for the block total amount is less than second proportion threshold value, determination is currently unsatisfactory for
The dilatation condition.
10. according to the method described in claim 4, it is characterized in that, whether judgement currently meets dilatation condition, comprising:
It votes and applies in response to dilatation, receive ballot；
It counts in all ballots, agrees to the digital cash quantity that the account of dilatation possesses；
When the ratio that the digital cash quantity accounts for digital cash total amount in the whole network is more than third proportion threshold value, determine current full
Sufficient dilatation condition；Alternatively, when the ratio that the digital cash quantity accounts for digital cash total amount in the whole network is less than the third ratio
When example threshold value, determination is currently unsatisfactory for the dilatation condition.
11. the method according to claim 1, wherein selection originally goes out block account from first request of data
This secondary request of data being recorded in block, as the second request of data, comprising:
Legitimacy verifies are carried out to each first request of data, obtain all the first legal request of data；
Count the data volume of all legal corresponding data informations of the first request of data；
When the data volume is less than block maximum size value, all the first legal request of data are selected, as the second number
According to request；Alternatively, being selected from all the first legal request of data when the data volume is more than the block maximum size value
A part of first request of data is selected, as the second request of data, the data volume of a part of first request of data is no more than institute
State block maximum size value.
12. the method according to claim 1, wherein the specified screening conditions are as follows: a request of data is corresponding
One goes out block account, and the corresponding target block chain of a request of data.
13. a kind of request processing unit, which is characterized in that the node gone out where block account being set in specified network, it is described
Specified network has at least one block chain, and each block in the specified network is both provided with the block chain of affiliated block chain
Identification information, described device include:
Screening and determining module, for from currently pending all request of data, it is corresponding all that screening originally goes out block account
Request of data as the first request of data, and determines the corresponding target block chain of first request of data；
Selecting module, for selecting this to go out this request of data to be processed of block account from first request of data, as
Second request of data；
Block module out believes the corresponding data of second request of data for creating new block in the target block chain
Breath is recorded in the new block；
Sending module, other nodes for being sent to the new block in the specified network.
14. a kind of terminal, which is characterized in that the terminal is provided with request processing unit described in claim 13.
15. a kind of demand processing system, which is characterized in that any in the multiple node the system comprises multiple nodes
Point-to-point communication is able to carry out between two nodes, each node in the multiple node is provided with described in claim 13
Request processing unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710724782.7A CN109428906B (en) | 2017-08-22 | 2017-08-22 | Request processing method, device, system and terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710724782.7A CN109428906B (en) | 2017-08-22 | 2017-08-22 | Request processing method, device, system and terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109428906A true CN109428906A (en) | 2019-03-05 |
| CN109428906B CN109428906B (en) | 2021-09-10 |
Family
ID=65497252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710724782.7A Active CN109428906B (en) | 2017-08-22 | 2017-08-22 | Request processing method, device, system and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109428906B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110445626A (en) * | 2019-07-15 | 2019-11-12 | 杭州复杂美科技有限公司 | Block packing, broadcasting method and system, equipment and storage medium |
| CN112104747A (en) * | 2020-10-30 | 2020-12-18 | 广州市玄武无线科技股份有限公司 | Request response system based on chain processing |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106406896A (en) * | 2016-09-27 | 2017-02-15 | 北京天德科技有限公司 | Block chain block-building method based on parallel PipeLine technology |
| CN106682984A (en) * | 2016-10-27 | 2017-05-17 | 上海亿账通区块链科技有限公司 | Block chain-based transaction business processing method and system |
| CN107045518A (en) * | 2016-10-18 | 2017-08-15 | 北京天德科技有限公司 | A kind of extension design method of block chain |
| US20170236102A1 (en) * | 2016-02-12 | 2017-08-17 | D+H Usa Corporation | Peer-to-Peer Financial Transactions Using A Private Distributed Ledger |
-
2017
- 2017-08-22 CN CN201710724782.7A patent/CN109428906B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170236102A1 (en) * | 2016-02-12 | 2017-08-17 | D+H Usa Corporation | Peer-to-Peer Financial Transactions Using A Private Distributed Ledger |
| CN106406896A (en) * | 2016-09-27 | 2017-02-15 | 北京天德科技有限公司 | Block chain block-building method based on parallel PipeLine technology |
| CN107045518A (en) * | 2016-10-18 | 2017-08-15 | 北京天德科技有限公司 | A kind of extension design method of block chain |
| CN106682984A (en) * | 2016-10-27 | 2017-05-17 | 上海亿账通区块链科技有限公司 | Block chain-based transaction business processing method and system |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110445626A (en) * | 2019-07-15 | 2019-11-12 | 杭州复杂美科技有限公司 | Block packing, broadcasting method and system, equipment and storage medium |
| CN110445626B (en) * | 2019-07-15 | 2021-11-02 | 杭州复杂美科技有限公司 | Block packing and broadcasting method and system, equipment and storage medium |
| CN112104747A (en) * | 2020-10-30 | 2020-12-18 | 广州市玄武无线科技股份有限公司 | Request response system based on chain processing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109428906B (en) | 2021-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111614690B (en) | Abnormal behavior detection method and device | |
| CN102724219B (en) | A network data computer processing method and a system thereof | |
| CN112669155B (en) | Block chain-based transaction distribution execution method, device server and storage medium | |
| CN109784636A (en) | Fraudulent user recognition methods, device, computer equipment and storage medium | |
| Mitzenmacher | Analyzing distributed join-idle-queue: A fluid limit approach | |
| CN106407244A (en) | Multi-database-based data query method, system and apparatus | |
| CN107291928A (en) | A kind of daily record storage system and method | |
| CN106407002B (en) | Data processing task executes method and apparatus | |
| CN105915650A (en) | Load balancing method and device | |
| CN110209551B (en) | Abnormal equipment identification method and device, electronic equipment and storage medium | |
| CN110457128B (en) | Task allocation method, device and system | |
| CN107483381A (en) | The monitoring method and device of interlock account | |
| CN108985954A (en) | A kind of method and relevant device of incidence relation that establishing each mark | |
| CN108512775A (en) | A kind of method and device of sequence transaction queue | |
| CN109196807A (en) | The method of network node and operation network node to carry out resource dissemination | |
| CN109428906A (en) | Request processing method, device, system and terminal | |
| CN110099112A (en) | Date storage method, device, medium and terminal device based on point to point network | |
| CN107622121A (en) | A kind of data analysing method and device based on bitmap data structure | |
| CN104794234B (en) | Data processing method and device for fellow peers' evaluation | |
| CN110288390A (en) | Determine the method and device of address | |
| CN104268293B (en) | The index treating method and apparatus that can not add up in database | |
| EP3451611B1 (en) | Method and apparatus for setting mobile device identifier | |
| CN106681803A (en) | Task scheduling method and server | |
| CN106611339B (en) | Seed user screening method, and product user influence evaluation method and device | |
| CN104298596B (en) | Random distribution method and device for test scheme and server |
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 |