• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    the present application discloses a method and a data processing device based on a trust protocol. the method includes the following: storing different service data in different data processing queues based on processing levels and reading a predetermined amount of service data from different data processing queues based on a predetermined condition when storing data in a block, so that service data with different levels of processing can be processed, an existing technology rule for service data processing based only on time can be broken and an existing technology issue of low processing efficiency of a service with a relatively high service priority can be alleviated. the solution provided in the embodiments of this application not only guarantees the efficiency of service data processing for a service with high service priority, but also ensures the efficiency of service data processing for a service with low service priority. when a service processing priority is satisfied, the flexibility of processing service data in a trust protocol is increased and the use value of the trust protocol in the field of application of the service is also improved.
    公开号:BR112019013394A2
    申请号:R112019013394-1
    申请日:2018-03-26
    公开日:2020-03-03
    发明作者:Qiu Honglin
    申请人:Alibaba Group Holding Limited；
    IPC主号:
    专利说明:

    “DATA PROCESSING METHOD AND DATA PROCESSING DEVICE” Technical Field [001] This application refers to the field of information processing technologies on the Internet and the field of computer technologies and, in particular, to a method and device data processing based on trust protocol (blockchain).
    Background of the Invention [002] Trust protocol technology is also referred to as distributed accounting technology. As a distributed Internet database technology, trust protocol technology is characterized by decentralization, transparency, non-tampering and credibility. A network built on trust protocol technology can be called a trust protocol network. The trust network includes a network node (which can also be called a trust protocol node). Each network node corresponds to at least one trust protocol and each trust protocol includes at least one block.
    [003] Upon receiving data to be stored, the network node transmits the data to be stored to other network nodes in the trust protocol network. Therefore, each network node in the trust protocol network stores complete data from the trust protocol network, and the data stored on one network node is consistent with that stored on another node.
    [004] The data is generally stored in the trust protocol network in two stages: In a first stage, the trust protocol network receives data to be stored and transmits the data throughout the trust protocol network. As such, each node in the network
    Petition 870190059925, dated 06/27/2019, p. 44/124
    2/29 trust protocol receives the data to be stored. In this case, each network node in the trust protocol network writes the data to be stored in a cache. In a second stage, a network node in the trust protocol network that gets permission to store the data to be stored writes the data to be stored in a block when obtaining write permission and adds the block to an existing trust protocol. It can be seen that the data is stored on the trusted protocol network using an asynchronous write policy.
    [005] However, in a real service scenario, when service data is stored on a trusted protocol network using an asynchronous write policy, a data processing queue is usually maintained in a first stage and data to be stored are recorded sequentially in the data processing queue based on a time stamp of the data to be stored. As such, in a second stage, the data to be stored in the data processing queue are recorded in a block based on a first in first out principle.
    [006] According to research, in the previous method, there are the following problems with data storage in the trust protocol network: For services with relatively high service priorities, the efficiency of processing service data is relatively low and, consequently , the processing efficiency of these services is relatively low.
    Short Description [007] In view of the above, the embodiments of the present application provide a data processing method and device based on a reliable protocol, to alleviate an issue of existing low efficiency service data processing technology
    Petition 870190059925, dated 06/27/2019, p. 45/124
    3/29 of a service with a relatively high service priority.
    [008] An embodiment of the present application provides a data processing method based on a trust protocol, including the following: obtaining, through a node in a trust protocol network, at least a portion of generated service data over a predetermined period of time, in which the service data includes a level of processing of a service that generates the service data; store, through the node, the service data in a data processing queue that corresponds to the processing level; and separately reading, through the node, service data that satisfy a predetermined condition of different data processing queues when a new block is generated and storing the service data read in the block.
    [009] An embodiment of the present application further provides a data processing device based on a reliable protocol, including the following: an acquisition unit, configured to obtain at least a portion of service data generated in a period of time predetermined, where the service data includes a service processing level that generates the service data; a storage unit, configured to store service data in a data processing queue that corresponds to the processing level; and a processing unit, configured to read service data separately that satisfy a predetermined condition of different data processing queues when a new block is generated and store the service data read in the block.
    [010] At least one of the technical solutions described previously used in the embodiments of this application can achieve the following beneficial effects:
    [011] Different service data is stored in queues of
    Petition 870190059925, dated 06/27/2019, p. 46/124
    4/29 different data processing based on processing levels, and a predetermined amount of service data is read from the different data processing queues based on a predetermined condition when storing data in a block, so that service data with different levels of processing can be processed, an existing technology rule for processing service data based on time can be broken, and an issue of existing low-efficiency technology processing a service with a service priority relatively high can be relieved. The solution provided in the embodiments of this application not only guarantees the efficiency of service data processing for a service with high service priority, but also ensures the efficiency of service data processing for a service with low service priority. When a service processing priority is satisfied, the flexibility of processing service data in a trust protocol is increased and the use value of the trust protocol in the field of service application is also improved.
    Brief Description of the Figures [012] The accompanying drawings described here are intended to provide an additional understanding of the present application and form a part of the present application. The illustrative embodiments of the present application and their descriptions are intended to describe the present application and are not limitations in the present application. In the attached drawings:
    [013] Figure 1 is a flowchart illustrating a data processing method based on a trust protocol, according to an embodiment of the present application;
    [014] Figure 2 (a) is a diagram that illustrates a data processing queue that corresponds to service data with different
    Petition 870190059925, dated 06/27/2019, p. 47/124
    5/29 processing levels, according to an embodiment of the present application;
    [015] Figure 2 (b) is a diagram illustrating a data processing queue that corresponds to service data with different levels of processing, according to an embodiment of the present application;
    [016] Figure 3 is a diagram illustrating a scenario for a data processing method based on a trust protocol, according to an embodiment of the present application; and [017] Figure 4 is a diagram illustrating an example of a structure of a data processing device based on a trust protocol, according to an embodiment of the present application.
    Description of Forms of Realization [018] To clarify the objectives, technical solutions and advantages of this application, the following describes the technical solutions of this application in a clear and comprehensive manner with reference to specific and drawings attached to this application. Apparently, the described embodiments are just a few and not all embodiments of the present application. All other embodiments obtained by a person skilled in the art based on the embodiments of this application, without creative efforts, should fall within the scope of protection of this application.
    [019] The technical solutions provided in the embodiments of the present application are described in detail below, with reference to the attached drawings.
    [020] Figure 1 is a schematic flowchart illustrating a data processing method based on a trust protocol, according to an embodiment of the present application. The method can be
    Petition 870190059925, dated 06/27/2019, p. 48/124
    6/29 described as follows. The execution body in this embodiment of the present application can be any service node (which can also be referred to as a trust protocol node, and is simply referred to as a node below) in a trust protocol network, and not is limited here. In this embodiment of the present application, an example that the execution body is a node is used for description in detail.
    [021] Step (101): A node in the trust protocol network obtains at least a portion of the service data generated in a predetermined period of time.
    [022] Service data includes a service processing level that generates the service data.
    [023] In this embodiment of the present application, service priorities are first determined for different services. Here, a service priority corresponds to a level of service data processing, that is, a higher service priority indicates a higher level of processing of the service data generated for the service. Then, a field that represents a service priority (or a processing level) for a service for which the service data is generated is added to the service data. In this way, after receiving the service data, the node can determine the level of processing of the service data using the field.
    [024] Typically, fields included in service data include, but are not limited to, a scatter value, a version number, a public key, a signature, a scatter value of a block to which the service data belongs , a time stamp (that is, a time when the node processes service data), etc. In this case, the fields included in the service data described in this embodiment of the present application include, but are not limited to those shown in Table 1. Some
    Petition 870190059925, dated 06/27/2019, p. 49/124
    7/29 attributes of the fields are described in Table 1.
    Table
    Field name Attribute Description Dispersion value Indicates a unique identifier for each part of the service data Version number Indicates a version identifier for a service data generation engine Public key Indicates a public key for a transaction initiation party signature Indicates information obtained by a service initiation party by signing with a private key, where if the signature is verified by a public key, it indicates that the service is valid Service information Indicates specific service information that corresponds to the service data, such as a cash flow and a change in capital ownership, which is recorded by a transaction initiation party Scattering of a block to which the service data belongs Indicates the dispersion value of the block to which the service data belongs, if the service data is included in a consensus; and indicates invalid if service data is not included in a consensus. Time stamp Indicates a time when service data is processed by the node (determined with millisecond precision)
    [025] Preferably, in this embodiment of the present application, the data processing queues can be further configured for different service priorities based on determined service priorities. Thus, when receiving service data, service data can be stored separately based on service priorities.
    [026] In this embodiment of the present application, service priorities divided into a “high” service priority and a “low” service priority are used as an example for subsequent description. If service priorities are divided into a “high” service priority and a “low” service priority, correspondingly, the processing levels will also be divided into a “high” processing level and a “low” processing level.
    [027] It is worth noting that, because there is a time interval between two adjacent blocks in a confidence protocol, this time interval can be used as a reference condition for
    Petition 870190059925, dated 06/27/2019, p. 50/124
    8/29 define a period of time in this embodiment of this request. Embodiments are not limited here.
    [028] Step (102): The node stores the service data in a data processing queue that corresponds to a processing level.
    [029] In this embodiment of the present application, due to the fact that different data processing queues can be created in advance based on the services' service priorities (or service processing levels), a mapping relationship between a level of processing and a data processing queue identifier can be established in advance.
    [030] Upon receiving service data, the node extracts a processing level from the service data (this extraction may include reading a processing level field in the service data and determining a processing level from the service data based on the processing level field), determines a data processing queue that corresponds to the processing level included in the service data based on a pre-established mapping relationship between a processing level and a processing queue identifier data processing and stores the service data in the given data processing queue.
    [031] Figure 2 (a) is a schematic diagram illustrating a data processing queue that corresponds to service data with different levels of processing, according to an embodiment of the present application. It can be seen from Figure 2 (a) that two data processing queues are included. A data processing queue corresponds to a high processing level, that is, the service data stored in the data processing queue is generated for a service
    Petition 870190059925, dated 06/27/2019, p. 51/124
    9/29 with a high service priority (or a high level of service processing). The other data processing queue corresponds to a low level of processing, that is, the service data stored in the data processing queue is generated for a service with a low service priority (or a low level of service processing).
    [032] It is worth noting that the service data stored in the data processing queue can be organized based on the processing times of the service data or can be organized based on the service attributes included in the service data or can be organized based on a queue principle (a first in, first out principle). Embodiments are not limited here.
    [033] Step (103): The node reads, separately, the service data that satisfy a predetermined condition of different data processing queues when a new block is generated and stores the service data read in the block.
    [034] In this embodiment of the present request, each node in the trust protocol network processes service data in two stages. A first stage can correspond to step (101) and step (102) in this embodiment of the present application. A second stage can correspond to step (103) in this embodiment of the present application, that is, storing the service data in the block. It is worth noting that the solution described in this embodiment of the present order focuses on the description of specific service data that is read from different data processing queues to be stored in a block and, therefore, the verification, the consensus etc. are omitted to simplify this embodiment of the present application. Such forms of processing can be performed based on existing technology.
    Petition 870190059925, dated 06/27/2019, p. 52/124
    10/29 [035] Preferably, the predetermined condition described in this embodiment of the present application can be determined based on a storage capacity of the block and a predetermined processing rate of service data with different levels of processing, or it can be determined in other ways, as long as it is ensured that the service data of the different levels of service processing can be uniformly recorded in the block.
    [036] The following describes in detail how the node separately reads the service data that satisfy the predetermined condition of the different data processing queues.
    [037] The node performs separately the following operations for the different data processing queues: determining a processing level that corresponds to a first data processing queue; if the processing level is a first processing level, determining a predetermined processing rate of service data with a second processing level, where the first processing level is higher than the second processing level; determining a first amount of service data processing with the first level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the first processing amount of the first data processing queue based on the first processing amount.
    [038] It is worth noting that “first” and “second” included in the “first data processing row” and “second data processing row” described in this embodiment of the present application have no special meanings and only represent different data processing queues.
    Petition 870190059925, dated 06/27/2019, p. 53/124
    11/29 [039] “First” and “second” included in the “first processing level” and “second processing level” described in this embodiment of the present application do not have special meanings and only represent two different processing levels. In this embodiment of the present application, assume that the first level of processing is higher than the second level of processing.
    [040] It is worth noting that "first" and "second" included in the "first processing amount" and "second processing amount" described in this embodiment of the present application have no special meanings and only represent different amounts.
    [041] The first row of data processing is used as a research object.
    [042] Step (1): Determine a processing level that corresponds to the first row of data processing.
    [043] Step (2): Determine whether the processing level is the first processing level or the second processing level, whether the processing level is the first processing level, perform step (3) and whether the processing level processing is the second level of processing, perform step (4).
    [044] Step (3): Determine the predetermined processing rate of the service data with the second level of processing and determine the first amount of processing of the service data with the first level of processing based on the determined processing rate and the block storage capacity; and sequentially reading the service data that satisfies the first processing amount of the first data processing queue based on the first processing amount.
    [045] Step (4): Determine the processing ratio
    Petition 870190059925, dated 06/27/2019, p. 54/124
    12/29 predetermined service data with the second level of processing and determining the second amount of processing of the service data with the second level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the second processing amount of the first data processing queue based on the second processing amount.
    [046] It is worth noting that, in this embodiment of the present application, “the predetermined processing rate of the service data with the second level of processing” can be understood as a minimum service data ratio with a level of processing relatively low in this embodiment of the present application, that is, a reason for a capacity occupied by a minimum amount of service data with a relatively low level of processing that needs to be stored in relation to a storage capacity of a block when the data is stored in the block at this point. The processing ratio here can be adjusted based on actual demands. Embodiments are not limited here.
    [047] Suppose the predetermined processing rate of service data with the second level of processing is p, the storage capacity (which can also be understood as an upper limit amount of service data that can be carried by the block) of block is x. In this case, it is determined that the first amount of processing of service data with the first level of processing can be expressed as (1 -p) χ x, and the second amount of processing of service data with the second level of processing can be expressed be expressed as px.
    [048] There is another case in this embodiment of the present
    Petition 870190059925, dated 06/27/2019, p. 55/124
    13/29 order, that is, a service data processing amount stored in the first data processing queue is less than the first processing amount, which means that after the first processing amount is determined, the service data stored in the first row of data processing cannot satisfy the requirement of the first amount of processing. To implement the appropriate use of resources, in this case, the service data is read sequentially from the first data processing queue based on the amount of processing of the service data stored in the first data processing queue. That is, all service data stored in the first data processing queue is read.
    [049] In this case, a service data processing amount is read from a second data processing queue based on the amount of service data processing stored in the first data processing queue and the storage capacity of the block, and service data are read sequentially from the second data processing row based on the determined amount of processing of the service data read from the second data processing row.
    [050] The expression described above is still used as an example here. Suppose the amount of processing of the service data stored in the first data processing queue is m. Since a value that corresponds to (1 - p) χ x is greater than m, the first amount of processing must be m. As such, the second amount of processing determined must be (x - m). That is, when a quantity of service data with a relatively high service priority is relatively small, it can be ensured that the service data
    Petition 870190059925, dated 06/27/2019, p. 56/124
    14/29 with a relatively high service priority can preferably be processed, and service data with a relatively low service priority can be processed as much as possible.
    [051] In this embodiment of the present application, the sequential reading of service data that satisfies the first processing amount of the first data processing row includes the following: sequentially reading the service data that satisfies the first processing amount of the first row of data processing based on the order of a corresponding processing time of the service data.
    [052] Likewise, the service data that satisfies the second processing amount can also be read sequentially from the second data processing queue based on the order of a corresponding processing time of the service data.
    [053] In this embodiment of the present application, storing the service data read in the block includes the following: sequentially storing the service data read in the block based on the corresponding processing time order of the service data.
    [054] For example, Figure 2 (b) is a schematic diagram illustrating a data processing queue that corresponds to service data with different levels of processing, according to an embodiment of the present application. It can be seen from Figure 2 (b) that different amounts of service data are read sequentially from the two data processing queues in the manner described in step (103).
    [055] Suppose that a predetermined processing rate of storing service data with a relatively low level of processing in a block is 30% each time and that a storage capacity of the block is 10, that is, 10 parts
    Petition 870190059925, dated 06/27/2019, p. 57/124
    15/29 of service data can be stored. Four parts of service data are stored in a data processing queue with a high level of processing, and eight parts of service data are stored in a data processing queue with a low level of processing. It is determined that the amount of service data processing with the high processing level that needs to be selected is (1-30%) x 10 = 7, according to a system configuration policy. Apparently, 4 is less than 7. Therefore, all four pieces of service data stored in the data processing queue with the high processing level are retrieved and six pieces of service data are retrieved from the data processing queue with the low processing level. The 10 pieces of service data obtained are stored in the block based on the processing times of the service data.
    [056] Suppose that a predetermined processing rate of storing service data with a relatively low level of processing in a block is 30% each time and that a storage capacity of the block is 10, that is, 10 parts of service data can be stored. Eight pieces of service data are stored in a data processing queue with a high level of processing, and eight pieces of service data are stored in a data processing queue with a low level of processing. It is determined that the amount of service data processing with the high processing level that needs to be selected is (1-30%) χ 10 = 7, according to a system configuration policy. Apparently, 8 is greater than 7. Therefore, seven parts of service data are retrieved from the data processing queue with the high processing level and three parts of service data are retrieved from the data processing queue with the processing level low. The 10 pieces of service data obtained are
    Petition 870190059925, dated 06/27/2019, p. 58/124
    16/29 stored in the block based on the processing times of the service data.
    [057] In this embodiment of the present application, the node can also read separately the service data that satisfy the predetermined condition of the different data processing queues in the following method: perform separately, through the node, the following operations for the different data processing queues: determining a processing level that corresponds to a first data processing queue and obtaining a predetermined processing ratio that corresponds to the processing level; and determining a processing amount based on the determined processing rate and storage capacity of the block, and sequentially reading the service data that satisfies the processing amount of the first data processing row.
    [058] For each data processing queue, a processing level that corresponds to the data processing queue is determined, and a processing ratio that corresponds to the data processing queue is determined based on a predetermined processing reason that corresponds to a processing level. A processing amount is determined based on the determined processing rate and the storage capacity of the block, and the service data that satisfies the processing amount is read sequentially from the data processing queue.
    [059] For example, n data processing queues are included and the n data processing queues correspond to n processing levels. The processing ratios that correspond to different levels of processing can be represented by a, that is, a
    Petition 870190059925, dated 06/27/2019, p. 59/124
    17/29 processing that corresponds to the first processing level is ai, a processing ratio that corresponds to a processing level i s is ai and a processing ratio that corresponds to the umpteenth processing level is an, e (ai + a2 + ... + ai + ... + an) = 1. For each data processing queue, if a block's storage capacity is X, an amount of processing that corresponds to the data processing queue with the first processing level is ai χ X, a processing amount that corresponds to the data processing queue with the processing level i s is ai χ X, and a processing amount that corresponds to the data processing queue with the umpteenth level of processing processing is an χ X.
    [060] According to the technical solution provided in this embodiment of the present application, different service data is stored in different data processing queues based on processing levels, and a predetermined amount of service data is read from of the different data processing queues based on a predetermined condition when storing data in a block, so that service data with different processing levels can be processed, an existing technology rule for service data processing based only on time can be broken and an issue of existing low-efficiency technology for processing a service with a relatively high service priority can be alleviated. The solution provided in the embodiments of this application not only guarantees the efficiency of service data processing for a service with high service priority, but also ensures the efficiency of service data processing for a service with low service priority. When a service processing priority is satisfied, the flexibility of processing service data in a trusted protocol is
    Petition 870190059925, dated 06/27/2019, p. 60/124
    18/29 increased and the use value of the trust protocol in the field of application of the service is also improved.
    [061] Figure 3 is a diagram illustrating a scenario for a data processing method based on a trust protocol, according to an embodiment of the present application. It can be seen from Figure 3 that, when receiving service data, a node in a trusted protocol network can select a data processing queue for the service data based on a level of service data processing and write the service data to the data processing queue. When a new block is generated, the node selects service data from different data processing queues based on a service data selection policy (that is, the way described in step (103) in the described embodiment previously) and stores the selected service data in the block.
    Embodiment 2 [062] Figure 4 is a schematic structural diagram illustrating a data processing device based on a reliable protocol, according to an embodiment of the present application. The data processing device includes an acquisition unit (401), a storage unit (402) and a processing unit (403).
    [063] The acquisition unit (401) is configured to obtain at least a portion of service data generated in a predetermined period of time, in which the service data includes a service processing level that generates the service data .
    [064] The storage unit (402) is configured to store the service data in a data processing queue that corresponds to the processing level.
    Petition 870190059925, dated 06/27/2019, p. 61/124
    19/29 [065] The processing unit (403) is configured to read service data separately that satisfy a predetermined condition from different data processing queues when a new block is generated and store the service data read in the block .
    [066] In another embodiment of the present application, the predetermined condition is determined based on a storage capacity of the block and a predetermined processing rate of service data with different levels of processing.
    [067] In another embodiment of the present application, the processing unit (403) reads separately the service data that satisfies a predetermined condition from different data processing queues, including the following: perform the following operations separately for the different data processing queues: determining a level of processing that corresponds to a first data processing queue; if the processing level is a first processing level, determining a predetermined processing rate of service data with a second processing level, where the first processing level is higher than the second processing level; determining a first amount of service data processing with the first level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the first processing amount from the first data processing queue based on the first processing amount.
    [068] In another embodiment of the present application, the processing unit (403) sequentially reads the service data that satisfies the first processing amount of the first data processing row based on the first processing amount,
    Petition 870190059925, dated 06/27/2019, p. 62/124
    20/29 including the following: when the amount of service data processing stored in the first data processing queue is less than the first processing amount, sequentially read the service data from the first data processing queue based on the amount service data stored in the first data processing queue.
    [069] In another embodiment of the present application, the data processing device further includes a determination unit (404).
    [070] The unit of determination (404) determines a service data processing amount read from a second data processing queue based on the amount of service data processing stored in the first data processing queue and the block storage capacity; and sequentially reads the service data from the second data processing row based on the determined amount of processing of the service data read from the second data processing row.
    [071] In another embodiment of the present application, the processing unit (403) further determines the predetermined processing rate of the service data with the second processing level if the processing level is the second processing level; determines a second amount of processing of the service data with the second level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reads the service data that satisfies the second processing amount of the first data processing queue based on the second processing amount.
    [072] In another embodiment of this application, the
    Petition 870190059925, dated 06/27/2019, p. 63/124
    21/29 processing unit (403) sequentially reads the service data that satisfies the first processing amount of the first data processing row, including the following: sequentially reading the service data that satisfies the first processing amount of the first row data processing based on the order of a corresponding processing time of the service data.
    [073] In another embodiment of the present application, the processing unit (403) stores the service data read in the block, including the following: sequentially storing the service data read in the block based on the order of the corresponding processing time service data.
    [074] In another embodiment of the present application, the data processing device further includes a creation unit (405).
    [075] The creation unit (405) creates different data processing queues in advance based on service processing levels.
    [076] The storage unit (402) stores the service data in a data processing queue that corresponds to the processing level, including the following: determining the data processing queue that corresponds to the processing level included in the data of service based on a mapping relationship between a processing level and a data processing queue; and store the service data in the given data processing queue.
    [077] In another embodiment of the present application, the processing unit (403) reads the service data separately that satisfies a predetermined condition of different data processing queues, including the following: separately execute the following
    Petition 870190059925, dated 06/27/2019, p. 64/124
    22/29 operations for the different data processing queues: determine a processing level that corresponds to a first data processing queue and obtain a predetermined processing ratio that corresponds to the processing level; and determining a processing amount based on the determined processing rate and storage capacity of the block, and sequentially reading the service data that satisfies the processing amount of the first data processing row.
    [078] It is worth noting that the data processing device provided in this embodiment of the present application can be implemented using software or hardware. Embodiments are not limited here. The data processing device stores different service data in different data processing queues based on processing levels and reads a predetermined amount of service data from different data processing queues based on a predetermined condition when storing data in a block, so that service data with different levels of processing can be processed, an existing technology rule of service data processing based only on time can be broken and an existing technology issue of low efficiency processing a service with a relatively high service priority can be alleviated. The solution provided in the embodiments of this application not only guarantees the efficiency of service data processing for a service with high service priority, but also ensures the efficiency of service data processing for a service with low service priority. When a service processing priority is satisfied, the flexibility of processing service data in a trust protocol is increased and the use value of the trust protocol in the field of application
    Petition 870190059925, dated 06/27/2019, p. 65/124
    23/29 of the service is also improved.
    [079] In the 1990s, if a technical improvement was a hardware improvement (for example, an improvement to a circuit structure, such as a diode, a transistor or a switch) or a software improvement (an improvement to a method procedure) could be clearly distinguished. However, as technologies develop, current improvements in many method procedures can be seen as direct improvements in hardware circuit structures. A designer usually schedules an improved method procedure on a hardware circuit to obtain a corresponding hardware circuit structure. Therefore, a method procedure can be improved using a hardware entity module. For example, a programmable logic device (PLD) (for example, a field programmable gate network (FPGA)) is an integrated circuit, and a logical PLD function is determined by a user through device programming. The designer performs the programming to “integrate” a digital system into a PLD without asking a chip manufacturer to design and produce an application-specific integrated circuit chip. In addition, today, instead of manually manufacturing an integrated circuit chip, this programming is mainly implemented using “logic compiler” software. The logical compiler software is similar to a software compiler used to develop and write a program. The original code needs to be written in a specific programming language for compilation. The language is referred to as a hardware description language (HDL). There are several HDLs, such as Advanced Boolean Expression Language (ABEL), Altera Hardware Description Language (AHDL), Confluence, Cornell University Programming Language (CUPL), HDCal, Java Hardware Description Language (JHDL), Lava, Lola, MyHDL, PALASM and
    Petition 870190059925, dated 06/27/2019, p. 66/124
    24/29
    Ruby hardware description language (RHDL). High Speed Integrated Circuit Hardware (VHDL) and Verilog are the most used language today. A person skilled in the art should also understand that a hardware circuit that implements a logical method procedure can be easily obtained as long as the method procedure is programmed logically using the various hardware description languages described and is programmed in an integrated circuit.
    [080] A controller can be implemented using any appropriate method. For example, the controller can be a microprocessor or processor, or a computer-readable medium that stores computer-readable program code (such as software or firmware) that can be run by the microprocessor or processor, a logic port, a switch , an application specific integrated circuit (ASIC), a programmable logic controller and a built-in microprocessor. Controller examples include, but are not limited to, the following microprocessors: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicone Labs C8051F320. The memory controller can also be implemented as a part of the memory control logic. A person skilled in the art also knows that, in addition to implementing the controller using computer-readable program code, logical programming can be performed in the method steps to allow the controller to implement the same function in the forms of the logical port, the switch, application-specific integrated circuit, programmable logic controller, or built-in microcontroller. Therefore, the controller can be considered as a hardware component, and a device configured to implement various functions in the controller can also be considered as a structure in the hardware component. Alternatively, the device configured to implement various functions can even be considered
    Petition 870190059925, dated 06/27/2019, p. 67/124
    25/29 both as a software module that implements the method and as a structure in the hardware component.
    [081] The system, device, module or unit illustrated in the previous embodiments can be implemented using a computer chip or an entity, or can be implemented using a product with a certain function. A typical deployment device is a computer. The computer can be, for example, a personal computer, a portable computer, a cell phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an e-mail device , a game console, a tablet computer, a usable device, or a combination of any of those devices.
    [082] To facilitate description, the device above is described by dividing the functions into several units. Certainly, when the present application is implemented, a function of each unit can be implemented in one or more pieces of software and / or hardware.
    [083] A person skilled in the art should understand that an embodiment of the present invention can be provided as a method, system or computer program product. Therefore, the present invention can use a form of hardware implementations only, software implementations only, or implementations with a combination of software and hardware. In addition, the present invention may use a form of a computer program product that is implemented on one or more computer-usable storage media (including, but not limited to, disk memory, CDROM, optical memory, etc. .) that include program code usable by computer.
    [084] The present invention is described with reference to
    Petition 870190059925, dated 06/27/2019, p. 68/124
    26/29 flowcharts and / or block diagrams of the method, the device (system) and the computer program product based on the embodiments of the present invention. It is worth noting that computer program instructions can be used to implement each process and / or each block in flowcharts and / or block diagrams and a combination of processes and / or blocks in flowcharts and / or block diagrams. These computer program instructions can be provided for a general-purpose computer, a dedicated computer, an embedded processor, or a processor from another programmable data processing device to generate a machine, so that instructions executed by the computer or the processor another programmable data processing device manages a device to implement a specific function in one or more processes in flowcharts and / or in one or more blocks in block diagrams.
    [085] These computer program instructions can be stored in a computer-readable memory that can instruct the computer or other programmable data-processing device to function in a specific way, so that the instructions stored in the computer-readable memory generate a artifact that includes an instructional device. The instruction device implements a specific function in one or more processes in the flowcharts and / or in one or more blocks in the block diagrams.
    [086] These computer program instructions can be loaded onto the computer or other programmable data processing device, so that a series of operations and steps are performed on the computer or on the other programmable device, thereby generating computer-implemented processing. Therefore, instructions executed on the computer or other programmable device provide
    Petition 870190059925, dated 06/27/2019, p. 69/124
    27/29 steps to implement a specific function in one or more processes in flowcharts and / or in one or more blocks in block diagrams [087] In a typical configuration, a computing device includes one or more processors (CPUs), one or more input / output interfaces, one or more network interfaces and one or more memories.
    [088] Memory may include non-persistent memory, random access memory (RAM), non-volatile memory and / or other form that is in a computer-readable medium, for example, a read-only memory (ROM) or a flash memory (flash RAM). Memory is an example of a computer-readable medium.
    [089] The computer-readable medium includes persistent, non-persistent, mobile and immobile media that can store information using any method or technology. The information can be a computer-readable instruction, a data structure, a program module or other data. Examples of a computer storage medium include, but are not limited to, a parameter random access memory (PRAM), a static random access memory (SRAM), a dynamic random access memory (DRAM), another type of memory random access memory (RAM), a read-only memory (ROM), an electrically erasable programmable and read-only memory (EEPROM), a flash memory or other memory technology, a read-only memory on a compact disc (CD-ROM) ), a digital versatile disc (DVD) or other optical storage, a magnetic tape cassette, a magnetic tape / magnetic disk storage or other magnetic storage device. The computer's storage medium can be used to store information accessible by the computing device. Based on the definition in this specification, the computer-readable medium does not include computer-readable transient means (transient means), such as a data signal
    Petition 870190059925, dated 06/27/2019, p. 70/124
    28/29 modulated and a carrier.
    [090] It is also worth noting that the terms “include”, “contain”, or any other variants thereof, are intended to cover a non-exclusive inclusion, so that a process, method, product or device that includes a series of elements, not only includes those elements, but also includes other elements that are not expressly listed, or even includes elements inherent to such a process, method, product or device. Without further restrictions, an element preceded by "includes a ..." does not prevent the existence of additional identical elements in the process, method, product or device that includes the element.
    [091] The present application can be described in the general context of computer executable instructions executed by a computer, for example, a program module. Generally, the program module includes a routine, program, object, component, data structure, etc., that performs a specific task or implements a specific abstract data type. The present application can also be practiced in distributed computing environments. In distributed computing environments, tasks are performed by remote processing devices that are connected via a communications network. In a distributed computing environment, the program module can be located on both local and remote computer storage media that includes storage devices.
    [092] The embodiments in this specification are progressively described. For equal or similar parts of the embodiments, references to the embodiments can be made. Each embodiment focuses on a difference from other embodiments. In particular, an embodiment of the system is basically similar to an embodiment of the method and is therefore
    Petition 870190059925, dated 06/27/2019, p. 71/124
    29/29 briefly described. For related parties, references may be made to related descriptions in the embodiment of the method [093] The previous embodiments are embodiments of the present application, and are not intended to limit the present application. A person skilled in the art can make several modifications and changes to this application. Any modification, equivalent substitution or improvement made without departing from the spirit and principle of this application must be within the scope of the claims in this application.
    权利要求:
    Claims (20)
    [1]
    Claims
    1. DATA PROCESSING METHOD based on a trust protocol (blockchain), characterized by the fact that it comprises:
    obtain, through a node in a trust protocol network, at least a portion of service data generated in a predetermined period of time, in which the service data comprises a level of processing of a service that generates the service data ;
    store, through the node, the service data in a data processing queue that corresponds to the processing level;
    read separately, through the node, service data that satisfy a predetermined condition of different data processing queues when a new block is generated; and store the service data read in the block.
    [2]
    2. DATA PROCESSING METHOD, according to claim 1, characterized by the fact that the predetermined condition is determined based on a storage capacity of the block and a predetermined processing rate of service data with different levels of processing.
    [3]
    3. DATA PROCESSING METHOD, according to claim 2, characterized by the fact that the separate reading, through the node, of service data that satisfies a predetermined condition of different data processing queues comprises:
    - carry out separately, through the node, the following operations for the different data processing queues:
    determine a level of processing that corresponds to a first row of data processing;
    in response to the determination that the level of processing is
    Petition 870190059925, dated 06/27/2019, p. 73/124
    2/9 a first level of processing, determining a predetermined processing rate of service data with a second level of processing, where the first level of processing is higher than the second level of processing;
    determining a first amount of service data processing with the first level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the first processing amount of the first data processing queue based on the first processing amount.
    [4]
    4. DATA PROCESSING METHOD, according to claim 3, characterized by the fact that the sequential reading of service data that satisfy the first processing amount of the first data processing queue based on the first processing amount comprises:
    in response to the determination that the amount of service data processing stored in the first data processing queue is less than the first amount of processing, sequentially read the service data from the first data processing queue based on the amount of processing service data stored in the first data processing queue.
    [5]
    5. DATA PROCESSING METHOD, according to claim 4, characterized by the fact that the method also comprises:
    determine an amount of service data processing read from a second data processing queue based on the amount of service data processing stored in the first data processing queue and storage capacity
    Petition 870190059925, dated 06/27/2019, p. 74/124
    3/9 of the block; and sequentially reading the service data from the second data processing row based on the determined amount of processing of the service data read from the second data processing row.
    [6]
    6. DATA PROCESSING METHOD, according to claim 3, characterized by the fact that the method also comprises:
    determining the predetermined processing rate of the service data with the second level of processing in response to determining that the level of processing is the second level of processing;
    determining a second amount of processing of the service data with the second level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the second processing amount of the first data processing queue based on the second processing amount.
    [7]
    7. DATA PROCESSING METHOD, according to any one of claims 3 to 6, characterized by the fact that the sequential reading of service data that satisfy the first processing amount of the first data processing queue comprises:
    sequentially read the service data that satisfies the first processing amount of the first data processing queue based on the order of a corresponding processing time of the service data.
    [8]
    8. DATA PROCESSING METHOD, according to
    Petition 870190059925, dated 06/27/2019, p. 75/124
    4/9 with claim 7, characterized by the fact that the storage of the service data read in the block comprises:
    sequentially store the service data read in the block based on the order of the corresponding processing time of the service data.
    [9]
    9. DATA PROCESSING METHOD, according to claim 1, characterized by the fact that the method further comprises:
    create different data processing queues in advance based on service processing levels, where storing service data in a data processing queue that corresponds to the processing level comprises:
    determining the data processing queue that corresponds to the processing level comprised in the service data based on a mapping relationship between a processing level and a data processing queue; and store the service data in the given data processing queue.
    [10]
    10. DATA PROCESSING METHOD, according to claim 2, characterized by the fact that the separate reading, through the node, of service data that satisfies a predetermined condition of different data processing queues comprises:
    - carry out separately, through the node, the following operations for the different data processing queues:
    determining a processing level that corresponds to a first data processing row and obtaining a predetermined processing ratio that corresponds to the processing level;
    Petition 870190059925, dated 06/27/2019, p. 76/124
    5/9 determine a processing amount based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the amount of processing from the first data processing queue.
    [11]
    11. DATA PROCESSING DEVICE based on a trust protocol, characterized by the fact that it comprises:
    an acquisition unit, configured to obtain at least a portion of service data generated in a predetermined period of time, in which the service data comprises a level of processing of a service that generates the service data;
    a storage unit, configured to store service data in a data processing queue that corresponds to the processing level; and a processing unit, configured to read service data separately that satisfy a predetermined condition of different data processing queues when a new block is generated and store the service data read in the block.
    [12]
    12. DATA PROCESSING DEVICE, according to claim 11, characterized by the fact that the predetermined condition is determined based on the storage capacity of the block and a predetermined processing rate of service data with different levels of processing.
    [13]
    13. DATA PROCESSING DEVICE, according to claim 12, characterized by the fact that the separate reading, by the processing unit, of the service data that satisfies a predetermined condition of different processing queues
    Petition 870190059925, dated 06/27/2019, p. 77/124
    6/9 of data comprises:
    - perform the following operations separately for the different data processing queues:
    determine a level of processing that corresponds to a first row of data processing;
    in response to determining that the processing level is a first processing level, determining a predetermined processing rate of service data with a second processing level, where the first processing level is higher than the second processing level;
    determining a first amount of service data processing with the first level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the first processing amount of the first data processing queue based on the first processing amount.
    [14]
    14. DATA PROCESSING DEVICE, according to claim 13, characterized by the fact that the sequential reading, by the processing unit, of the service data that satisfies the first processing quantity of the first data processing queue based on the first amount of processing comprises:
    in response to the determination that the amount of service data processing stored in the first data processing queue is less than the first amount of processing, sequentially read the service data from the first data processing queue based on the amount of processing service data stored in the first data processing queue.
    Petition 870190059925, dated 06/27/2019, p. 78/124
    7/9
    [15]
    15. DATA PROCESSING DEVICE, according to claim 14, characterized by the fact that the data processing device further comprises a determination unit, in which the determination unit is configured for:
    determining a service data processing amount read from a second data processing row based on the processing amount of service data stored in the first data processing row and the storage capacity of the block; and sequentially reading the service data from the second data processing row based on the determined amount of processing of the service data read from the second data processing row.
    [16]
    16. DATA PROCESSING DEVICE, according to claim 13, characterized by the fact that the processing unit is configured for:
    determining the predetermined processing rate of the service data with the second level of processing in response to determining that the level of processing is the second level of processing;
    determining a second amount of processing of the service data with the second level of processing based on the determined processing rate and the storage capacity of the block; and sequentially reading the service data that satisfies the second processing amount of the first data processing queue based on the second processing amount.
    [17]
    17. DATA PROCESSING DEVICE,
    Petition 870190059925, dated 06/27/2019, p. 79/124
    8/9 according to any one of claims 13 to 16, characterized in that the sequential reading, by the processing unit, of the service data that satisfies the first processing amount of the first data processing queue comprises:
    sequentially read the service data that satisfies the first processing amount of the first data processing queue based on the order of a corresponding processing time of the service data.
    [18]
    18. DATA PROCESSING DEVICE, according to claim 17, characterized by the fact that the storage, by the processing unit, of the service data read in the block comprises:
    sequentially store the service data read in the block based on the order of the corresponding processing time of the service data.
    [19]
    19. DATA PROCESSING DEVICE, according to claim 11, characterized by the fact that the data processing device also comprises a creation unit, in which
    - the breeding unit creates different data processing queues in advance based on service processing levels, where
    - where the storage unit stores the service data in a data processing queue that corresponds to the processing level, comprising:
    determining the data processing queue that corresponds to the processing level comprised in the service data based on a mapping relationship between a processing level and a data processing queue; and
    Petition 870190059925, dated 06/27/2019, p. 80/124
    9/9 store the service data in the given data processing queue.
    [20]
    20. DATA PROCESSING DEVICE, according to claim 12, characterized by the fact that the processing unit reads, separately, the service data that satisfy a predetermined condition of different data processing queues, comprising:
    - perform the following operations separately for the different data processing queues:
    determining a processing level that corresponds to a first data processing row and obtaining a predetermined processing ratio that corresponds to the processing level; and determining a processing amount based on the determined processing rate and the storage capacity of the block and sequentially reading the service data that satisfies the processing amount of the first data processing row.
    类似技术:
    公开号 | 公开日 | 专利标题
    BR112019013394A2|2020-03-03|DATA PROCESSING METHOD AND DATA PROCESSING DEVICE
    BR112019013412B1|2022-02-01|Method for processing data based on a reliable protocol, computer-readable medium, and computer-implemented system.
    BR112019014589A2|2020-02-18|SERVICE AND APPLIANCE PROCESSING METHOD
    BR112019013441A2|2019-12-31|data storage method and data storage device
    KR20190118630A|2019-10-18|Method and apparatus for consensus verification
    ES2876943T3|2021-11-15|Blockchain services acceptance and consensus procedure and device
    BR112019013367A2|2019-12-31|consensus verification method and consensus verification device
    TW201901516A|2019-01-01|Data processing method and device based on blockchain
    BR112019014478A2|2020-05-26|METHOD FOR DETERMINING THE DATABASE STATUS AND DEVICE FOR DETERMINING THE DATABASE STATUS
    TW201909009A|2019-03-01|Data processing method and device based on blockchain
    BR112019020374A2|2020-04-28|method, apparatus and system for blockchain consensus
    TWI695260B|2020-06-01|Block data verification method and device
    RU2708952C1|2019-12-12|Method and device for processing a service request
    ES2875849T3|2021-11-11|Service execution method and device
    WO2019201011A1|2019-10-24|System startup method and apparatus, electronic device and storage medium
    BR112019010368B1|2021-12-14|METHOD FOR PROCESSING A SERVICE REQUEST AND DEVICE FOR PROCESSING A SERVICE REQUEST
    TW201931135A|2019-08-01|Method, apparatus, and system for dynamic management of integrity-protected memory
    同族专利:
    公开号 | 公开日
    US20210042272A1|2021-02-11|
    JP6793838B2|2020-12-02|
    US10909085B2|2021-02-02|
    CN107391526A|2017-11-24|
    US10762056B2|2020-09-01|
    RU2728820C1|2020-07-31|
    TWI691855B|2020-04-21|
    CA3048740C|2020-10-13|
    AU2018246770B2|2021-02-18|
    PH12019501505A1|2020-06-08|
    KR102194074B1|2020-12-23|
    CN107391526B|2021-04-02|
    WO2018177250A1|2018-10-04|
    TW201837754A|2018-10-16|
    SG10202100629XA|2021-02-25|
    US20200026691A1|2020-01-23|
    US20200183891A1|2020-06-11|
    CN113282659A|2021-08-20|
    US11036689B2|2021-06-15|
    JP2020510892A|2020-04-09|
    CA3048740A1|2018-10-04|
    KR20190094191A|2019-08-12|
    EP3547168A1|2019-10-02|
    AU2018246770A1|2019-07-18|
    MX2019007810A|2019-09-05|
    EP3547168A4|2019-11-20|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    JPH10327186A|1997-05-26|1998-12-08|Nec Commun Syst Ltd|Priority control variable system|
    PA8502401A1|1999-09-17|2002-02-21|Nagracard Sa|PROCEDURE AND TRANSMISSION SYSTEM OF A MESSAGE CHAIN FOR DATA BANK.|
    CN101267288A|2002-05-10|2008-09-17|美商内数位科技公司|System and method for prioritization of retransmission of protocol data units to assist radio-link-control retransmission|
    KR100889056B1|2008-07-03|2009-03-17|주식회사 유비콘테크놀로지|Aes ccm arithmetic apparatus of wireless usb system|
    US8767758B2|2009-11-03|2014-07-01|Intel Corporation|Apparatus, system and method of prioritizing a management frame of a wireless network|
    TWI459223B|2012-08-15|2014-11-01|Hon Hai Prec Ind Co Ltd|System and method for creating indexes of massive data|
    CN102970202B|2012-11-26|2015-02-18|北京空间飞行器总体设计部|1553B bus communication method based on preemptive strategy|
    JP6252112B2|2013-11-06|2017-12-27|富士通株式会社|Packet processing apparatus, packet processing method, and packet processing system|
    CN105960637B|2013-11-28|2020-09-11|英特尔公司|Block-based indexing techniques|
    US10409827B2|2014-10-31|2019-09-10|21, Inc.|Digital currency mining circuitry having shared processing logic|
    US9436923B1|2015-02-26|2016-09-06|Skuchain, Inc.|Tracking unitization occurring in a supply chain|
    JP2018516026A|2015-03-20|2018-06-14|リヴェッツ・コーポレーションＲｉｖｅｔｚ Ｃｏｒｐ．|Automatic device integrity authentication using blockchain|
    CN106156038B|2015-03-26|2019-11-29|腾讯科技（深圳）有限公司|Date storage method and device|
    JP6571375B2|2015-04-24|2019-09-04|国立大学法人 筑波大学|Copyright protection support device|
    CN105007294B|2015-05-26|2018-06-08|华北电力大学（保定）|Power transmission and transformation equipment state monitoring big data quickly receives and dissemination system|
    WO2017021155A1|2015-07-31|2017-02-09|British Telecommunications Public Limited Company|Controlled resource provisioning in distributed computing environments|
    EP3423999A1|2016-03-03|2019-01-09|NEC Laboratories Europe GmbH|Method for managing data in a network of nodes|
    KR101701131B1|2016-04-28|2017-02-13|주식회사 라피|Data recording and validation methods and systems using the connecting of blockchain between different type|
    CN105975868A|2016-04-29|2016-09-28|杭州云象网络技术有限公司|Block chain-based evidence preservation method and apparatus|
    EP3491605A1|2016-08-01|2019-06-05|Cryptowerk Corp.|Computer-implemented method and system of tamper-evident recording of a plurality of service data items|
    CN106446067B|2016-09-06|2020-02-18|联动优势科技有限公司|Method and device for acquiring transaction data|
    CN106411774A|2016-09-06|2017-02-15|联动优势科技有限公司|Method and device for controlling transaction data volume|
    CN106528775B|2016-10-28|2020-01-03|济南大学|Private block chain operation support system supporting logic multi-chain and working method thereof|
    CN107391526B|2017-03-28|2021-04-02|创新先进技术有限公司|Data processing method and device based on block chain|CN111917864A|2017-02-22|2020-11-10|创新先进技术有限公司|Service checking method and device|
    CN107341702B|2017-03-08|2020-06-23|创新先进技术有限公司|Service processing method and device|
    CN107450979B|2017-03-28|2020-06-02|创新先进技术有限公司|Block chain consensus method and device|
    CN107391526B|2017-03-28|2021-04-02|创新先进技术有限公司|Data processing method and device based on block chain|
    CN107391527B|2017-03-28|2020-03-27|创新先进技术有限公司|Data processing method and device based on block chain|
    CN107992356B|2017-12-13|2021-09-14|深圳壹账通智能科技有限公司|Block chain transaction block processing method, electronic device and readable storage medium|
    US11176101B2|2018-02-05|2021-11-16|Bank Of America Corporation|System and method for decentralized regulation and hierarchical control of blockchain architecture|
    CN108712491A|2018-05-17|2018-10-26|易链科技（深圳）有限公司|Block chain node, exchange information processing method, terminal device and medium|
    CN109101835A|2018-08-08|2018-12-28|苏州酷外文化传媒有限公司|The information security management method and device of blind date dating site based on block chain|
    CN109191135A|2018-08-27|2019-01-11|北京京东金融科技控股有限公司|Transaction based on block chain retries method, apparatus, equipment and readable storage medium storing program for executing|
    WO2020061822A1|2018-09-26|2020-04-02|Beijing Didi Infinity Technology And Development Co., Ltd.|Method and system for arbitrating authenticity of data in a blockchain|
    CN110012050A|2018-12-04|2019-07-12|阿里巴巴集团控股有限公司|Message Processing, storage method, apparatus and system|
    法律状态:
    2021-04-06| B25A| Requested transfer of rights approved|Owner name: ADVANTAGEOUS NEW TECHNOLOGIES CO., LTD. (KY) |
    2021-04-27| B25A| Requested transfer of rights approved|Owner name: ADVANCED NEW TECHNOLOGIES CO., LTD. (KY) |
    2021-10-13| B350| Update of information on the portal [chapter 15.35 patent gazette]|
    2021-10-26| B15K| Others concerning applications: alteration of classification|Free format text: A CLASSIFICACAO ANTERIOR ERA: G06F 17/30 Ipc: G06F 16/182 (2019.01), G06F 9/48 (2006.01), H04L 9 |
    2021-10-26| B06A| Patent application procedure suspended [chapter 6.1 patent gazette]|
    2022-02-08| B09A| Decision: intention to grant [chapter 9.1 patent gazette]|
    优先权:
    申请号 | 申请日 | 专利标题
    CN201710190740.X|2017-03-28|
    CN201710190740.XA|CN107391526B|2017-03-28|2017-03-28|Data processing method and device based on block chain|
    PCT/CN2018/080501|WO2018177250A1|2017-03-28|2018-03-26|Block chain based data processing method and device|
    [返回顶部]