CN109428906B - Request processing method, device, system and terminal - Google Patents

Request processing method, device, system and terminal Download PDF

Info

Publication number
CN109428906B
CN109428906B CN201710724782.7A CN201710724782A CN109428906B CN 109428906 B CN109428906 B CN 109428906B CN 201710724782 A CN201710724782 A CN 201710724782A CN 109428906 B CN109428906 B CN 109428906B
Authority
CN
China
Prior art keywords
block
block chain
data request
data
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.)
Active
Application number
CN201710724782.7A
Other languages
Chinese (zh)
Other versions
CN109428906A (en
Inventor
余效俭
崔萌
孙江涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Guorenbao Software Technology Co ltd
Original Assignee
Beijing Guorenbao Software Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Guorenbao Software Technology Co ltd filed Critical Beijing Guorenbao Software Technology Co ltd
Priority to CN201710724782.7A priority Critical patent/CN109428906B/en
Publication of CN109428906A publication Critical patent/CN109428906A/en
Application granted granted Critical
Publication of CN109428906B publication Critical patent/CN109428906B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling 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 embodiment of the invention provides a request processing method, a device, a system and a terminal. The embodiment of the invention sets at least one block chain in the designated network, screens the data request corresponding to the account by the block outlet account, and processes the data request, so that more than 1 block can be simultaneously output by one block outlet account, and the block outlet accounts in different nodes in the designated network can be simultaneously output, thereby improving the block outlet speed of the whole network, further improving the processing efficiency of the whole network, and solving the problem of low processing efficiency caused by low block outlet speed of the block chain-based request processing network in the prior art to a certain extent.

Description

Request processing method, device, system and terminal
[ technical field ] A method for producing a semiconductor device
The present disclosure relates to the field of communications, and in particular, to a method, an apparatus, a system, and a terminal for processing a request.
[ background of the invention ]
A blockchain is a chain data structure that combines blocks of data in a sequential manner, in chronological order, to cryptographically secure the data against tampering and forgery.
The blockchain-based request processing network is a decentralized P2P (Peer-to-Peer) network that includes both blocked accounts and non-blocked accounts. The block-out account has a block-out authority, and the block-out refers to creating the latest block of the block chain and recording data information (such as transaction information) into the latest block. The non-blocking account has no blocking authority.
In the prior art, a request processing network based on a block chain only has one block chain, and each block corresponds to only one block outlet account with a block outlet authority, that is, two or more block outlet accounts cannot have the block outlet authority for the same block. Suppose that the request processing network has 5 nodes, wherein accounts on 3 nodes are Block-out accounts, namely a Block-out account a, a Block-out account B and a Block-out account C, a Block Chain0 is used for recording data information in the request processing network, the Block-out account a has a Block-out permission of a 2 nd Block2 of the Block Chain0, the Block-out account B has a Block-out permission of a 3 rd Block2 of the Block Chain0, and the Block-out account C has a Block-out permission of a 4 th Block2 of the Block Chain0 (assuming that an account with Block-out permissions of each Block is obtained in advance). Then the request handling procedure of the network is:
at time t1, a data request existing at time t1 from the Block account a is recorded into the Block2, that is, the Block account a generates the Block2, and then the Block2 is sent to other nodes in the network;
at time t2(t2 is greater than t1) after the Block output operation of the Block output account a is completed, recording data requests existing at time t2 by the Block output account B (the record comprises newly increased data requests between time t1 and time t2 and possibly data requests which are not processed because the total amount of the data requests exceeds the upper limit of the capacity of the Block at time t1) into a Block3, namely the Block output account B generates a Block3, and then the Block3 is sent to other nodes in the network;
at time t3(t3 is greater than t2) after the Block out operation of the Block out account B is completed, a data request existing at time t3 from the Block out account C is recorded in the Block4, that is, the Block out account C generates a Block4, and then the Block4 is sent to other nodes in the network.
Therefore, in the prior art, only one block output account can execute block output operation at the same time, that is, one block output account can generate blocks one by one, and the block output process of the whole network is a serial block output process, so that the block output speed is low, and the processing efficiency is low.
[ summary of the invention ]
In view of this, embodiments of the present disclosure provide a request processing method, apparatus, system, and terminal, so as to solve the problem in the prior art that a block output speed of a block chain-based request processing network is slow, which results in low processing efficiency.
In a first aspect, an embodiment of the present invention provides a request processing method, which is applied to a node where a block export account in a designated network is located, where the designated network has at least one block chain, and each block in the designated network is provided with block chain identification information of the block chain to which the block export account belongs, and the method includes:
screening all data requests corresponding to the block account from all current data requests to be processed according to specified screening conditions to serve as first data requests, and determining a target block chain corresponding to the first data requests;
selecting a data request of the secondary processing of the local block-out account from the first data request as a second data request;
creating a new block in the target block chain, and recording data information corresponding to the second data request into the new block;
and sending the new block to other nodes in the designated network.
The foregoing aspect and any possible implementation manner further provide an implementation manner, where screening all data requests corresponding to a block account from all data requests to be currently processed, as a first data request, and determining a target block chain corresponding to the first data request, includes:
for each data request to be processed, acquiring an input address of the data request, calculating the input address of the data request based on a consistent hash algorithm to obtain a calculation result, and determining a block chain corresponding to the data request according to the calculation result;
acquiring a block chain to which a block with a block output authority of the block output account belongs as a target block chain;
and selecting the corresponding block chain as the data request of the target block chain as a first data request according to the block chains corresponding to all the data requests to be processed.
The foregoing aspects and any possible implementation manners further provide an implementation manner, where performing an operation on an input address of the data request based on a consistent hash algorithm to obtain an operation result, where the implementation manner includes: performing consistent Hash complementation operation on the input address of the data request to obtain a complementation result;
determining a block chain corresponding to the data request according to the operation result, including: determining a keyword value sub-range to which the remainder result belongs; and searching the block chain corresponding to the key value sub-range, and taking the block chain corresponding to the key value sub-range as the block chain corresponding to the data request.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
judging whether the current capacity expansion condition is met;
and when the current capacity expansion condition is met, adding a new block chain and a first block of the new block chain.
The above aspect and any possible implementation manner further provide an implementation manner, where when the capacity expansion condition is currently satisfied, adding a new block chain and a first block of the new block chain includes:
searching a block outlet account with a block outlet authority of a block of a first block chain at present to serve as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in a network;
when the expanded block account is the local block account, creating a new block chain and creating a first block of the new block chain;
and sending the first block to other nodes in the specified network.
The above aspect and any possible implementation manner further provide an implementation manner, where when the capacity expansion condition is currently satisfied, adding a new block chain and a first block of the new block chain includes:
searching a block outlet account with a block outlet authority of a block of a first block chain at present to serve as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in a network;
and when the expansion block account is not the local block account, receiving a first block of a new block chain created by the expansion block account, and adding the new block chain according to the first block.
The foregoing aspects and any possible implementations further provide an implementation, where each blockchain has a corresponding sub-range of key values, where the sub-range of key values belongs to a total range of key values, and the total range of key values is a range of key values obtained after all input addresses capable of issuing data requests are subjected to a specified operation;
when the capacity expansion condition is currently met, after a new block chain and a first block of the new block chain are added, the method further includes:
acquiring a total range of key word values and the number of block chains;
dividing the total range of the key values into a plurality of sub-ranges of the key values according to the number of the block chains;
and allocating the plurality of key value sub-ranges to each block chain according to a specified allocation rule.
As for the above-mentioned aspects and any possible implementation manner, further providing an implementation manner, where determining whether a current capacity expansion condition is met includes:
judging whether the total quantity of blocks to be detected reaches a quantity threshold value, wherein the blocks to be detected refer to blocks generated within a time period from last expansion detection to current time;
when the total number of the blocks reaches the number threshold, counting the number of the blocks of which the block size exceeds a capacity threshold in the blocks to be detected;
when the proportion of the block quantity in the total block quantity exceeds a first proportion threshold value, determining that the capacity expansion condition is met currently; and when the proportion of the block quantity to the total block quantity does not exceed the first proportion threshold value, determining that the capacity expansion condition is not met currently.
As for the above-mentioned aspects and any possible implementation manner, further providing an implementation manner, where determining whether a current capacity expansion condition is met includes:
judging whether the time length of the current time detected by last expansion reaches a specified value or not;
when the time length reaches the specified value, counting the total number of blocks of the block to be detected, wherein the block to be detected refers to a block generated in a time period from the last expansion detection to the current moment;
acquiring the number of blocks of which the block size exceeds a capacity threshold in the blocks to be detected;
when the proportion of the block quantity in the total block quantity exceeds a second proportion threshold value, determining that the capacity expansion condition is met currently; and when the proportion of the block quantity in the total block quantity does not exceed the second proportion threshold value, determining that the capacity expansion condition is not met currently.
As for the above-mentioned aspects and any possible implementation manner, further providing an implementation manner, where determining whether a current capacity expansion condition is met includes:
receiving a vote in response to the capacity expansion voting application;
counting the number of digital currencies owned by accounts agreeing to capacity expansion in all votes;
when the proportion of the number of the digital currencies to the total number of the digital currencies in the whole network exceeds a third proportion threshold value, determining that the capacity expansion condition is currently met; or when the proportion of the digital currency amount to the total digital currency amount in the whole network does not exceed the third proportion threshold value, determining that the capacity expansion condition is not met currently.
The above-mentioned aspect and any possible implementation manner further provide an implementation manner, selecting, from the first data request, a data request that is recorded in a block by a block-out account as a second data request, including:
carrying out validity check on each first data request to obtain all valid first data requests;
counting the data volume of the data information corresponding to all legal first data requests;
when the data volume does not exceed the upper limit value of the block capacity, all legal first data requests are selected as second data requests; or when the data volume exceeds the upper limit value of the block capacity, selecting a part of first data requests from all legal first data requests as second data requests, wherein the data volume of the part of first data requests does not exceed the upper limit value of the block capacity.
The above-described aspect and any possible implementation manner further provide an implementation manner, where the specified filtering condition is: one data request corresponds to one block account, and one data request corresponds to one target block chain.
In a second aspect, an embodiment of the present invention provides a request processing apparatus, which is disposed at a node where a block account in a designated network is located, where the designated network has at least one block chain, and each block in the designated network is provided with block chain identification information of the block chain to which the block chain belongs, and the apparatus includes:
the screening and determining module is used for screening all data requests corresponding to the block account from all current data requests to be processed to serve as first data requests, and determining a target block chain corresponding to the first data requests;
the selection module is used for selecting the data request of the secondary processing of the block account from the first data request as a second data request;
a block output module, configured to create a new block in the target block chain, and record data information corresponding to the second data request into the new block;
and the sending module is used for sending the new block to other nodes in the designated network.
In a third aspect, an embodiment of the present disclosure provides a terminal, where the terminal is provided with the request processing apparatus according to the second aspect.
In a fourth aspect, an embodiment of the present invention provides a request processing system, where the system includes a plurality of nodes, where any two of the plurality of nodes are capable of performing peer-to-peer communication, and each of the plurality of nodes is provided with the request processing apparatus according to the second aspect.
The embodiment of the invention has the following beneficial effects:
according to the embodiment of the invention, at least one block chain is arranged in the designated network, and the data request corresponding to the account is screened by the block outlet account and processed, so that more than 1 block can be simultaneously output by one block outlet account, and the block outlet accounts in different nodes in the designated network can be simultaneously output, therefore, the block outlet speed of the whole network is improved, and the processing efficiency of the whole network is further improved.
[ description of the drawings ]
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive labor.
Fig. 1 is a diagram illustrating a first process of a request processing method according to an embodiment of the present invention.
Fig. 2 is a diagram illustrating a second process of a request processing method according to an embodiment of the present invention.
Fig. 3 is a functional block diagram of a request processing apparatus according to an embodiment of the present invention.
[ detailed description ] embodiments
In order to better understand the technical solution of the present solution, the following describes an embodiment of the present solution in detail with reference to the accompanying drawings.
It should be clear that the described embodiments are only a part of the present solution, not all embodiments. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments in the present solution, belong to the protection scope of the present solution.
The terminology used in the embodiments of the present solution is for the purpose of describing particular embodiments only and is not intended to be limiting of the present solution. As used in this specification and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.
Example one
Fig. 1 is a diagram illustrating a first process of a request processing method according to an embodiment of the present invention. In this embodiment, the request processing method is applied to a node where a block outlet account in a designated network is located, where the designated network has at least one block chain, and each block in the designated network is provided with block chain identification information of the block chain to which the block outlet account belongs. As shown in fig. 1, the request processing method may include the steps of:
s101, screening all data requests corresponding to the block account from all current data requests to be processed according to specified screening conditions to serve as first data requests, and determining a target block chain corresponding to the first data requests.
S102, selecting the data request of the secondary processing of the block account from the first data request as a second data request.
S103, a new block is created in the target block chain, and the data information corresponding to the second data request is recorded in the new block.
And S104, sending the new block to other nodes in the designated network.
Wherein the designated network may be a blockchain based request processing network, such as a transaction network.
Since the designated network has at least one block chain, and each block chain has a block to be blocked, the number of blocking accounts with blocking authority is at least one. Thus, at least one account for which a block out operation can be performed exists at the same time, that is, at least one account for which a data request can be processed exists at the same time.
In an exemplary implementation process, the specified screening condition is: one data request corresponds to one block account, and one data request corresponds to one target block chain.
Each node of the designated network has its own cache, and all data requests currently pending in the designated network are stored in the cache of each node. In this way, the account on the node can know which data requests to be processed currently through the cache of the node.
Therefore, all data requests to be processed currently need to be allocated to each block output account with block output authority currently according to a certain allocation mode. From the perspective of a particular block-out account, those data requests that need to be processed by the block-out account need to be selected from all data requests currently pending. In step S101, "all data requests corresponding to the local block-out account are screened according to the designated screening condition from all data requests to be processed currently, and the problem is solved as a first data request", so that, in step S101, all data requests currently processed by the local block-out account are selected by the local block-out account.
Through step S101, a target block chain corresponding to the first data request is also determined.
It should be noted that the number of target block chains may be 1, or may be greater than 1. That is, the block output account may currently have a block output authority of one block, or may have a block output authority of more than two blocks. If the block output account has the block output permission of more than two blocks currently, the more than two blocks belong to different block chains respectively, at this time, one first data request corresponds to one target block chain, and the same first data request cannot correspond to more than two target block chains.
For example. Block out account a currently has Block out rights for Block5 of blockchain Chain1 and Block out rights for Block6 of blockchain Chain 2. The data request 2, the data request 4, the data request 6, the data request 8, the data request 10, and the data request 12 are data requests corresponding to the screened out block account a, wherein a target block Chain corresponding to the data request 2, the data request 6, and the data request 10 is a block Chain1, and a target block Chain corresponding to the data request 4, the data request 8, and the data request 12 is a block Chain 2.
In step S102, a data request to be processed by the present block-out account is selected from the first data requests as a second data request. The main purpose of this step is to remove the data request that fails the validity check from the first data request, and to ensure that the data amount of the data information corresponding to the data request to be recorded in each block does not exceed the capacity of the corresponding block.
For example. Suppose that Block out account B currently has Block out rights for Block7 of the Block Chain, Chain 3. The data request 1, the data request 2, the data request … …, the data request 9, and the data request 10 are data requests corresponding to the screened out block account B, and the target block Chain corresponding to the data requests 1 to 10 is a block Chain 3. Supposing that after the data requests 1-10 are subjected to validity check, the data request 9 is illegal, and the data requests 1-8 and the data request 10 are legal; further judging whether the total data volume of the data information corresponding to the data requests 1-8 and 10 exceeds the capacity of the Block7 of the Block Chain Chan 3, if not, the data requests 1-8 and 10 are all data requests processed by the Block account B this time, if so, removing one or more data requests from the data requests 1-8 and 10, so that the total data volume of the data information corresponding to the remaining data requests is smaller than the capacity of the Block7 of the Block Chain Chan 3, and if the total data volume of the data information corresponding to the data requests 1-8 is smaller than the capacity of the Block7 of the Block Chain Chan 3, the data requests 10 are left in the data requests to be processed in the cache. In other embodiments, the total data amount of the data information corresponding to the data request may be compared with the block capacity upper limit value to determine how many data requests are processed this time.
In an exemplary implementation process, selecting, from the first data request, a data request that is recorded in the block by the block account as the secondary record to the block may include: carrying out validity check on each first data request to obtain all valid first data requests; counting the data information data volume corresponding to all legal first data requests; when the data volume does not exceed the upper limit value of the block capacity, all legal first data requests are selected as second data requests; or when the data volume exceeds the upper limit value of the block capacity, selecting a part of first data requests from all legal first data requests as second data requests, wherein the data volume of the part of first data requests does not exceed the upper limit value of the block capacity.
In step S103, the present account processes the second data request. It should be noted that, if there are more than two target block chains, step S103 specifically includes: and creating a new block in each target block chain, and recording the data information corresponding to the second data request into the new block of the corresponding target block chain.
The foregoing example illustrates the case where the Block export account a currently has the Block export right of Block5 of blockchain Chain cain 1 and the Block export right of Block6 of blockchain Chain cain 2. Since the target Block Chain corresponding to the data request 2, the data request 6 and the data request 10 is the Chain of blocks Chain1, and the target Block Chain corresponding to the data request 4, the data request 8 and the data request 12 is the Chain of blocks Chain2, a Block5 is created in the Chain of blocks Chain1, data information corresponding to the data request 2, the data request 6 and the data request 10 is recorded in the Block5 of the Chain of blocks Chain1, a Block6 is created in the Chain of blocks Chain2, and data information corresponding to the data request 4, the data request 8 and the data request 12 is recorded in the Block6 of the Chain of blocks Chain 2. Therefore, the present block-out amount of the block-out account is equal to the target block amount, and if the target block amount is greater than 1, the present block-out amount of the block-out account is also greater than 1, that is, the one-time block-out amount of one block-out account may be greater than 1. Therefore, the block discharging quantity of a single block discharging account is increased, and the block discharging speed of the single block discharging account is improved. Or, it can also be said that the number of the single node in one block output is increased, so as to improve the block output speed of the single node.
Through step S104, the local block-out account sends the new block to other nodes in the designated network, so that the other nodes can synchronize the new block to the locally stored block chain, and make the accounts in the other nodes acquire updated block chain information.
The block out account in each node in the designated network can process the data request by executing the steps in the embodiment shown in fig. 1, and the block out accounts in different nodes can process the data request in parallel, thereby realizing parallel block out. Thus, the block output speed of the whole designated network is improved.
The faster the block output speed is, the more data requests processed in unit time are shown, so the embodiment of the invention improves the processing efficiency of the data requests by improving the block output speed.
In the embodiment shown in fig. 1, at least one block chain is set in the designated network, and the block account filters the data request corresponding to the account to process, so that more than 1 block can be simultaneously generated by one block account, and the block accounts in different nodes in the designated network can be simultaneously processed, thereby increasing the block output speed of the whole network and further increasing the processing efficiency of the whole network.
In an exemplary implementation process, screening all data requests corresponding to the block account from all data requests to be currently processed as a first data request, and determining a target block chain corresponding to the first data request may include: for each data request to be processed, acquiring an input address of the data request, calculating the input address of the data request based on a consistent hash algorithm to obtain a calculation result, and determining a block chain corresponding to the data request according to the calculation result; acquiring a block chain to which a block with a block output authority of the block output account belongs as a target block chain; and selecting the corresponding block chain as the data request of the target block chain as a first data request according to the block chains corresponding to all the data requests to be processed.
In an exemplary implementation process, the performing an operation on an input address of a data request based on a consistent hash algorithm to obtain an operation result includes: carrying out consistent Hash complementation operation on the input address of the data request to obtain a complementation result; determining a block chain corresponding to the data request according to the operation result, wherein the step comprises the following steps: determining a keyword value sub-range to which the remainder result belongs; and searching the block chain corresponding to the key word value sub-range, and taking the block chain corresponding to the key word value sub-range as the block chain corresponding to the data request.
The expression for performing consistent hash modulo operation on the input address of a data request is as follows:
Key=Mode(Hash(Address))
wherein, Key is a keyword; the Address is an input Address of the data request, namely the Address of the node sending the data request; mode (hash (Address)) indicates that a consistent hash remainder operation is performed on Address.
Assuming that the total range of the Key values Key is 1-1000, four block chains Chain0, Chain1, Chain2 and Chain3 are shared in the network, the sub-range of the Key values corresponding to the block Chain Chain0 is 1-250, the sub-range of the Key values corresponding to the block Chain Chain1 is 251-500, the sub-range of the Key values corresponding to the block Chain Chain2 is 501-750, and the sub-range of the Key values corresponding to the block Chain Chain3 is 751-1000. If the input Address of the data request 1 is Address1, and it is assumed that the Address1 consistent Hash operation is 5, i.e. Key is Mode (Hash 1)) -5, then since 5 belongs to the Key value sub-range 1-250, and the Key value sub-range 1-250 corresponds to the blockchain Chain0, the data request 1 corresponds to the blockchain Chain 0. Similarly, the corresponding blockchain for each data request may be determined.
Through the above process, the correspondence of each data request to the blockchain is determined. Assuming that the block Chain to which the block with the block export authority belongs is the block Chain0 and the block Chain2, the block Chain0 and the block Chain2 are target block chains, and the data request of the corresponding block Chain0 and the data request of the corresponding block Chain2 are both first data requests.
The consistent Hash algorithm ensures that the input of the same address is fixed on a block chain within a certain time period, and the data request of the same address is subjected to serialization limitation, so that the phenomenon of 'double flowers' is prevented, and the accuracy of data request processing is ensured.
Fig. 2 is a diagram illustrating a second process of a request processing method according to an embodiment of the present invention. In this embodiment, the request processing method is applied to a node where a block outlet account in a designated network is located, where the designated network has at least one block chain, and each block in the designated network is provided with block chain identification information of the block chain to which the block outlet account belongs. As shown in fig. 2, the request processing method may include the steps of:
s201, screening all data requests corresponding to the block account as first data requests according to specified screening conditions from all data requests to be processed currently, and determining a target block chain corresponding to the first data requests.
S202, selecting the data request of the secondary processing of the block account from the first data request as a second data request.
S203, a new block is created in the target block chain, and the data information corresponding to the second data request is recorded in the new block.
And S204, sending the new block to other nodes in the designated network.
S205, judging whether the current capacity expansion condition is met.
S206, when the current capacity expansion condition is met, adding the new block chain and the first block of the new block chain.
It should be noted that the step numbers in the embodiments of the present invention do not represent the execution order of the steps. Therefore, steps S205 and S206 are not necessarily performed after step S204.
Wherein, the expansion refers to adding a new block chain.
When each block-out account in the designated network processes the data request, whether capacity expansion is needed or not is judged, and if yes, capacity expansion processing is carried out.
In one exemplary implementation, the new blockchain generated by the expansion is created by a block-out account currently having block-out permissions for the blocks of the first blockchain. That is to say, which block-out account currently has the block-out authority of the block of the first block chain, the creation operation of the new block chain is performed by which block-out account, and other block-out accounts not currently having the block-out authority of the block of the first block chain may obtain the first block of the new block chain by receiving the broadcast.
In an exemplary implementation process, when the capacity expansion condition is currently satisfied, adding the new blockchain and the first block of the new blockchain may include: searching a block outlet account with the block outlet authority of a block with a first block chain at present as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in the network; when the expanded block account is the local block account, creating a new block chain and a first block of the new block chain; the first block is sent to other nodes in the designated network. That is, when the block output account currently has the block output authority of the block of the first block chain, the block output account creates a new block chain and the first block thereof, and sends the new block chain and the first block thereof to other nodes in the designated network.
In an exemplary implementation process, when the capacity expansion condition is currently satisfied, adding the new blockchain and the first block of the new blockchain may include: searching a block outlet account with the block outlet authority of a block with a first block chain at present as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in the network; and when the expanded block account is not the local block account, receiving a first block of a new block chain created by the expanded block account, and adding the new block chain according to the first block. That is, when the current block output account does not have the block output authority of the block of the first block chain, the current block output account adds the new block chain through the first block of the received new block chain.
In an exemplary implementation process, each blockchain has a corresponding sub-range of key values, the sub-range of key values belongs to a total range of key values, and the total range of key values is a range of key values obtained by performing specified operations on all input addresses capable of sending data requests; when the capacity expansion condition is currently satisfied, after the new block chain and the first block of the new block chain are added, the request processing method may further include: acquiring a total range of key word values and the number of block chains; dividing the total range of the key values into a plurality of sub-ranges of the key values according to the number of the block chains; according to a specified allocation rule, a number of key value sub-ranges are allocated to each block chain. That is, after capacity expansion, the key value sub-ranges corresponding to the block chains need to be redistributed according to the number of the block chains after capacity expansion.
Wherein the specified allocation rule may be an average allocation.
For example. Assuming that the total range of Key values Key is 1-1000, four block chains, Chain0, Chain1, Chain2 and Chain3 are shared in the network before capacity expansion, the sub-range of Key values corresponding to the Chain0 is 1-250, the sub-range of Key values corresponding to the Chain1 is 251-500, the sub-range of Key values corresponding to the Chain2 is 501-750, and the sub-range of Key values corresponding to the Chain3 is 751-1000. After capacity expansion, the network has five block chains, namely, Chain0, Chain1, Chain2, Chain3 and Chain4, wherein Chain4 is a new block Chain. The key value sub-range redistributed after capacity expansion may be: the sub-range of key values corresponding to the Chain of blocks Chain0 is 1-200, the sub-range of key values corresponding to the Chain of blocks Chain1 is 201-400, the sub-range of key values corresponding to the Chain of blocks Chain2 is 401-600, the sub-range of key values corresponding to the Chain of blocks Chain3 is 601-800, and the sub-range of key values corresponding to the Chain of blocks Chain4 is 801-1000.
Wherein, the dilatation condition can be set as required.
In an exemplary implementation process, determining whether the capacity expansion condition is currently satisfied may include: judging whether the total quantity of the blocks to be detected reaches a quantity threshold value, wherein the blocks to be detected refer to blocks generated in a time period from the last expansion detection to the current moment; when the total number of the blocks reaches a number threshold, counting the number of the blocks with the block size exceeding a capacity threshold in the blocks to be detected; when the proportion of the block quantity to the total block quantity exceeds a first proportion threshold value, determining that the capacity expansion condition is currently met; and when the proportion of the number of the blocks to the total number of the blocks does not exceed the first proportion threshold value, determining that the capacity expansion condition is not met currently. This example detects whether capacity expansion is required when the number of generated blocks reaches a certain number.
In an exemplary implementation process, determining whether the capacity expansion condition is currently satisfied may include: judging whether the time length of the current time detected by last expansion reaches a specified value or not; when the time length reaches a specified value, counting the total number of blocks of the block to be detected, wherein the block to be detected refers to a block generated in a time period from the last expansion detection to the current moment; acquiring the number of blocks of which the block size exceeds a capacity threshold in the blocks to be detected; when the proportion of the block quantity to the total block quantity exceeds a second proportion threshold value, determining that the capacity expansion condition is currently met; and when the proportion of the number of the blocks to the total number of the blocks does not exceed the second proportion threshold value, determining that the capacity expansion condition is not met currently. This example detects whether capacity expansion is required at certain time intervals.
In an exemplary implementation process, determining whether the capacity expansion condition is currently satisfied may include: receiving a vote in response to the capacity expansion voting application; counting the number of digital currencies owned by accounts agreeing to capacity expansion in all votes; when the proportion of the number of the digital currencies to the total number of the digital currencies in the whole network exceeds a third proportion threshold value, determining that the capacity expansion condition is currently met; or when the proportion of the number of the digital currencies to the total number of the digital currencies in the whole network does not exceed the third proportion threshold value, determining that the capacity expansion condition is not met currently. In the present example, when there is a capacity expansion voting application, it is detected whether capacity expansion is required.
The embodiment shown in fig. 2 is based on the embodiment shown in fig. 1, and a new block chain can be added to expand the processing capability for data requests, so that when the data requests increase, the block output speed can be further increased by adding the new block chain, and the processing efficiency is further improved.
According to the request processing method provided by the embodiment of the invention, at least one block chain is arranged in the designated network, and the block outlet account screens the data request corresponding to the account to process, so that more than 1 block can be simultaneously output by one block outlet account, and the block outlet accounts in different nodes in the designated network can be parallelly output, therefore, the block outlet speed of the whole network is improved, and the processing efficiency of the whole network is further improved.
Example two
The embodiment of the invention also provides a request processing device, which can realize the steps of the request processing method in the first embodiment.
Fig. 3 is a functional block diagram of a request processing apparatus according to an embodiment of the present invention. In this embodiment, the request processing device is disposed at a node where a block export account in a designated network is located, the designated network has at least one block chain, and each block in the designated network is provided with block chain identification information of the block chain to which the block export account belongs, as shown in fig. 3, the request processing device may include:
a screening and determining module 310, configured to screen all data requests corresponding to the block account from all data requests to be processed currently, to serve as a first data request, and determine a target block chain corresponding to the first data request;
a selecting module 320, configured to select, from the first data request, a data request to be processed by the current block-out account as a second data request;
the block output module 330 is configured to create a new block in the target block chain, and record data information corresponding to the second data request into the new block;
a sending module 340, configured to send the new block to other nodes in the designated network.
In an exemplary implementation process, the screening and determining module 310 is specifically configured to, when configured to screen all data requests corresponding to a block account from all currently-to-be-processed data requests, to serve as a first data request, and determine a target block chain corresponding to the first data request: for each data request to be processed, acquiring an input address of the data request, calculating the input address of the data request based on a consistent hash algorithm to obtain a calculation result, and determining a block chain corresponding to the data request according to the calculation result; acquiring a block chain to which a block with a block output authority of the block output account belongs as a target block chain; and selecting the corresponding block chain as the data request of the target block chain as a first data request according to the block chains corresponding to all the data requests to be processed.
In an exemplary implementation process, the screening and determining module 310 is specifically configured to, when performing an operation on an input address of a data request based on a consistent hash algorithm to obtain an operation result: performing consistent Hash complementation operation on the input address of the data request to obtain a complementation result; the screening and determining module 310 is specifically configured to, when determining the block chain corresponding to the data request according to the operation result: determining a keyword value sub-range to which the remainder result belongs; and searching the block chain corresponding to the key word value sub-range, and taking the block chain corresponding to the key word value sub-range as the block chain corresponding to the data request.
In an exemplary implementation, the request processing apparatus may further include: the judging module is used for judging whether the current capacity expansion condition is met; and the capacity expansion module is used for adding the new block chain and the first block of the new block chain when the capacity expansion condition is met currently.
In an exemplary implementation process, the capacity expansion module is specifically configured to, when the capacity expansion condition is currently met and a new block chain and a first block of the new block chain are added: searching a block outlet account with the block outlet authority of a block with a first block chain at present as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in the network; when the expanded block account is the local block account, creating a new block chain and a first block of the new block chain; the first block is sent to other nodes in the designated network.
In an exemplary implementation process, the capacity expansion module is specifically configured to, when the capacity expansion condition is currently met and a new block chain and a first block of the new block chain are added: searching a block outlet account with the block outlet authority of a block with a first block chain at present as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in the network; and when the expanded block account is not the local block account, receiving a first block of a new block chain created by the expanded block account, and adding the new block chain according to the first block.
In an exemplary implementation process, each blockchain has a corresponding sub-range of key values, the sub-range of key values belongs to a total range of key values, and the total range of key values is a range of key values obtained by performing specified operations on all input addresses capable of sending data requests; the request processing apparatus may further include: the acquisition module is used for acquiring the total range of the key word values and the number of the block chains; the dividing module is used for dividing the total range of the key values into a plurality of sub-ranges of the key values according to the number of the block chains; and the distribution module is used for distributing a plurality of key value sub-ranges to each block chain according to a specified distribution rule.
In an exemplary implementation process, when the determining module is configured to determine whether the current capacity expansion condition is met, the determining module is specifically configured to: judging whether the total quantity of the blocks to be detected reaches a quantity threshold value, wherein the blocks to be detected refer to blocks generated in a time period from the last expansion detection to the current moment; when the total number of the blocks reaches the number threshold, counting the number of the blocks with the block size exceeding the capacity threshold in the blocks to be detected; when the proportion of the block quantity to the total block quantity exceeds a first proportion threshold value, determining that the capacity expansion condition is currently met; and when the proportion of the block quantity in the total block quantity does not exceed a first proportion threshold value, determining that the capacity expansion condition is not met currently.
In an exemplary implementation process, when the determining module is configured to determine whether the current capacity expansion condition is met, the determining module is specifically configured to: judging whether the time length of the current time detected by last expansion reaches a specified value or not; when the time length reaches a specified value, counting the total number of blocks of the block to be detected, wherein the block to be detected refers to a block generated in a time period from the last expansion detection to the current moment; acquiring the number of blocks of which the block size exceeds a capacity threshold in the blocks to be detected; when the proportion of the block quantity to the total block quantity exceeds a second proportion threshold value, determining that the capacity expansion condition is currently met; and when the proportion of the block quantity in the total block quantity does not exceed the second proportion threshold value, determining that the capacity expansion condition is not met currently.
In an exemplary implementation process, when the determining module is configured to determine whether the current capacity expansion condition is met, the determining module is specifically configured to: receiving a vote in response to the capacity expansion voting application; counting the number of digital currencies owned by accounts agreeing to capacity expansion in all votes; when the proportion of the number of the digital currencies to the total number of the digital currencies in the whole network exceeds a third proportion threshold value, determining that the capacity expansion condition is currently met; or when the proportion of the number of the digital currencies to the total number of the digital currencies in the whole network does not exceed the third proportion threshold value, determining that the capacity expansion condition is not met currently.
In an exemplary implementation process, the selecting module 320, when being configured to select, from the first data request, a data request that is recorded in a block of the primary account, as a second data request, is specifically configured to: carrying out validity check on each first data request to obtain all valid first data requests; counting the data volume of the data information corresponding to all legal first data requests; when the data volume does not exceed the upper limit value of the block capacity, all legal first data requests are selected as second data requests; or when the data volume exceeds the block capacity upper limit value, selecting a part of first data requests from all legal first data requests as second data requests, wherein the data volume of the part of first data requests does not exceed the block capacity upper limit value.
In one exemplary implementation, the specified screening conditions are: one data request corresponds to one block account, and one data request corresponds to one target block chain.
Since the request processing apparatus in this embodiment is capable of executing the request processing method in the foregoing embodiments, reference may be made to the related description of the request processing method in the foregoing embodiments for a part of this embodiment that is not described in detail.
The request processing device provided by the embodiment of the invention can simultaneously output more than 1 block by setting at least one block chain in the designated network and screening the data request corresponding to the account by the block-out account for processing, and can simultaneously output blocks by the block-out accounts in different nodes in the designated network, so that the block-out speed of the whole network is improved, and the processing efficiency of the whole network is improved.
EXAMPLE III
An embodiment of the present invention provides a terminal, where the terminal is provided with any one of the request processing apparatuses in the second embodiment.
Wherein the terminal may be a personal computer, a server, etc.
Example four
An embodiment of the present invention provides a request processing system, where the system includes a plurality of nodes, where any two nodes in the plurality of nodes can perform peer-to-peer communication, and each node in the plurality of nodes is provided with a request processing apparatus in any one of the second embodiment.
Wherein the node device in each node of the plurality of nodes may be the terminal in the third embodiment.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present disclosure, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions in actual implementation, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The above description is only a preferred embodiment of the present disclosure, and should not be taken as limiting the present disclosure, and any modifications, equivalents, improvements, etc. made within the spirit and principle of the present disclosure should be included in the scope of the present disclosure.

Claims (14)

1. A request processing method is applied to a node where a block outlet account in a designated network is located, the designated network is provided with at least one block chain, each block in the designated network is provided with block chain identification information of the block chain, and the method comprises the following steps:
screening all data requests corresponding to the block account from all current data requests to be processed according to specified screening conditions to serve as first data requests, and determining a target block chain corresponding to the first data requests;
selecting a data request of the secondary processing of the local block-out account from the first data request as a second data request;
creating a new block in the target block chain, and recording data information corresponding to the second data request into the new block;
sending the new block to other nodes in the designated network;
the method for screening all data requests corresponding to a block account from all current data requests to be processed to serve as a first data request and determining a target block chain corresponding to the first data request includes:
for each data request to be processed, acquiring an input address of the data request, calculating the input address of the data request based on a consistent hash algorithm to obtain a calculation result, and determining a block chain corresponding to the data request according to the calculation result;
acquiring a block chain to which a block with a block output authority of the block output account belongs as a target block chain;
and selecting the corresponding block chain as the data request of the target block chain as a first data request according to the block chains corresponding to all the data requests to be processed.
2. The method of claim 1, wherein performing an operation on the input address of the data request based on a consistent hashing algorithm to obtain an operation result comprises: performing consistent Hash complementation operation on the input address of the data request to obtain a complementation result;
determining a block chain corresponding to the data request according to the operation result, including: determining a keyword value sub-range to which the remainder result belongs; and searching the block chain corresponding to the key value sub-range, and taking the block chain corresponding to the key value sub-range as the block chain corresponding to the data request.
3. The method of claim 1, further comprising:
judging whether the current capacity expansion condition is met;
and when the current capacity expansion condition is met, adding a new block chain and a first block of the new block chain.
4. The method of claim 3, wherein adding a new blockchain and a first block of the new blockchain when the capacity expansion condition is currently met comprises:
searching a block outlet account with a block outlet authority of a block of a first block chain at present to serve as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in a network;
when the expanded block account is the local block account, creating a new block chain and creating a first block of the new block chain;
and sending the first block to other nodes in the specified network.
5. The method of claim 3, wherein adding a new blockchain and a first block of the new blockchain when the capacity expansion condition is currently met comprises:
searching a block outlet account with a block outlet authority of a block of a first block chain at present to serve as an expansion block outlet account, wherein the first block chain is a block chain generated firstly in a network;
and when the expansion block account is not the local block account, receiving a first block of a new block chain created by the expansion block account, and adding the new block chain according to the first block.
6. The method according to claim 3, wherein each block chain has a corresponding sub-range of key values belonging to a total range of key values, the total range of key values being a range of key values obtained after all input addresses capable of issuing data requests have undergone a specified operation;
when the capacity expansion condition is currently met, after a new block chain and a first block of the new block chain are added, the method further includes:
acquiring a total range of key word values and the number of block chains;
dividing the total range of the key values into a plurality of sub-ranges of the key values according to the number of the block chains;
and allocating the plurality of key value sub-ranges to each block chain according to a specified allocation rule.
7. The method of claim 3, wherein determining whether a capacity expansion condition is currently satisfied comprises:
judging whether the total quantity of blocks to be detected reaches a quantity threshold value, wherein the blocks to be detected refer to blocks generated within a time period from last expansion detection to current time;
when the total number of the blocks reaches the number threshold, counting the number of the blocks of which the block size exceeds a capacity threshold in the blocks to be detected;
when the proportion of the block quantity in the total block quantity exceeds a first proportion threshold value, determining that the capacity expansion condition is met currently; and when the proportion of the block quantity to the total block quantity does not exceed the first proportion threshold value, determining that the capacity expansion condition is not met currently.
8. The method of claim 3, wherein determining whether a capacity expansion condition is currently satisfied comprises:
judging whether the time length of the current time detected by last expansion reaches a specified value or not;
when the time length reaches the specified value, counting the total number of blocks of the block to be detected, wherein the block to be detected refers to a block generated in a time period from the last expansion detection to the current moment;
acquiring the number of blocks of which the block size exceeds a capacity threshold in the blocks to be detected;
when the proportion of the block quantity in the total block quantity exceeds a second proportion threshold value, determining that the capacity expansion condition is met currently; and when the proportion of the block quantity in the total block quantity does not exceed the second proportion threshold value, determining that the capacity expansion condition is not met currently.
9. The method of claim 3, wherein determining whether a capacity expansion condition is currently satisfied comprises:
receiving a vote in response to the capacity expansion voting application;
counting the number of digital currencies owned by accounts agreeing to capacity expansion in all votes;
when the proportion of the number of the digital currencies to the total number of the digital currencies in the whole network exceeds a third proportion threshold value, determining that the capacity expansion condition is currently met; or when the proportion of the digital currency amount to the total digital currency amount in the whole network does not exceed the third proportion threshold value, determining that the capacity expansion condition is not met currently.
10. The method of claim 1, wherein selecting the data request recorded in the block from the first data request as the second data request comprises:
carrying out validity check on each first data request to obtain all valid first data requests;
counting the data volume of the data information corresponding to all legal first data requests;
when the data volume does not exceed the upper limit value of the block capacity, all legal first data requests are selected as second data requests; or when the data volume exceeds the upper limit value of the block capacity, selecting a part of first data requests from all legal first data requests as second data requests, wherein the data volume of the part of first data requests does not exceed the upper limit value of the block capacity.
11. The method of claim 1, wherein the specified screening condition is: one data request corresponds to one block account, and one data request corresponds to one target block chain.
12. A request processing apparatus, configured to be set in a node where a block-out account in a designated network is located, where the designated network has at least one block chain, and each block in the designated network is provided with block chain identification information of the block chain to which the block chain belongs, the apparatus comprising:
the screening and determining module is used for screening all data requests corresponding to the block account from all current data requests to be processed to serve as first data requests, and determining a target block chain corresponding to the first data requests;
the selection module is used for selecting the data request of the secondary processing of the block account from the first data request as a second data request;
a block output module, configured to create a new block in the target block chain, and record data information corresponding to the second data request into the new block;
a sending module, configured to send the new block to other nodes in the designated network;
the screening and determining module is specifically configured to, for each data request to be processed, obtain an input address of the data request, perform an operation on the input address of the data request based on a consistent hash algorithm to obtain an operation result, and determine a block chain corresponding to the data request according to the operation result;
acquiring a block chain to which a block with a block output authority of the block output account belongs as a target block chain;
and selecting the corresponding block chain as the data request of the target block chain as a first data request according to the block chains corresponding to all the data requests to be processed.
13. A terminal, characterized in that it is provided with a request processing device according to claim 12.
14. A request processing system, characterized in that the system comprises a plurality of nodes, any two of which are capable of point-to-point communication, each of which is provided with a request processing apparatus according to claim 12.
CN201710724782.7A 2017-08-22 2017-08-22 Request processing method, device, system and terminal Active CN109428906B (en)

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 CN109428906A (en) 2019-03-05
CN109428906B true 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)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110445626B (en) * 2019-07-15 2021-11-02 杭州复杂美科技有限公司 Block packing and broadcasting method and system, equipment and storage medium
CN112104747B (en) * 2020-10-30 2021-02-26 广州市玄武无线科技股份有限公司 Request response system based on chain processing

Citations (3)

* Cited by examiner, † Cited by third party
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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170236104A1 (en) * 2016-02-12 2017-08-17 D+H Usa Corporation Peer-to-Peer Financial Transactions Using A Private Distributed Ledger

Patent Citations (3)

* Cited by examiner, † Cited by third party
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
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

Also Published As

Publication number Publication date
CN109428906A (en) 2019-03-05

Similar Documents

Publication Publication Date Title
CN109522362B (en) Incomplete data synchronization method, system and equipment based on block chain data
US20230044605A1 (en) Methods for extending a proof-of-space-time blockchain
CN108769146B (en) Data transmission method and device based on block chain and block chain system
CN112153085A (en) Data processing method, node and block chain system
CN111385370B (en) ID allocation method, device, storage medium and ID allocation system
CN110543448A (en) data synchronization method, device, equipment and computer readable storage medium
CN110543488B (en) Verification node updating method, device and equipment
CN109428906B (en) Request processing method, device, system and terminal
CN112069169A (en) Block data storage method and device, electronic equipment and readable storage medium
CN111163186B (en) ID generation method, device, equipment and storage medium
CN109474691A (en) A kind of method and device of internet of things equipment identification
CN113361913A (en) Communication service arranging method, device, computer equipment and storage medium
CN111638949A (en) Time series data segmentation construction method and device and computer equipment
CN110162274B (en) Data processing method, device and equipment based on block chain
US20150278543A1 (en) System and Method for Optimizing Storage of File System Access Control Lists
CN112436962B (en) Block chain consensus network dynamic expansion method, electronic device, system and medium
CN111680282B (en) Node management method, device, equipment and medium based on block chain network
CN110071966B (en) Block chain networking and data processing method based on cloud platform
CN114124404B (en) Data processing method, device, server and storage medium
CN112039893B (en) Private transaction processing method and device, electronic equipment and readable storage medium
CN115114009A (en) Data query method, master node and slave nodes
CN106156169B (en) Discrete data processing method and device
CN109413095B (en) Method and device for defending attack
CN112508571A (en) Data processing method and device based on block chain, computer equipment and storage medium
CN108259545B (en) Port security policy diffusion method and 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