CN108985758B - Data processing method, data processing system and terminal equipment - Google Patents
Data processing method, data processing system and terminal equipment Download PDFInfo
- Publication number
- CN108985758B CN108985758B CN201810577924.6A CN201810577924A CN108985758B CN 108985758 B CN108985758 B CN 108985758B CN 201810577924 A CN201810577924 A CN 201810577924A CN 108985758 B CN108985758 B CN 108985758B
- Authority
- CN
- China
- Prior art keywords
- task
- data
- executed
- data obtained
- node
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
- G06Q20/102—Bill distribution or payments
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application is applicable to the technical field of data processing, and provides a data processing method, a data processing system and terminal equipment, wherein the method comprises the following steps: after the preset interval time is reached, generating at least two tokens through different nodes, wherein one token is generated by one node; executing a corresponding task by at least one token generated by the different node, wherein one token corresponds to one task, and the task comprises at least one of the following: data collection, data summarization, data verification, data execution, data review, data storage, and compensation. The method can avoid the waste of calculation power.
Description
Technical Field
The present application belongs to the field of data processing technology, and in particular, to a data processing method, a data processing system, and a terminal device.
Background
The block chain technology is characterized in that encrypted data are stored on distributed nodes in a linked list mode, decentralized storage is achieved, distributed storage is achieved on the basis of a consensus mechanism, involved nodes are equal, a complete transaction record is reserved, tampering and tracing are not achieved, unconditional trust is achieved through the encryption technology, transaction cost can be reduced, and transaction speed is improved.
However, the conventional block chain technology based on Proof of Work (POW) consensus has the problems of slow data processing speed and high power consumption. For example, 1, a blockchain for bitcoin, generates one block every 10 minutes, each block is 1MB in size, the minimum transaction record is 225 bytes, approximately 4444 transactions can be recorded, an average of 7.4 transactions per second, and a transaction is determined after 6 blocks. 2. The blockchain for the ether house generates one block every 12 seconds, averaging about 20 transactions per second. 3. The block chain of the bit currency and the block chain of the ether house both adopt a POW (point of sale) consensus mechanism, namely all nodes solve the same mathematical problem, namely calculate a hash value, and solve out who obtains the accounting right and obtain a certain currency as a reward, which is also called mining. The mechanism enables each node to increase the computing power as much as possible to obtain the reward, the total computing power of the bitcoin reaches 6.41E, namely 6410P, and the computing power of the Tianheu No. two reaches 54.9P, which only accounts for about 0.85 percent. By 11/20/2017, the annual current power consumption of bitcoin is estimated to be 29.05 trillion watt-hours, which is equivalent to 0.13% of the total global power consumption. This means that the power consumption for the exploitation of bitcoin is now greater than the power used in each of 159 countries. More than in Ireland and Nigeria.
Therefore, a new technical solution is needed to solve the above technical problems.
Disclosure of Invention
In view of this, embodiments of the present application provide a data processing method, a data processing system, and a terminal device, so as to solve the problem in the prior art that different nodes all process the same task, thereby causing a waste of computing power.
A first aspect of an embodiment of the present application provides a data processing method, including:
after the preset interval time is reached, generating at least two tokens through different nodes, wherein one token is generated by one node;
executing a corresponding task by at least one token generated by the different node, wherein one token corresponds to one task, and the task comprises at least one of the following: data collection, data summarization, data verification, data execution, data review, data storage, and compensation.
A second aspect of an embodiment of the present application provides a data processing system, including:
the token generation unit is used for generating at least two tokens through different nodes after a preset interval time arrives, wherein one node generates one token;
a task execution unit, configured to execute a corresponding task through at least one token generated by the different node, where one token corresponds to one task, and the task includes at least one of: data collection, data summarization, data verification, data execution, data review, data storage, and compensation.
A third aspect of the embodiments of the present application provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the data processing method when executing the computer program.
A fourth aspect of embodiments of the present application provides a computer-readable storage medium, which stores a computer program that, when executed by a processor, implements the steps of the data processing method as described.
Compared with the prior art, the embodiment of the application has the advantages that:
the task of the embodiment of the application comprises at least one of the following steps: the method comprises the steps of data collection, data summarization, data verification, data execution, data review, data storage and compensation, and different nodes generate at least two tokens after a preset interval time arrives, so that different nodes execute at least two different tasks according to the at least two tokens at the same time point, and the same task of all nodes at the same time point is avoided, thereby avoiding the waste of computing power, greatly realizing the optimization of resources and improving the utilization rate of the resources.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a flowchart of a data processing method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of generating different tokens at different times according to an embodiment of the present application;
fig. 3 is a flowchart of another data processing method provided in the second embodiment of the present application;
fig. 4 is a schematic relationship diagram of a first block header and a second block header provided in the second embodiment of the present application;
fig. 5 is a schematic structural diagram of a data processing system according to a third embodiment of the present application;
fig. 6 is a schematic diagram of a terminal device according to a fourth embodiment of the present application.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
In order to explain the technical solution described in the present application, the following description will be given by way of specific examples.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the present application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of the present application 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 further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to a determination" or "in response to a detection". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".
In particular implementations, the mobile terminals described in embodiments of the present application include, but are not limited to, other portable devices such as mobile phones, laptop computers, or tablet computers having touch sensitive surfaces (e.g., touch screen displays and/or touch pads). It should also be understood that in some embodiments, the devices described above are not portable communication devices, but rather are desktop computers having touch-sensitive surfaces (e.g., touch screen displays and/or touch pads).
In the discussion that follows, a mobile terminal that includes a display and a touch-sensitive surface is described. However, it should be understood that the mobile terminal may include one or more other physical user interface devices such as a physical keyboard, mouse, and/or joystick.
The mobile terminal supports various applications, such as one or more of the following: a drawing application, a presentation application, a word processing application, a website creation application, a disc burning application, a spreadsheet application, a gaming application, a telephone application, a video conferencing application, an email application, an instant messaging application, an exercise support application, a photo management application, a digital camera application, a web browsing application, a digital music player application, and/or a digital video player application.
Various applications that may be executed on the mobile terminal may use at least one common physical user interface device, such as a touch-sensitive surface. One or more functions of the touch-sensitive surface and corresponding information displayed on the terminal can be adjusted and/or changed between applications and/or within respective applications. In this way, a common physical architecture (e.g., touch-sensitive surface) of the terminal can support various applications with user interfaces that are intuitive and transparent to the user.
In addition, in the description of the present application, the terms "first," "second," "third," and the like are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.
The first embodiment is as follows:
fig. 1 shows a flowchart of a data processing method according to an embodiment of the present application, which is detailed as follows:
step S11, after the preset interval time is reached, at least two tokens are generated by different nodes, wherein one token is generated by one node.
The node of this embodiment accesses the same network, where the node includes a large server, a Personal Computer (PC), a mobile phone, and the like, and tokens generated by the same node at different times may be the same or different; for example, when there are node a, node B, and node C, at the same time, node a generates token X, node B generates token X, and node C generates token Y, at the same time, the tokens generated by node a and node B are the same, and the tokens generated by node C are different.
Optionally, in order to ensure that when a new token is generated, the task corresponding to the previous token is executed completely, the preset interval time should be greater than or equal to the time required for completing the execution of any task.
Step S12, executing a corresponding task through at least one token generated by the different node, where one token corresponds to one task, and the task includes at least one of: data collection, data summarization, data verification, data execution, data review, data storage, and compensation.
In this embodiment, one token corresponds to one task, for example, there is one token corresponding to one task of "data collection", there is one token corresponding to one task of "data summarization", and the like. Optionally, when the types of the data to be processed are multiple, the task is subdivided into sub-tasks corresponding to the types of the data to be processed, and taking the task of "data collection" as an example, the task of "data collection" is subdivided into multiple types of tasks of "data collection": assume that the types of data to be processed include: transaction data, contract data, merchant data, sensory data, document data, audio data, video data, and the like. The task of "data collection" will be subdivided into a task of "transaction data collection," a task of "contract data collection," a task of "commercial data collection," a task of "sensing data collection," a task of "document data collection," a task of "audio data collection," and a task of "video data collection," and similarly, other tasks that are not "data collection" are similar to these tasks, and will not be described herein again.
Referring to fig. 2, assume that the task broad of the present embodiment includes data collection, data summarization, data validation, data execution, data review, data storage, and compensation. T1, T2, T3, T4, T5, T6, and T7 indicate corresponding times after the preset interval time is reached. 11-17, 21-27, etc. correspond to token numbers (or task subclasses), e.g., assume that 11 corresponds to a task subclass of "transaction data Collection" and 21 corresponds to a task subclass of "contract data Collection"; correspondingly, 12 corresponds to a task subclass of 'transaction data summarization', and 22 corresponds to a task subclass of 'contract data summarization'; and the rest can be analogized in sequence, and the description is omitted here.
Time T1 is an arbitrary observation time, and all the work of one type of data processing is done in 7 steps, each step generating a random token for each node, as calculated by this time point, see fig. 2, for example:
at the time T1, if the node N generates the 11-number token, transaction data collection is executed;
at time T2, if node N generates token No. 23, contract data verification is executed;
by analogy, each node executes different tasks at different times, and similarly, the workflow of the node L is the same as that of the node N.
By randomly generating tokens by nodes of the whole network, when different nodes generate the same token at the same time, the different nodes are divided into the same group, the group of nodes process the same task, the groups of nodes divide work to complete all processing work of one kind of data (such as the steps of collecting, summarizing, verifying, executing, rechecking, storing, rewarding and the like of transaction data), and other kinds of data are also distributed to the nodes for processing, which is equivalent to realizing the processing of all tasks (including transaction, contract, purchasing, sensing, document, audio, video data and the like) in a T (such as 1 second time) period, is similar to grid computing, has super-strong data processing capability, and can save a large amount of energy at the same time, because each node does meaningful work.
In the embodiment of the application, after the preset interval time is reached, at least two tokens are generated through different nodes, and corresponding tasks are executed through at least one token generated by the different nodes. The task of the embodiment of the application comprises at least one of the following steps: the method comprises the steps of data collection, data summarization, data verification, data execution, data review, data storage and compensation, and different nodes generate at least two tokens after a preset interval time arrives, so that different nodes execute at least two different tasks according to the at least two tokens at the same time point, and the same task of all nodes at the same time point is avoided, thereby avoiding the waste of computing power, greatly realizing the optimization of resources and improving the utilization rate of the resources.
Example two:
fig. 3 is a flowchart illustrating another data processing method provided in embodiment two of the present application, and in this embodiment, step S31 and step S32 are the same as step S11 and step S12 of embodiment one, and are not repeated here.
Step S31, after the preset interval time is reached, at least two tokens are generated by different nodes, wherein one token is generated by one node.
Step S32, executing a corresponding task through at least one token generated by the different node, where one token corresponds to one task, and the task includes at least one of: data collection, data summarization, data verification, data execution, data review, data storage, and compensation.
Optionally, in order to implement fair allocation of resources, if the probabilities of generating different types of tokens by each node are made as equal as possible, the token is generated according to a mapping relationship of random numbers, where the step S32 includes:
and A1, after the preset interval time arrives, generating at least two different random numbers by different nodes.
Specifically, after the preset interval time arrives, each node generates a random number according to a random function, and at least 2 different random numbers exist in the generated random numbers. The random functions for generating random numbers by different nodes can be the same or different.
And A2, generating a corresponding token according to the at least two different random numbers and a preset mapping table.
Specifically, the preset mapping table stores a correspondence between random numbers and tokens, and it should be noted that, in the preset mapping table, 1 random number corresponds to one token, or multiple random numbers correspond to the same token, which is not limited herein.
And step S33, storing data obtained after the execution of the specified task into a specified address, wherein the specified task is determined according to the task.
In this embodiment, after the designated task is executed, the data obtained after the designated task is executed is stored, for example, if the designated task is "data storage" in the above-mentioned task, the data obtained after the "data storage" task is executed is stored.
In this embodiment, the designated address includes a designated node, specifically, data obtained after the designated task is executed is stored in the designated node, and the designated node may be a fixed node, for example, a large server is used as the designated node, and correspondingly, the data obtained after the designated task is executed is stored in the large server; the designated node may be a dynamic node, for example, a node closest to a node that executes the designated task is set as the designated node, and data obtained by executing the designated task is stored in the node closest to the node that executes the designated task.
Optionally, the storing, in a designated address, data obtained after the designated task is executed includes:
and storing the data obtained after the execution of the specified task into the specified address in a distributed manner and synchronizing.
Specifically, after a node stores data obtained after an assigned task is executed in an assigned address, the data obtained after the assigned task is executed is stored in other nodes, and in the storage process, time synchronization needs to be performed on the data obtained after the assigned task stored in each node is executed, so as to ensure the uniformity of the stored data.
And step S34, determining the hash value of the data obtained after the specified task is executed according to the data obtained after the specified task is executed and the corresponding storage address.
In this embodiment, assuming that data obtained after the designated task is executed is data a, the hash value of the data a is determined according to the data a and the storage address of the data a. Optionally, in order to reduce the probability that different data will obtain the same hash value, the hash value of the present embodiment is a 256-bit hash value.
And step S35, storing the hash value of the data obtained after the specified task is executed into the zone block.
In this embodiment, since the data obtained after the execution of the specified task is stored in the hash value of the specified address only in the block body, rather than directly storing the specific data obtained after the execution of the specified task, the hash value is much smaller than the specific data, which is usually 1KB, the size of the block body can be effectively reduced.
Optionally, after the step S35, the method further includes:
and generating a first block header, wherein the first block header comprises a pointer pointing to a second block header and state information of a node, the second block header is a block header corresponding to a block body storing a hash value of data obtained after the execution of the specified task, the second block header comprises a pointer pointing to the first block header, and the node is the second block header and the node corresponding to the block body corresponding to the second block header.
In this embodiment, the first chunk header may include, in addition to the pointer pointing to the second chunk header and the state information of the node, version information, a hash value of a previous chunk header (i.e., a hash value of a previous chunk header corresponding to the first chunk header), a hash value of a current chunk header (i.e., the first chunk header), a hash value of the second chunk header, and the like. The state information of the node refers to pending contract information of the block chain where the second block header is located, for example, when the type of the data to be processed includes contract data and the contract is not finished at the current time, the state information of the node will include the corresponding pending contract information. Of course, if the contract execution of the status information of the node included in the first block header is completed, the first block header is deleted. The relationship among the block bodies corresponding to the first block head, the second block head and the second block head can be as shown in fig. 4. In fig. 4, the block headers on the auxiliary chain are different first block headers, and the block headers on the main chain are different second block headers. It should be noted that the block body in fig. 4 stores hash values corresponding to contract data, transaction data, purchase data, sensing data, document data, audio data, and video data, and in an actual situation, the block body stores the corresponding hash values according to the type of the data to be processed, which is not described herein again.
Since the state information of the node is added to the first block head, it is possible to quickly find which contracts are not completed through the block chain where the first block head is located, and if the information of the incomplete contracts needs to be further checked, it is possible to find the second block head through the pointer pointing to the second block head included in the first block head, and then check the snapshot information (hash value of data obtained after the designated task is executed) of the block body corresponding to the second block head, and further, it is possible to find the stored data obtained after the designated task is executed according to the snapshot information of the block body.
In this embodiment, the second chunk header may include, in addition to the pointer pointing to the first chunk header, version information, a hash value of a previous chunk header, a hash value of a current chunk header (i.e., the second chunk header), a hash value of a chunk, and the like.
Optionally, in order to expand the range of data obtained after the task is executed, after the step S32, the method includes:
and broadcasting the data obtained after the task is executed in the whole network.
In this embodiment, data obtained after the execution of the network broadcast task in which the different node is located, for example, data obtained after the execution of "data collection" is broadcast after the execution of "data collection".
Optionally, in order to be able to broadcast different types of data quickly, the data obtained after the network-wide broadcast task is executed includes:
and selecting a corresponding port to broadcast the data obtained after the task is executed in the whole network according to the type of the data obtained after the task is executed.
In this embodiment, when the types of the data to be processed are different, the types of the data obtained after the task is executed are also different, and at this time, the corresponding port is selected according to the type of the data to broadcast the data obtained after the task is executed. For example, data obtained after the transaction data collection task is executed can be broadcast in the whole network through a port A, data obtained after the contract data collection task is executed can be broadcast in the whole network through a port B, and different types of data are broadcast in the whole network through different ports, so that the speed of the whole network broadcasting can be effectively improved.
Example three:
referring to the first embodiment and the second embodiment, fig. 5 shows a schematic structural diagram of a data processing system provided in the third embodiment of the present application, and for convenience of description, only the parts related to the present embodiment are shown:
the data processing system comprises a token generation unit 51 and a task execution unit 52. Wherein:
a token generating unit 51, configured to generate at least two tokens through different nodes after a preset interval time arrives, where one token is generated by one node;
the nodes of the embodiment are accessed to the same network, wherein the nodes comprise a large-scale server, a PC, a mobile phone and the like, and tokens generated by the same node at different times may be the same or different; the tokens generated by different nodes at the same time may or may not be the same.
Optionally, in order to ensure that when a new token is generated, the task corresponding to the previous token is executed completely, the preset interval time should be greater than or equal to the time required for completing the execution of any task.
A task execution unit 52, configured to execute a corresponding task through at least one token generated by the different node, where one token corresponds to one task, and the task includes at least one of: data collection, data summarization, data verification, data execution, data review, data storage, and compensation.
Optionally, when there are multiple types of data to be processed, the task is subdivided into subtasks corresponding to the types of the data to be processed.
The task of the embodiment of the application comprises at least one of the following steps: the method comprises the steps of data collection, data summarization, data verification, data execution, data review, data storage and compensation, and different nodes generate at least two tokens after a preset interval time arrives, so that different nodes execute at least two different tasks according to the at least two tokens at the same time point, and the same task of all nodes at the same time point is avoided, thereby avoiding the waste of computing power, greatly realizing the optimization of resources and improving the utilization rate of the resources.
Optionally, the data processing system further comprises:
the storage unit is used for storing data obtained after a specified task is executed into a specified address, and the specified task is determined according to the task;
wherein, the designated address comprises a designated node, and the designated node can be a fixed node, such as a large server as a designated node; the designated node may also be a dynamic node, for example, the node closest to the node performing the designated task is designated as the designated node.
The hash value determining unit is used for determining the hash value of the data obtained after the specified task is executed according to the data obtained after the specified task is executed and the corresponding storage address;
and the block content determining unit is used for storing the hash value of the data obtained after the specified task is executed into the block.
Optionally, the block content determining unit is specifically configured to store data obtained after the specified task is executed in a distributed manner in the specified address and synchronize the data.
Optionally, the data processing system further comprises:
the first block head generation unit is configured to generate a first block head, where the first block head includes a pointer pointing to a second block head and state information of a node, the second block head is a block head corresponding to a block body in which a hash value of data obtained after the execution of the specified task is stored, the second block head includes a pointer pointing to the first block head, and the node is the second block head and the node corresponding to the block body corresponding to the second block head.
In this embodiment, the first chunk header may include, in addition to the pointer pointing to the second chunk header and the state information of the node, version information, a hash value of a previous chunk header (i.e., a hash value of a previous chunk header corresponding to the first chunk header), a hash value of a current chunk header (i.e., the first chunk header), a hash value of the second chunk header, and the like. The state information of the node refers to pending contract information of the block chain where the second block header is located. Of course, if the contract execution of the status information of the node included in the first block header is completed, the first block header is deleted.
In this embodiment, the second chunk header may include, in addition to the pointer pointing to the first chunk header, version information, a hash value of a previous chunk header, a hash value of a current chunk header (i.e., the second chunk header), a hash value of a chunk, and the like.
Optionally, the data processing system further comprises:
and the whole network broadcasting unit is used for broadcasting data obtained after the task is executed in the whole network.
Optionally, the network-wide broadcasting unit is specifically configured to select a corresponding port to broadcast the data obtained after the task is executed over the network according to the type of the data obtained after the task is executed.
Optionally, the token generating unit 51 includes:
the random number generation module is used for generating at least two different random numbers through different nodes after the preset interval time is reached;
specifically, after the preset interval time arrives, each node generates a random number according to a random function, and at least 2 different random numbers exist in the generated random numbers. The random functions for generating random numbers by different nodes can be the same or different.
And the token determining module is used for generating a corresponding token according to the at least two different random numbers and a preset mapping table.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Example four:
fig. 6 is a schematic diagram of a terminal device according to an embodiment of the present application. As shown in fig. 6, the terminal device 6 of this embodiment includes: a processor 60, a memory 61 and a computer program 62 stored in said memory 61 and executable on said processor 60. The processor 60, when executing the computer program 62, implements the steps in the various data processing method embodiments described above, such as the steps S11-S12 shown in fig. 1. Alternatively, the processor 60, when executing the computer program 62, implements the functions of the modules/units in the system embodiments, such as the functions of the modules 51 to 52 shown in fig. 5.
Illustratively, the computer program 62 may be partitioned into one or more modules/units that are stored in the memory 61 and executed by the processor 60 to accomplish the present application. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution of the computer program 62 in the terminal device 6. For example, the computer program 62 may be divided into a token generation unit and a task execution unit, and the specific functions of each unit are as follows:
the token generation unit is used for generating at least two tokens through different nodes after a preset interval time arrives, wherein one node generates one token;
a task execution unit, configured to execute a corresponding task through at least one token generated by the different node, where one token corresponds to one task, and the task includes at least one of: data collection, data summarization, data verification, data execution, data review, data storage, and compensation.
The terminal device 6 may be a desktop computer, a notebook, a palm computer, a cloud server, or other computing devices. The terminal device may include, but is not limited to, a processor 60, a memory 61. Those skilled in the art will appreciate that fig. 6 is merely an example of a terminal device 6 and does not constitute a limitation of terminal device 6 and may include more or less components than those shown, or some components in combination, or different components, for example, the terminal device may also include input output devices, network access devices, buses, etc.
The Processor 60 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 61 may be an internal storage unit of the terminal device 6, such as a hard disk or a memory of the terminal device 6. The memory 61 may also be an external storage device of the terminal device 6, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the terminal device 6. Further, the memory 61 may also include both an internal storage unit and an external storage device of the terminal device 6. The memory 61 is used for storing the computer program and other programs and data required by the terminal device. The memory 61 may also be used to temporarily store data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other ways. For example, the above-described embodiments of the apparatus/terminal device are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, 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, functional units in the embodiments of the present application 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, and can also be realized in a form of a software functional unit.
The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow in the method of the embodiments described above can be realized by a computer program, which can be stored in a computer-readable storage medium and can realize the steps of the embodiments of the methods described above when the computer program is executed by a processor. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.
Claims (9)
1. A data processing method, comprising:
after the preset interval time is reached, generating at least two different tokens through different nodes, wherein one token is generated by one node;
executing corresponding tasks by at least two different tokens generated by the different nodes, wherein one token corresponds to one task, and the tasks include at least one of: data collection, data summarization, data verification, data execution, data review, data storage and compensation;
storing data obtained after an appointed task is executed into an appointed address, wherein the appointed task is determined according to the task;
determining a hash value of the data obtained after the designated task is executed according to the data obtained after the designated task is executed and a corresponding storage address;
and storing the hash value of the data obtained after the specified task is executed into the block body.
2. The data processing method of claim 1, wherein storing data obtained after execution of the specified task into the specified address comprises:
and storing the data obtained after the execution of the specified task into the specified address in a distributed manner and synchronizing.
3. The data processing method according to claim 1, wherein after storing the hash value of the data obtained after the execution of the specified task into a block, the method further comprises:
and generating a first block header, wherein the first block header comprises a pointer pointing to a second block header and state information of a node, the second block header is a block header corresponding to a block body storing a hash value of data obtained after the execution of the specified task, the second block header comprises a pointer pointing to the first block header, and the node is the second block header and the node corresponding to the block body corresponding to the second block header.
4. The data processing method of claim 1, wherein after the performing of the corresponding tasks by the at least two different tokens generated by the different nodes, comprising:
and broadcasting the data obtained after the task is executed in the whole network.
5. The data processing method of claim 4, wherein the data obtained after the full-network broadcast task is executed comprises:
and selecting a corresponding port to broadcast the data obtained after the task is executed in the whole network according to the type of the data obtained after the task is executed.
6. The data processing method of any one of claims 1 to 5, wherein generating at least two different tokens by different nodes after a preset interval time has arrived comprises:
after the preset interval time is reached, generating at least two different random numbers through different nodes;
and generating at least two corresponding different tokens according to the at least two different random numbers and a preset mapping table.
7. A data processing system, comprising:
the token generation unit is used for generating at least two different tokens through different nodes after a preset interval time arrives, wherein one node generates one token;
a task execution unit, configured to execute a corresponding task through at least two different tokens generated by the different nodes, where one token corresponds to one task, and the task includes at least one of: data collection, data summarization, data verification, data execution, data review, data storage and compensation;
the storage unit is used for storing data obtained after a specified task is executed into a specified address, and the specified task is determined according to the task;
the hash value determining unit is used for determining the hash value of the data obtained after the specified task is executed according to the data obtained after the specified task is executed and the corresponding storage address;
and the block content determining unit is used for storing the hash value of the data obtained after the specified task is executed into the block.
8. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any of claims 1 to 6 when executing the computer program.
9. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810577924.6A CN108985758B (en) | 2018-06-07 | 2018-06-07 | Data processing method, data processing system and terminal equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810577924.6A CN108985758B (en) | 2018-06-07 | 2018-06-07 | Data processing method, data processing system and terminal equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108985758A CN108985758A (en) | 2018-12-11 |
| CN108985758B true CN108985758B (en) | 2020-10-30 |
Family
ID=64540912
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810577924.6A Active CN108985758B (en) | 2018-06-07 | 2018-06-07 | Data processing method, data processing system and terminal equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108985758B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11227282B2 (en) * | 2018-08-20 | 2022-01-18 | Probloch LLC | Time-bounded activity chains with multiple authenticated agent participation bound by distributed single-source-of-truth networks that can enforce automated value transfer |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017136956A1 (en) * | 2016-02-12 | 2017-08-17 | Royal Bank Of Canada | Methods and systems for digital reward processing |
| CN107360206A (en) * | 2017-03-29 | 2017-11-17 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method, equipment and system |
| US20170344987A1 (en) * | 2016-05-24 | 2017-11-30 | Mastercard International Incorporated | Method and system for an efficient consensus mechanism for permssioned blockchains using bloom filters and audit guarantees |
| CN107450981A (en) * | 2017-05-31 | 2017-12-08 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method and apparatus |
| CN107729471A (en) * | 2017-10-13 | 2018-02-23 | 上海策赢网络科技有限公司 | A kind of block chain and its generation method and equipment |
-
2018
- 2018-06-07 CN CN201810577924.6A patent/CN108985758B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017136956A1 (en) * | 2016-02-12 | 2017-08-17 | Royal Bank Of Canada | Methods and systems for digital reward processing |
| US20170344987A1 (en) * | 2016-05-24 | 2017-11-30 | Mastercard International Incorporated | Method and system for an efficient consensus mechanism for permssioned blockchains using bloom filters and audit guarantees |
| CN107360206A (en) * | 2017-03-29 | 2017-11-17 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method, equipment and system |
| CN107450981A (en) * | 2017-05-31 | 2017-12-08 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method and apparatus |
| CN107729471A (en) * | 2017-10-13 | 2018-02-23 | 上海策赢网络科技有限公司 | A kind of block chain and its generation method and equipment |
Non-Patent Citations (1)
| Title |
|---|
| 基于动态授权的拜占庭容错共识算法的区块链性能改进研究;刘肖飞;《中国优秀硕士学位论文全文数据库信息科技辑》;20180115(第1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108985758A (en) | 2018-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110225104B (en) | Data acquisition method and device and terminal equipment | |
| CN108038112B (en) | File processing method, mobile terminal and computer readable storage medium | |
| CN108400868B (en) | Seed key storage method and device and mobile terminal | |
| TW202008235A (en) | Transaction method and system based on centralized settlement and block chain storage | |
| CN107451244B (en) | Folder naming method, mobile terminal and computer readable storage medium | |
| TW202004597A (en) | Virtual resource delivery and crowdfunding method and device based on block chain | |
| US9967273B2 (en) | Abusive traffic detection | |
| CN111427971B (en) | Business modeling method, device, system and medium for computer system | |
| CN110244963B (en) | Data updating method and device and terminal equipment | |
| CN110489994B (en) | File authority management method and device for nuclear power station and terminal equipment | |
| CN107506494B (en) | Document handling method, mobile terminal and computer readable storage medium | |
| CN107317928B (en) | Information processing method, mobile terminal and computer readable storage medium | |
| CN108289028A (en) | A kind of signature authentication method, relevant device and computer readable storage medium | |
| CN108985758B (en) | Data processing method, data processing system and terminal equipment | |
| CN112667638B (en) | Dynamic report generation method and device, terminal equipment and readable storage medium | |
| CN107783932B (en) | Information processing method of calculator, mobile terminal and computer readable storage medium | |
| CN107679222B (en) | Picture processing method, mobile terminal and computer readable storage medium | |
| CN115456612B (en) | Accounting method, system, terminal and storage medium for balance base table | |
| CN108521460B (en) | Information pushing method and device, mobile terminal and computer readable storage medium | |
| CN107301236A (en) | Application searches method, mobile terminal, server and computer-readable recording medium | |
| CN109324843B (en) | Fingerprint processing system and method and fingerprint equipment | |
| CN109104481B (en) | File integrity detection method, file integrity detection device and terminal equipment | |
| CN107609119B (en) | File processing method, mobile terminal and computer readable storage medium | |
| CN109359970B (en) | Smart card management method and device and terminal equipment | |
| CN108595569B (en) | File path copying method, file path copying device and mobile terminal |
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 |