CN108985758A - Data processing method, data processing system and terminal device - Google Patents
Data processing method, data processing system and terminal device Download PDFInfo
- Publication number
- CN108985758A CN108985758A CN201810577924.6A CN201810577924A CN108985758A CN 108985758 A CN108985758 A CN 108985758A CN 201810577924 A CN201810577924 A CN 201810577924A CN 108985758 A CN108985758 A CN 108985758A
- Authority
- CN
- China
- Prior art keywords
- data
- task
- token
- node
- block head
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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 suitable for technical field of data processing, provide data processing method, data processing system and terminal device, which comprises after preset interval time reaches, generate at least two tokens by different nodes, wherein, a node generates a token；Corresponding task is executed by least one token that the different nodes generate, wherein, one token is corresponding with a task, and the task comprises at least one of the following: data collection, data summarization, data verification, data execute, data review, data storage, calculate payment.It can be avoided the waste for calculating power by the above method.
Description
Technical field
The application belongs to technical field of data processing more particularly to data processing method, data processing system and terminal are set
It is standby.
Background technique
Block chain technology is to be stored in the data of encryption on distributed node in the form of chained list, its biggest characteristic is that going
Centralization realizes that distributed storage, the node equity of participation retain complete transaction record, can not distort based on common recognition mechanism,
It is traceable, unconditional trust is realized by encryption technology, transaction cost can be reduced, improve transactions velocity.
However, it is existing based on work prove (Proof of Work, POW) common recognition block chain technology there are at data
Manage the speed problem high compared with slow, power consumption.For example, 1, for the block chain of bit coin, one block of generation in every 10 minutes, Mei Gequ
The size of block is 1MB, and the smallest transaction record is 225 bytes, can about note down 4444 transaction, average 7.4 transaction per second,
And it just can determine that transaction after 6 blocks.2, the block chain for ether mill, one block of generation in every 12 seconds are average every
About 20 transaction of second.3, the block chain of bit coin and the block chain in ether mill all use POW common recognition mechanism, that is, all sections
As soon as point solution mathematical problem with along with -- a cryptographic Hash is calculated, who first solves and obtain book keeping operation power whom, while obtaining certain coin as prize
It encourages, this also referred to as " digs mine ".This mechanism make each node improve as much as possible calculate power to be rewarded, present bit coin
The whole network calculates power and reaches 6.41E, that is, 6410P, and the Milky Way two calculation power ability 54.9P, only accounts for 0.85% or so.By
On November 20th, 2017, the current year power consumption of estimation bit coin was 29.05 TW terawatt hours, was equivalent to global total electricity consumption
0.13%.This means that the power consumption of exploitation bit coin is all more than the electric power that 159 countries respectively use now.Than Ireland and
The power consumption of Nigeria is more.
Therefore, it is necessary to propose a kind of new technical solution, to solve the above technical problems.
Summary of the invention
In view of this, the embodiment of the present application provides data processing method, data processing system and terminal device, to solve
Different nodes all handle same task in the prior art, the problem of so as to cause the waste for calculating power.
The first aspect of the embodiment of the present application provides a kind of data processing method, comprising:
After preset interval time reaches, at least two tokens are generated by different nodes, wherein a node generates
One token；
Corresponding task is executed by least one token that the different nodes generate, wherein a token and one
Task is corresponding, and the task comprises at least one of the following: data collection, data summarization, data verification, data execution, data are multiple
Core, is calculated payment at data storage.
The second aspect of the embodiment of the present application provides a kind of data processing system, comprising:
Token generation unit, for generating at least two tokens by different nodes after preset interval time reaches,
Wherein, a node generates a token；
Task executing units, at least one token for being generated by the different nodes execute corresponding task,
In, a token is corresponding with a task, and the task comprises at least one of the following: data collection, data summarization, data are tested
Card, data execute, data review, data storage, calculate payment.
The third aspect of the embodiment of the present application provides a kind of terminal device, including memory, processor and is stored in
In the memory and the computer program that can run on the processor, when the processor executes the computer program
It realizes such as the step of the data processing method.
The fourth aspect of the embodiment of the present application provides a kind of computer readable storage medium, the computer-readable storage
Media storage has computer program, and the step such as the data processing method is realized when the computer program is executed by processor
Suddenly.
Existing beneficial effect is the embodiment of the present application compared with prior art:
Since the task of the embodiment of the present application comprises at least one of the following: data collection, data summarization, data verification, number
It according to execution, data review, data storage, calculates payment, and after preset interval time reaches, different nodes generate at least two and enable
Board, therefore, in point at the same time, different nodes will execute at least two different tasks according at least two tokens, keep away
Exempt from all nodes and be carried out identical task in point at the same time, so as to avoid the waste for calculating power, greatly realizes money
The optimization in source improves resource utilization.
Detailed description of the invention
It in order to more clearly explain the technical solutions in the embodiments of the present application, below will be to embodiment or description of the prior art
Needed in attached drawing be briefly described, it should be apparent that, the accompanying drawings in the following description is only some of the application
Embodiment for those of ordinary skill in the art without any creative labor, can also be according to these
Attached drawing obtains other attached drawings.
Fig. 1 is a kind of flow chart for data processing method that the embodiment of the present application one provides；
Fig. 2 be the embodiment of the present application one provide generate the schematic diagram of different tokens in different moments；
Fig. 3 is the flow chart for another data processing method that the embodiment of the present application two provides；
Fig. 4 is the relation schematic diagram of the first block head that the embodiment of the present application two provides and the second block head；
Fig. 5 is a kind of structural schematic diagram for data processing system that the embodiment of the present application three provides；
Fig. 6 is the schematic diagram for the terminal device that the embodiment of the present application four provides.
Specific embodiment
In being described below, for illustration and not for limitation, the tool of such as particular system structure, technology etc is proposed
Body details, so as to provide a thorough understanding of the present application embodiment.However, it will be clear to one skilled in the art that there is no these specific
The application also may be implemented in the other embodiments of details.In other situations, it omits to well-known system, device, electricity
The detailed description of road and method, so as not to obscure the description of the present application with unnecessary details.
In order to illustrate technical solution described herein, the following is a description of specific embodiments.
It should be appreciated that ought use in this specification and in the appended claims, term " includes " instruction is described special
Sign, entirety, step, operation, the presence of element and/or component, but be not precluded one or more of the other feature, entirety, step,
Operation, the presence or addition of element, component and/or its set.
It is also understood that mesh of the term used in this present specification merely for the sake of description specific embodiment
And be not intended to limit the application.As present specification and it is used in the attached claims, unless on
Other situations are hereafter clearly indicated, otherwise " one " of singular, "one" and "the" are intended to include plural form.
It will be further appreciated that the term "and/or" used in present specification and the appended claims is
Refer to any combination and all possible combinations of one or more of associated item listed, and including these combinations.
As used in this specification and in the appended claims, term " if " can be according to context quilt
Be construed to " when ... " or " once " or " in response to determination " or " in response to detecting ".Similarly, phrase " if it is determined that " or
" if detecting [described condition or event] " can be interpreted to mean according to context " once it is determined that " or " in response to true
It is fixed " or " once detecting [described condition or event] " or " in response to detecting [described condition or event] ".
In the specific implementation, mobile terminal described in the embodiment of the present application is including but not limited to such as with the sensitive table of touch
Mobile phone, laptop computer or the tablet computer in face (for example, touch-screen display and/or touch tablet) etc it is other
Portable device.It is to be further understood that in certain embodiments, above equipment is not portable communication device, but is had
The desktop computer of touch sensitive surface (for example, touch-screen display and/or touch tablet).
In following discussion, the mobile terminal including display and touch sensitive surface is described.However, should manage
Solution, mobile terminal may include that one or more of the other physical User of such as physical keyboard, mouse and/or control-rod connects
Jaws equipment.
Mobile terminal supports various application programs, such as one of the following or multiple: drawing application program, demonstration application
Program, word-processing application, website creation application program, disk imprinting application program, spreadsheet applications, game are answered
With program, telephony application, videoconference application, email application, instant messaging applications, forging
Refining supports application program, photo management application program, digital camera application program, digital camera application program, web-browsing to answer
With program, digital music player application and/or video frequency player application program.
At least one of such as touch sensitive surface can be used in the various application programs that can be executed on mobile terminals
Public physical user-interface device.It can be adjusted among applications and/or in corresponding application programs and/or change touch is quick
Feel the corresponding information shown in the one or more functions and terminal on surface.In this way, terminal public physical structure (for example,
Touch sensitive surface) it can support the various application programs with user interface intuitive and transparent for a user.
In addition, term " first ", " second ", " third " etc. are only used for distinguishing description, and cannot in the description of the present application
It is interpreted as indication or suggestion relative importance.
Embodiment one:
Fig. 1 shows a kind of flow chart of data processing method of the offer of the embodiment of the present application one, and details are as follows:
Step S11 generates at least two tokens by different nodes, wherein one after preset interval time reaches
Node generates a token.
The node of the present embodiment accesses the same network, wherein node here includes large server, personal computer
(personal computer, PC), mobile phone etc., same node may be identical in the token that different time generates, it is also possible to no
Together；Different nodes may be identical in the token that the same time generates, it is also possible to and it is different, for example, when there are node A, node B, sections
When point C, in the same time, node A generates token X, and node B generates token X, and node C generates token Y, then in same time, section
Point A is identical with the token that node B is generated, and the token that node C is generated is different.
When optionally, in order to guarantee to generate new token, the corresponding task of a upper token has been finished, then described pre-
If interval time should be greater than or equal to execute any one task finish the required time.
Step S12 executes corresponding task by least one token that the different nodes generate, wherein an order
Board is corresponding with a task, and the task comprises at least one of the following: data collection, data summarization, data verification, data are held
Row, data storage, is calculated payment at data review.
In the present embodiment, a token is corresponding with a task, for example, there are a token and " data collection " this
Task is corresponding, corresponding with " data summarization " this task etc. there are a token.Optionally, when the type of pending data has
When a variety of, above-mentioned task would be subdivided into subtask corresponding with the type of pending data, and with " data collection ", this task is
" data collection " task subdivision is a plurality of types of " data collection " tasks by example: assuming that the type of pending data includes: to hand over
Easy data, contract data, commercially available data, sensing data, document data, audio data, video data etc..Then " data collection " appoints
Business would be subdivided into " transaction data collection " task, " contract data collection " task, " commercially available data collection " task, " sensing data
Collect " task, " document data collection " task, " audio data collection " task, " video data collection " task, similarly, other
Non- " data collection " task it is similar, details are not described herein again.
Referring to fig. 2, it is assumed that the task major class of the present embodiment includes that data collection, data summarization, data verification, data are held
Row, data review, data store and calculate payment.T1, T2, T3, T4, T5, T6, T7 indicate corresponding after preset interval time reaches
At the time of.11~17,21~27 etc. it is corresponding be token number (or task group), for example, it is assumed that 11 it is corresponding be " number of deals
According to collect " this task group, 21 it is corresponding be " contract data collection " this task group；Corresponding, 12 is corresponding
" transaction data summarizes " this task group, 22 it is corresponding be " contract data summarizes " this task group；Other according to
Secondary to analogize, details are not described herein again.
Time T1 is any observation moment, and with the calculating of this time point, point 7 steps complete a kind of all works of categorical data processing
To make, each each node of step can generate a random token, with reference to Fig. 2, such as:
At the T1 moment, node N generates 11 command boards, then executes transaction data collection；
At the T2 moment, node N generates 23 command boards, then executes contract data verifying；
And so on, each node executes different tasks at different times, similarly, the workflow and section of node L
Point N is the same.
By the way that the node of the whole network is randomly generated token, when different nodes is generating same token at the same time
When, being equivalent to these different node divisions is same group, and the same task of this group node processing, several group nodes have been divided the work
At all processing works of a kind of data (collection of such as transaction data summarizes, verifies, executes, checks, stores, calculates payment)
Make, other kinds of data can similarly be assigned to node processing, this, which is equivalent to, realizes institute within T (such as 1 second time) period
There is the processing of task (including: transaction, contract, commercially available, sensing, document, audio, video data etc.), is similar to grid computing, tool
There is super powerful data-handling capacity, while a large amount of energy can be saved, because each node is doing significant work
Make.
In the embodiment of the present application, after preset interval time reaches, at least two tokens is generated by different nodes, are led to
It crosses at least one token that the different nodes generate and executes corresponding task.Since the task of the embodiment of the present application includes following
At least one: data collection, data summarization, data verification, data execute, data review, data storage, calculate payment, and default
Interval time reach after, different nodes generate at least two tokens, therefore, in point at the same time, different nodes according to
At least two tokens will execute at least two different tasks, avoid all nodes at the same time point be carried out it is identical
Task greatly realizes the optimization of resource so as to avoid the waste for calculating power, improves resource utilization.
Embodiment two:
Fig. 3 shows the flow chart of another data processing method of the offer of the embodiment of the present application two, implements in the application
In example, step S31 and step S32 are identical as the step S11 of embodiment one and step S12, and details are not described herein again.
Step S31 generates at least two tokens by different nodes, wherein one after preset interval time reaches
Node generates a token.
Step S32 executes corresponding task by least one token that the different nodes generate, wherein an order
Board is corresponding with a task, and the task comprises at least one of the following: data collection, data summarization, data verification, data are held
Row, data storage, is calculated payment at data review.
Optionally, in order to realize the impartial disposition of resource, the probability for making each node generate token not of the same race is equal as far as possible,
Token then is generated by the mapping relations of random number, at this point, the step S32 includes:
A1, preset interval time reach after, pass through different nodes generate at least two different random numbers.
Specifically, after preset interval time reaches, each node generates a random number according to random function, generates
Random number at least exist 2 different random numbers.Wherein, the random function that different nodes generate random number can be identical
It can be different.
A2, corresponding token is generated according at least two different random numbers and preset mapping table.
Specifically, the corresponding relationship of the storage of preset mapping table random number and token, it should be pointed out that this is preset to reflect
In firing table, the corresponding token of 1 random number can also correspond to the same token with multiple random numbers, be not construed as limiting herein.
Step S33, the data obtained after appointed task is executed are stored in specified address, and the appointed task is appointed according to described
Business determines.
In the present embodiment, after appointed task executes, the data obtained after the appointed task executes are stored, for example, false
If appointed task is that " the data storage " in above-mentioned task holds storage then after performing " data storage " this task
The data obtained after row " data storage " task.
In the present embodiment, specified address includes specified node, specifically, the data obtained after appointed task is executed
It is stored in specified node, which can be fixed node, right such as using large server as specified node
Ying Di, the data obtained after appointed task is executed are stored on large server；The specified node may be dynamic
Node, for example, the node nearest from the node for executing appointed task is accordingly held appointed task as specified node
The data obtained after row are stored in the node nearest from the node for executing appointed task.
Optionally, it is described appointed task is executed after obtained data be stored in specified address, comprising:
The data distribution formula obtained after appointed task is executed is stored in specified address and synchronization.
Specifically, the data that can be obtained after a node executes appointed task are stored in specified address and then should
The data that appointed task obtains after executing are stored in other nodes, during storage, need the finger stored to each node
Determine the data obtained after task execution and carry out time synchronization, to guarantee the uniformity of the data of storage.
Step S34, the data and corresponding storage address obtained after being executed according to the appointed task determine the finger
Determine the cryptographic Hash of the data obtained after task execution.
In the present embodiment, it is assumed that the data that appointed task obtains after executing are data A, then according to data A and the number
The cryptographic Hash of data A is determined according to the storage address of A.Optionally, the probability of identical cryptographic Hash is obtained in order to reduce different data,
The cryptographic Hash of the present embodiment is 256 cryptographic Hash.
The cryptographic Hash of step S35, the data obtained after the appointed task is executed are stored in block body.
In the present embodiment, since the data only obtained after block body executes appointed task are stored in the Hash of specified address
Value, rather than the specific data directly obtained after the execution of storage appointed task, and cryptographic Hash is much smaller than specific data, usually
Therefore 1KB can effectively reduce the size of block body.
Optionally, after the step S35, further includes:
The first block head is generated, the first block head includes the state letter for being directed toward the pointer and node of the second block head
Breath, the second block head are the corresponding block of block body of the cryptographic Hash of the data obtained after the deposit appointed task executes
Head, the second block head include the pointer for being directed toward the first block head, and the node is the second block head and institute
State node corresponding to the corresponding block body of the second block head.
In the present embodiment, the first block head in addition to include be directed toward the second block head pointer and node status information it
It outside, can also include cryptographic Hash (the i.e. corresponding previous block head of the first block head of version information, previous block head
Cryptographic Hash), cryptographic Hash, the cryptographic Hash of the second block head of current block head (i.e. the first block head) etc..Wherein, the state of node
Information refers to the pending contract information of the block chain where the second block head, for example, the type when pending data includes contract
Data, and at the end of current time contract does not have, then the status information of node will include corresponding pending contract information.Certainly,
If the contract of the status information for the node that the first block head includes executes completion, the first block head will be deleted.Wherein, the firstth area
Build, the second block head, the corresponding block body of the second block head relationship can be as shown in Figure 4.Block in Fig. 4, on auxiliary chain
Head is the first different block head, and the block head on main chain is the second different block head.It should be pointed out that Fig. 4
The storage of block body is contract data, transaction data, commercially available data, sensing data, document data, audio data, video data
Corresponding cryptographic Hash, in a practical situation, block body store corresponding cryptographic Hash according to the type of pending data, herein no longer
It repeats.
Due to increasing the status information of node in the first block head, the area where the first block head can be passed through
Which contract block chain, which quickly finds, is not completed, and if desired further checks the information for the contract that do not complete, then can be led to
The pointer for crossing direction the second block head that the first block head includes finds the second block head, then checks the second block head
The SNAPSHOT INFO (cryptographic Hash for the data that appointed task obtains after executing) of corresponding block body, should it is possible to further basis
The data that the appointed task that the SNAPSHOT INFO of block body finds storage obtains after executing.
In the present embodiment, the second block head in addition to include be directed toward the first block head pointer, can also include version information,
The cryptographic Hash of previous block head, cryptographic Hash, the cryptographic Hash of block body of current block head (i.e. the second block head) etc..
Optionally, in order to expand the range for obtaining the data obtained after task execution, after the step S32, comprising:
The data that the whole network broadcasting tasks obtain after executing.
In the present embodiment, the data obtained after the Web broadcast task execution where different nodes, for example, in " data
After collection " executes, the data obtained after " data collection " executes are broadcasted.
Optionally, in order to quickly broadcast different types of data, number that the whole network broadcasting tasks obtain after executing
According to, comprising:
After selecting corresponding port the whole network to broadcast the task execution according to the type of the data obtained after task execution
The data arrived.
In the present embodiment, when the type difference of pending data, then the type of the data obtained after task execution is not yet
Together, at this point, the data obtained after selecting corresponding port broadcasting tasks to execute according to the type of data.For example, can be by " number of deals
According to collecting " data that obtain after task execution are by the broadcast of port A the whole network, by what is obtained after " contract data collection " task execution
Data are broadcasted by port B the whole network, due to broadcasting different types of data by different port the whole network, can be effectively improved
The speed of the whole network broadcast.
Embodiment three:
With reference to above-described embodiment one and embodiment two, Fig. 5 shows a kind of data processing of the offer of the embodiment of the present application three
The structural schematic diagram of system, for ease of description, only the parts related to this embodiment are shown:
The data processing system includes token generation unit 51 and task executing units 52.Wherein:
Token generation unit 51, for generating at least two orders by different nodes after preset interval time reaches
Board a, wherein node generates a token；
The node of the present embodiment accesses the same network, wherein node here includes large server, PC machine, mobile phone
Deng, same node the token that different time generates may be identical, it is also possible to it is different；The order that different nodes are generated in the same time
Board may be identical, it is also possible to different.
When optionally, in order to guarantee to generate new token, the corresponding task of a upper token has been finished, then described pre-
If interval time should be greater than or equal to execute any one task finish the required time.
Task executing units 52, at least one token for being generated by the different nodes execute corresponding task,
Wherein, a token is corresponding with a task, and the task comprises at least one of the following: data collection, data summarization, data are tested
Card, data execute, data review, data storage, calculate payment.
Optionally, when the type of pending data there are many when, above-mentioned task would be subdivided into the type with pending data
Corresponding subtask.
Since the task of the embodiment of the present application comprises at least one of the following: data collection, data summarization, data verification, number
It according to execution, data review, data storage, calculates payment, and after preset interval time reaches, different nodes generate at least two and enable
Board, therefore, in point at the same time, different nodes will execute at least two different tasks according at least two tokens, keep away
Exempt from all nodes and be carried out identical task in point at the same time, so as to avoid the waste for calculating power, greatly realizes money
The optimization in source improves resource utilization.
Optionally, the data processing system further include:
Storage unit, data for obtaining after executing appointed task are stored in specified address, the appointed task according to
The task determines；
Wherein, specified address includes specified node, which can be fixed node, such as services large size
Device is as specified node；The specified node may be dynamic node, for example, most by the node from execution appointed task
Close node is as specified node.
Cryptographic Hash determination unit, data and corresponding storage address for being obtained after being executed according to the appointed task
Determine the cryptographic Hash of the data obtained after the appointed task executes；
The cryptographic Hash of block body content determining unit, the data for obtaining after executing the appointed task is stored in block
Body.
Optionally, the block body content determining unit is specifically used for the data distribution formula obtained after executing appointed task
It is stored in specified address and synchronization.
Optionally, the data processing system further include:
First block head generation unit, for generating the first block head, the first block head includes being directed toward the second block
The pointer of head and the status information of node, the second block head are the data obtained after the deposit appointed task executes
The corresponding block head of the block body of cryptographic Hash, the second block head include the pointer for being directed toward the first block head, the section
Point is node corresponding to the second block head and the corresponding block body of the second block head.
In the present embodiment, the first block head in addition to include be directed toward the second block head pointer and node status information it
It outside, can also include cryptographic Hash (the i.e. corresponding previous block head of the first block head of version information, previous block head
Cryptographic Hash), cryptographic Hash, the cryptographic Hash of the second block head of current block head (i.e. the first block head) etc..Wherein, the state of node
Information refers to the pending contract information of the block chain where the second block head.Certainly, if the shape for the node that the first block head includes
The contract of state information executes completion, will delete the first block head.
In the present embodiment, the second block head in addition to include be directed toward the first block head pointer, can also include version information,
The cryptographic Hash of previous block head, cryptographic Hash, the cryptographic Hash of block body of current block head (i.e. the second block head) etc..
Optionally, the data processing system further include:
The whole network radio unit, the data obtained after being executed for the whole network broadcasting tasks.
Optionally, the whole network radio unit is specifically used for selecting to correspond to according to the type of the data obtained after task execution
Port the whole network broadcast the data obtained after the task execution.
Optionally, the token generation unit 51 includes:
Random number generation module, for generating at least two not by different nodes after preset interval time reaches
Same random number；
Specifically, after preset interval time reaches, each node generates a random number according to random function, generates
Random number at least exist 2 different random numbers.Wherein, the random function that different nodes generate random number can be identical
It can be different.
Token determining module is corresponded to for being generated according at least two different random numbers and preset mapping table
Token.
It should be understood that the size of the serial number of each step is not meant that the order of the execution order in above-described embodiment, each process
Execution sequence should be determined by its function and internal logic, the implementation process without coping with the embodiment of the present application constitutes any limit
It is fixed.
Embodiment three:
Fig. 6 is the schematic diagram for the terminal device that one embodiment of the application provides.As shown in fig. 6, the terminal of the embodiment is set
Standby 6 include: processor 60, memory 61 and are stored in the meter that can be run in the memory 61 and on the processor 60
Calculation machine program 62.The processor 60 is realized when executing the computer program 62 in above-mentioned each data processing method embodiment
The step of, such as step S11 to S12 shown in FIG. 1.Alternatively, realization when the processor 60 executes the computer program 62
The function of each module/unit in above-mentioned each system embodiment, such as the function of module 51 to 52 shown in Fig. 5.
Illustratively, the computer program 62 can be divided into one or more module/units, it is one or
Multiple module/units are stored in the memory 61, and are executed by the processor 60, to complete the application.Described one
A or multiple module/units can be the series of computation machine program instruction section that can complete specific function, which is used for
Implementation procedure of the computer program 62 in the terminal device 6 is described.For example, the computer program 62 can be divided
Token generation unit and task executing units are cut into, each unit concrete function is as follows:
Token generation unit, for generating at least two tokens by different nodes after preset interval time reaches,
Wherein, a node generates a token；
Task executing units, at least one token for being generated by the different nodes execute corresponding task,
In, a token is corresponding with a task, and the task comprises at least one of the following: data collection, data summarization, data are tested
Card, data execute, data review, data storage, calculate payment.
The terminal device 6 can be the calculating such as desktop PC, notebook, palm PC and cloud server and set
It is standby.The terminal device may include, but be not limited only to, processor 60, memory 61.It will be understood by those skilled in the art that Fig. 6
The only example of terminal device 6 does not constitute the restriction to terminal device 6, may include than illustrating more or fewer portions
Part perhaps combines certain components or different components, such as the terminal device can also include input-output equipment, net
Network access device, bus etc..
Alleged processor 60 can be central processing unit (Central Processing Unit, CPU), can also be
Other general processors, digital signal processor (Digital Signal Processor, DSP), specific integrated circuit
(Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-
Programmable Gate Array, FPGA) either other programmable logic device, discrete gate or transistor logic,
Discrete hardware components etc..General processor can be microprocessor or the processor is also possible to any conventional processor
Deng.
The memory 61 can be the internal storage unit of the terminal device 6, such as the hard disk or interior of terminal device 6
It deposits.The memory 61 is also possible to the External memory equipment of the terminal device 6, such as be equipped on the terminal device 6
Plug-in type hard disk, intelligent memory card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card dodge
Deposit card (Flash Card) etc..Further, the memory 61 can also both include the storage inside list of the terminal device 6
Member also includes External memory equipment.The memory 61 is for storing needed for the computer program and the terminal device
Other programs and data.The memory 61 can be also used for temporarily storing the data that has exported or will export.
It is apparent to those skilled in the art that for convenience of description and succinctly, only with above-mentioned each function
Can unit, module division progress for example, in practical application, can according to need and by above-mentioned function distribution by different
Functional unit, module are completed, i.e., the internal structure of described device is divided into different functional unit or module, more than completing
The all or part of function of description.Each functional unit in embodiment, module can integrate in one processing unit, can also
To be that each unit physically exists alone, can also be integrated in one unit with two or more units, it is above-mentioned integrated
Unit both can take the form of hardware realization, can also realize in the form of software functional units.In addition, each function list
Member, the specific name of module are also only for convenience of distinguishing each other, the protection scope being not intended to limit this application.Above system
The specific work process of middle unit, module, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, is not described in detail or remembers in some embodiment
The part of load may refer to the associated description of other embodiments.
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
Scope of the present application.
In embodiment provided herein, it should be understood that disclosed device/terminal device and method, it can be with
It realizes by another way.For example, device described above/terminal device embodiment is only schematical, for example, institute
The division of module or unit is stated, only a kind of logical function partition, there may be another division manner in actual implementation, such as
Multiple units or components can be combined or can be integrated into another system, or some features can be ignored or not executed.Separately
A bit, shown or discussed mutual coupling or direct-coupling or communication connection can be through some interfaces, device
Or the INDIRECT COUPLING or communication connection of unit, it can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated module/unit be realized in the form of SFU software functional unit and as independent product sale or
In use, can store in a computer readable storage medium.Based on this understanding, the application realizes above-mentioned implementation
All or part of the process in example method, can also instruct relevant hardware to complete, the meter by computer program
Calculation machine program can be stored in a computer readable storage medium, the computer program when being executed by processor, it can be achieved that on
The step of stating each embodiment of the method.Wherein, the computer program includes computer program code, the computer program generation
Code can be source code form, object identification code form, executable file or certain intermediate forms etc..The computer-readable medium
It may include: any entity or device, recording medium, USB flash disk, mobile hard disk, magnetic that can carry the computer program code
Dish, CD, computer storage, read-only memory (ROM, Read-Only Memory), random access memory (RAM,
Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium etc..It should be noted that described
The content that computer-readable medium includes can carry out increasing appropriate according to the requirement made laws in jurisdiction with patent practice
Subtract, such as does not include electric carrier signal and electricity according to legislation and patent practice, computer-readable medium in certain jurisdictions
Believe signal.
Embodiment described above is only to illustrate the technical solution of the application, rather than its limitations；Although referring to aforementioned reality
Example is applied the application is described in detail, those skilled in the art should understand that: it still can be to aforementioned each
Technical solution documented by embodiment is modified or equivalent replacement of some of the technical features；And these are modified
Or replacement, the spirit and scope of each embodiment technical solution of the application that it does not separate the essence of the corresponding technical solution should all
Comprising within the scope of protection of this application.
Claims (10)
1. a kind of data processing method characterized by comprising
After preset interval time reaches, at least two tokens are generated by different nodes, wherein a node generates one
Token；
Corresponding task is executed by least one token that the different nodes generate, wherein a token and a task
Corresponding, the task comprises at least one of the following: data collection, data summarization, data verification, data are executed, data review, are counted
According to storing, calculate payment.
2. data processing method as described in claim 1, which is characterized in that generated extremely described by the different nodes
A few token executes after corresponding task, comprising:
The data obtained after appointed task is executed are stored in specified address, and the appointed task is determined according to the task；
After the data and corresponding storage address obtained after being executed according to the appointed task determine that the appointed task executes
The cryptographic Hash of obtained data；
The cryptographic Hash of the data obtained after the appointed task is executed is stored in block body.
3. data processing method as claimed in claim 2, which is characterized in that it is described appointed task is executed after obtained data
It is stored in specified address, comprising:
The data distribution formula obtained after appointed task is executed is stored in specified address and synchronization.
4. data processing method as claimed in claim 2, which is characterized in that obtained after the execution by the appointed task
Data cryptographic Hash deposit block body after, further includes:
The first block head is generated, the first block head includes the status information for being directed toward the pointer and node of the second block head,
The second block head is the corresponding block head of block body of the cryptographic Hash of the data obtained after the deposit appointed task executes,
The second block head includes the pointer for being directed toward the first block head, and the node is the second block head and described the
Node corresponding to the corresponding block body of two block heads.
5. data processing method as described in claim 1, which is characterized in that generated extremely described by the different nodes
A few token executes after corresponding task, comprising:
The data that the whole network broadcasting tasks obtain after executing.
6. data processing method as claimed in claim 5, which is characterized in that the number that the whole network broadcasting tasks obtain after executing
According to, comprising:
It is obtained after selecting corresponding port the whole network to broadcast the task execution according to the type of the data obtained after task execution
Data.
7. such as data processing method as claimed in any one of claims 1 to 6, which is characterized in that described in preset interval time
After arrival, at least two tokens are generated by different nodes, comprising:
After preset interval time reaches, at least two different random numbers are generated by different nodes；
Corresponding token is generated according at least two different random numbers and preset mapping table.
8. a kind of data processing system characterized by comprising
Token generation unit, for generating at least two tokens by different nodes after preset interval time reaches,
In, a node generates a token；
Task executing units, at least one token for being generated by the different nodes execute corresponding task, wherein one
A token is corresponding with a task, and the task comprises at least one of the following: data collection, data summarization, data verification, data
It executes, data review, data storage, calculate payment.
9. a kind of terminal device, including memory, processor and storage are in the memory and can be on the processor
The computer program of operation, which is characterized in that the processor realizes such as claim 1 to 7 when executing the computer program
The step of any one the method.
10. a kind of computer readable storage medium, the computer-readable recording medium storage has computer program, and feature exists
In when the computer program is executed by processor the step of any one of such as claim 1 to 7 of realization the method.
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 true CN108985758A (en) | 2018-12-11 |
| CN108985758B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220138730A1 (en) * | 2018-08-20 | 2022-05-05 | 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 |
|---|
| 刘肖飞: "基于动态授权的拜占庭容错共识算法的区块链性能改进研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220138730A1 (en) * | 2018-08-20 | 2022-05-05 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108985758B (en) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guo et al. | Graph structure and statistical properties of Ethereum transaction relationships | |
| CN109741173B (en) | Method, device, equipment and computer storage medium for identifying suspicious money laundering teams | |
| CN108021984A (en) | Determine the method and system of the feature importance of machine learning sample | |
| CN107967539A (en) | The method for the fuel limitation merchandised on prediction ether mill based on machine learning and block chain technology | |
| CN106294564A (en) | A kind of video recommendation method and device | |
| CN109299334A (en) | A kind of data processing method and device of knowledge mapping | |
| Liu et al. | A graph learning based approach for identity inference in dapp platform blockchain | |
| CN109189931A (en) | A kind of screening technique and device of object statement | |
| CN111046237A (en) | User behavior data processing method and device, electronic equipment and readable medium | |
| KR20210113885A (en) | Method and system for detecting fraud financial transaction | |
| CN108446968A (en) | A kind of method, apparatus and terminal device of accounting entry | |
| Yang et al. | Recent development trend of blockchain technologies: A patent analysis | |
| CN105913235A (en) | Client account transfer relation analysis method and system | |
| CN107784596A (en) | Insurance kind state information statistics method, terminal device and the storage medium of declaration form | |
| CN107368255B (en) | Unlocking method, mobile terminal and computer readable storage medium | |
| Li et al. | Three-hop velocity attenuation propagation model for influence maximization in social networks | |
| CN109784365A (en) | A kind of feature selection approach, terminal, readable medium and computer program | |
| CN109543959A (en) | Examine chain generation method, device, computer equipment and storage medium | |
| CN108985758A (en) | Data processing method, data processing system and terminal device | |
| WO2021093320A1 (en) | Method and apparatus for outputting information | |
| CN111552738B (en) | Block chain ecological system and block chain uplink method based on Internet of things | |
| CN111612616A (en) | Block chain account evaluation method and device, terminal device and computer readable medium | |
| CN108985908A (en) | Real estate information sharing method, device, computer readable storage medium | |
| Kumar et al. | Machine learning for cloud management | |
| CN109450963A (en) | Information push method and terminal device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |