History data processing method, system and computer readable storage mediumTechnical field
The present invention relates to alliance's block chain technical field, in particular to a kind of history data processing method, system and calculatingMachine readable storage medium storing program for executing.
Background technique
Resume record education educational background, speciality and the employment history of a people.For traditionally, resume has been oriented to for a long timeThe achievement that a people has reached to some time point is recorded, main function is learner or job hunter to obtain interview or visitThe tool for talking chance, since it is often Zheng Cai department or academic institution selects the main foundation of candidate, importance is visibleOne spot.
For at present, the education experience in curriculum vitae is stored in students' archives, and after graduating, students' archives informationIt is placed on the talents market of school, employment company or various regions；And the information preservation of employment history is in the manpower money in work locationSource and social security bureau.It is more troublesome for desired querying individual resume are current.Above-mentioned Custodian only realizes personal shoeIt counts the acquisition and storage of evidence one by one, and seems to be improved on inquiry easness and safety, moreover, if only simply willHistory data is simple and crude to be enumerated together, and storage in a system, is stored in a system or a server,So the shared of these information will face huge privacy leakage problem.
Summary of the invention
It is an object of that present invention to provide a kind of history data processing method, system and computer readable storage mediums, are based onBlock chain technology and Asymmetric Cryptography technology can will be stored on alliance's block chain after curriculum vitae data encryption, Ji NengquanNet is shared, and can fully ensure that data privacy and safety.
Specific technical solution provided in an embodiment of the present invention is as follows:
In a first aspect, providing a kind of history data processing method, comprising:
First node in peer-to-peer network is using the history data of the public key encryption user A of user A to generate ciphertext, and structureMake the structured message comprising the ciphertext, the corresponding private key of the public key is saved by user A；
The structured message is broadcasted other multiple nodes into the peer-to-peer network by the first node；
Other described nodes verify the structured message, if verification passes through, by the peer-to-peer networkThe structured message is recorded in respective caching by each node；
By the specified node timing in the peer-to-peer network to multiple including the structured message in cachingAlliance's block chain is written at block in information package.
In another embodiment, the first node in the peer-to-peer network uses the shoe of the public key encryption user A of user AIt counts one by one before generating ciphertext step accordingly, the method also includes:
The first node generates the public key and the private key according to the biometric information of user A；
Wherein, the biometric information includes any in finger print information, face information, eyeprint information and iris informationOr a variety of any combination.
In another embodiment, the structured message of the construction comprising the ciphertext includes:
The first node carries out Hash operation to the ciphertext, generates ciphertext abstract；And
The structured message is constructed using the ciphertext and ciphertext abstract.
In another embodiment, other described nodes, which verify to the structured message, includes:
Other described nodes carry out Hash operation to the ciphertext in the structured message, cryptographic Hash are obtained, using describedCryptographic Hash verifies ciphertext abstract.
In another embodiment, the specified node timing by the peer-to-peer network is to the ciphertext in cachingIt carries out being packaged into block with other ciphertexts, write-in alliance's block chain includes:
In preset time point, following operation is executed by the specified node:
To multiple information including the structured message, time sort ascending is generated by information, by specifiedHierarchical structure is organized, and adds head building block；
The whole network broadcast that the block of building is carried out to the peer-to-peer network, is total to the block if obtaining the whole networkKnow, then alliance's block chain is written into the block.
In another embodiment, further includes:
If the second node in the peer-to-peer network gets the interview request of user A, from alliance's block chainCiphertext associated with user A is inquired, and the public key of oneself and the ciphertext inquired are sent to the terminal of user A；
The terminal of user A generates transition key using the private key of user A and the public key of the second node, and described in useTransition key carries out re-encryption to the ciphertext, generates re-encryption ciphertext；
The second node is decrypted the re-encryption ciphertext using the private key of oneself, to obtain the resume of user AData.
Second aspect provides a kind of history data processing system, comprising:
DEU data encryption unit uses the resume number of the public key encryption user A of user A for the first node in peer-to-peer networkGenerate ciphertext accordingly, the corresponding private key of the public key is saved by user A；
Information structuring unit includes the structured message of the ciphertext for first node construction；
Information radio unit broadcasts the structured message for the first node more into the peer-to-peer networkOther a nodes；
Information checking unit verifies the structured message for other described nodes；
Information recording unit, if passing through for structured message verification, by each node in the peer-to-peer networkThe structured message is recorded in respective caching；
Block construction unit, for by the peer-to-peer network specified node timing in caching include the structureAlliance's block chain is written at block in multiple information packages including change information.
In another embodiment, the system also includes:
Key generating unit generates the public key and institute according to the biometric information of user A for the first nodeState private key；
Wherein, the biometric information includes any in finger print information, face information, eyeprint information and iris informationOr a variety of any combination.
In another embodiment, the information structuring unit is specifically used for:
The first node carries out Hash operation to the ciphertext, generates ciphertext abstract；And
The structured message is constructed using the ciphertext and ciphertext abstract.
In another embodiment, the information checking unit is specifically used for:
Other described nodes carry out Hash operation to the ciphertext in the structured message, cryptographic Hash are obtained, using describedCryptographic Hash verifies ciphertext abstract.
In another embodiment, the block construction unit is specifically used for:
In preset time point, by the specified node to multiple information including the structured message, by informationTime sort ascending is generated, is organized by specified hierarchical structure, and adds head building block；And
The whole network broadcast that the block of building is carried out to the peer-to-peer network, is total to the block if obtaining the whole networkKnow, then alliance's block chain is written into the block.
In another embodiment, further includes:
Cryptogram search unit, if getting the interview request of user A for the second node in the peer-to-peer network, fromCiphertext associated with user A is inquired in alliance's block chain；
The public key of oneself and the ciphertext inquired are sent to user for the second node by information transmitting unitThe terminal of A；
Re-encryption unit, the terminal for user A generate conversion using the private key of user A and the public key of the second nodeKey, and re-encryption is carried out to the ciphertext using the transition key, generate re-encryption ciphertext；
Ciphertext decryption unit is decrypted the re-encryption ciphertext using the private key of oneself for the second node,To obtain the history data of user A.
The third aspect additionally provides a kind of history data processing system, comprising:
One or more processors；
Storage device, for storing one or more programs；
When one or more of programs are executed by one or more of processors, so that one or more of processingDevice realizes the history data processing method as described in first aspect is any.
Fourth aspect additionally provides a kind of computer readable storage medium, is stored with computer program, which is locatedManage the history data processing method realized as described in first aspect is any when device executes.
Technical solution provided in an embodiment of the present invention has the benefit that by by efficiently peer-to-peer network(P2P), in believable multiple allied members, in conjunction with block chain and asymmetric encryption techniques, by the curriculum vitae data of userEncryption generates ciphertext, and constructs the structured message including ciphertext, when propagating ciphertext between node in a peer-to-peer network, by trueTo recognize ciphertext have backup in each node, later by specified node timing in peer-to-peer network in caching comprising user AAt block alliance's block chain is written, due to that can decrypt encrypted resume number in multiple information packages including structured messageAccording to private key by user keeping so that other nodes can not directly share to the history data of the user, it is possible thereby toIt prevents the history data of user from illegally being inquired, being distorted, and then can fully ensure that the privacy and peace of the history data of userQuan Xing.
Detailed description of the invention
To describe the technical solutions in the embodiments of the present invention more clearly, make required in being described below to embodimentAttached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, forFor those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings otherAttached drawing.
Fig. 1 is the flow chart for the history data processing method that the embodiment of the present invention one provides；
Fig. 2 is the flow chart of history data processing method provided by Embodiment 2 of the present invention；
Fig. 3 is the block diagram for the history data processing system that the embodiment of the present invention three provides.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with attached in the embodiment of the present inventionFigure, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only thisInvention a part of the embodiment, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art existEvery other embodiment obtained under the premise of creative work is not made, shall fall within the protection scope of the present invention.
In the description of the present application, it is to be understood that term " first ", " second " etc. are used for description purposes only, withoutIt can be interpreted as indication or suggestion relative importance.In addition, in the description of the present application, unless otherwise indicated, the meaning of " multiple "It is two or more.
Before being illustrated to history data processing method provided by the invention, first to involved by each embodiment of the present inventionAnd term be introduced.
Firstly, block chain is introduced, block chain is that different data are passed through head dress sequentially in time by one kindIt carries a kind of linked data structure that different hash values link together, and guarantees that it can not be distorted and not by the knowledge of cryptographyThe characteristic that can forge and a kind of distributed account book formed.Broadly, block chain technology is exactly to utilize disclosed chained record knotStructure stores and verifies significant data, generates block data using distributed node and unified common recognition mechanism, utilizes passwordKnowledge guarantees the safety and anti-tamper characteristic, its chain structure of data transmission and access and chasing after for transaction dataIt traces back and the intelligent contract that can be made up of automatized script code is come the distribution that programs and one kind of operation data is completely newArchitecture and calculation paradigm.
Alliance's block chain (Consortium blockchains), also known as community's block chain, referred to as " alliance's chain ".AllianceChain refers to the block chain that preselected node is limited by the process of common recognition.Alliance's chain is frequently utilized between enterprise, on the one handGuarantee the shared of data, on the other hand guarantees the access qualification of data on chain, not only facilitate to cooperate in this way, but also advantageously reduce windDanger.For example, a community being made of multiple organizations, multiple organizations may include school, organ, enterprises and institutions' listPosition, public organization and other need to handle the organization of history data, each organization runs a node, andAnd needing to obtain the confirmation of the wherein most of node of alliance's chain to make each block come into force, block chain perhaps allows eachNode all can be read, or be limited only in participant, or walk mixed type route, such as the root Hash and its API of block (apply journeySequence interface) external disclosure, the permissible extraneous inquiry for being used to make finite number of time of API and the information for obtaining block chain state, theseBlock chain can be considered " part decentralization ".
Peer-to-peer network (peer-to-peer, abbreviation P2P), also known as P-2-P technology, are non-stop layer servers, by userThe Generation Internet of group (peers) exchange information, its effect is, lowers the node in previous network transmission, to reduce moneyExpect the risk lost.Different from there is the central network system of central server, each user terminal of peer-to-peer network is both a sectionPoint also has the function of server, any one node can not directly find other nodes, it is necessary to which by its family, group carries out information friendshipStream.The participant of network shares a part of hardware resource that they are possessed, these shared resources by network offering services andContent can directly be accessed by other peer nodes (Peer) without being subjected to intermediate entities.Participant in this network is bothResource, service and content supplier, and be that resource, service and content obtain taker.
Embodiment one
Fig. 1 is the flow chart for the history data processing method that the embodiment of the present invention one provides, as shown in Figure 1, the present invention is realThe history data processing method for applying example offer may comprise steps of:
110, the first node in peer-to-peer network using the history data of the public key encryption user A of user A to generate ciphertext,And the structured message comprising ciphertext is constructed, the corresponding private key of public key is saved by user A.
In embodiment, peer-to-peer network is made of the network node of multiple equities.Peer-to-peer network can be utilizationWhat Kademlia (abbreviation Kad) agreement was constructed.Wherein, Kademlia is a kind of P2P overlay network of structuring, belongs to oneKind distributed hashtable (DHT) technology, it is distance measure basis with unique exclusive or algorithm (XOR), to establish a kind of DHT netNetwork topological structure possesses high routing inquiry speed.
Wherein, the role of user A can be student or employee, first node tissue as belonging to user A of peer-to-peer networkMechanism M (e.g., school or enterprise) operation.When user A leaves the organization M belonging to it, (e.g., user A is in school or enterpriseGraduation is left office) when, then user A is encrypted in the study of organization M or track record data by first node, it is rawAt ciphertext.Wherein, the public key of user A can be user A be previously provided to first node or by first node be user A generate, private key corresponding with the public key of user A is taken care of by user A.It is understood that user A is not spy in the embodiment of the present inventionRefer to.
In the specific implementation process, first node can by run Encrypt function, using the public key of user A asThe input of Encrypt function encrypts the history data of user A, generates ciphertext.Then, ciphertext is carried out by first nodeHash operation generates ciphertext abstract, and uses ciphertext and ciphertext abstract structural texture information.Wherein, structural texture informationIt simultaneously also include timestamp.Wherein, the hash algorithm that Hash operation uses can be any safe and reliable hash algorithm, such asSHA256, the close SM3 of state or the close SM4 of state etc..
In addition, ciphertext abstract can it is subsequent by other nodes to verify whether ciphertext is tampered.
In the embodiment of the present invention, if the node in peer-to-peer network is wanted to upload the history data with user, first will it needThe history data of user is encrypted using the public key of the user, due to that can decrypt the private key of encrypted history data by thisUser's keeping, so that other nodes can not directly share to the history data of the user, therefore can ensure the shoe of userCount the safety of evidence one by one.
Optionally, prior to step 110, method provided in an embodiment of the present invention can also include:
100, first node generates the public key and private key of user A according to the biometric information of user A.
Wherein, biometric information include in finger print information, face information, eyeprint information and iris information appoint it is one or moreAny combination of kind.
Specifically, first node can be according to the biometric information of user A using preset ellipse in alliance's block chainThe public key and private key of parameter of curve generation user A.Wherein, preset elliptic curve parameter can be ED25519 algorithm or state is closeSM2 algorithm.
In addition, can also be passed through in alliance's block chain according to its biometric information if user A loses its private key or public keyArbitrary node the public key and private key of the user A are regenerated using preset elliptic curve parameter.
In the embodiment of the present invention, since the public key and private key of user A are generated according to its biometric information, thusIt can ensure the reliability of the private key of user A.
120, structured message is broadcasted other nodes into peer-to-peer network by first node.
In the present embodiment, other nodes refer to the node in addition to first node in peer-to-peer network.
It in the specific implementation process, is the reliability for realizing P2P network, first node can before broadcasting architecture informationWhether other nodes first to detect as peer are online, other nodes to be confirmed retransmit structured message after line.
After other nodes receive the structured message from first node, structured message can be sent to and itsAdjacent node, all nodes being finally diffused into entire peer-to-peer network.
130, other nodes verify structured message, if verification passes through, by each node in peer-to-peer networkStructured message is recorded in respective caching.
Specifically, other nodes verify structured message, which may include:
Other nodes carry out Hash operation to the ciphertext in structured message, obtain cryptographic Hash, and using cryptographic Hash to closeDigest will be compared, and pass through if comparing, recorded the structured message to respective by each node in peer-to-peer networkIn caching, and back-checking does not pass through if comparing by information to first node, does not record the structured message.
It should be noted that within a certain period of time (such as in 1 hour), in the caching of each node in peer-to-peer networkIt can recorde multiple structured messages for different user, multiple structured message can be the difference by peer-to-peer networkNode carries out the whole network broadcast and is recorded in the caching of each node.
It since Hash operation is irreversible, and is correspondingly, so Hash operation obtains in the embodiment of the present inventionTo summary info can be used as verification means and verify whether the cipher-text message received in structured message is tampered, byThis can increase the safety of history data.
140, by the specified node timing in peer-to-peer network to multiple information including structured message in cachingIt is packaged into block, alliance's block chain is written.
Specifically, executing following operation by specified node in preset time point:
A) to multiple information including structured message, time sort ascending is generated by information, passes through specified layerSecondary structure organization is got up, and adds head building block.
B) the whole network that the block of building carries out peer-to-peer network is broadcasted, if obtaining the whole network to the common recognition of block, by blockAlliance's block chain is written.
Wherein, preset time point can be set according to actual needs, for example can set preset time point as per smallWhen 0 point 0 second, i.e., per every other hour, by the specified node in peer-to-peer network in caching including structured messageMultiple information carry out being packaged into block.Wherein, multiple information including the structured message of user A are recorded in peer-to-peer networkIn the caching of each node in network, and can be recorded in after the whole network broadcast by the different nodes of peer-to-peer network it is eachIn the caching of node.
Wherein, specified node refers to going out block node by what is elected in a peer-to-peer network.
Wherein, specified hierarchical structure can be Merkle Tree (Merkel tree) structure.
More specifically, specified node can take out including the structured message of user A in local buffer poolMultiple information, multiple ciphertexts in multiple information according to time sort ascending is generated, then progress Hash operation is obtained multipleThen multiple cryptographic Hash are combined Hash again by cryptographic Hash two-by-two, finally obtain a root Hash, root Hash and multiple ciphertexts,The height of current time, the cryptographic Hash of a upper block and this block is packaged into a block, later, this block togetherIt is gone out by P2P Web broadcast, other nodes is allowed to carry out common recognition verifying, other nodes if the verification passes, can return to a soundShould be to specified node, after specified node receives the response of most of nodes in network, then common recognition is verified, by specifying nodeThis block is write in alliance's block chain, and is synchronized to other nodes in network, so that alliance's each node of block chain be made to reachAt consistent.
In the embodiment of the present invention, since the node of alliance's block chain is believable, and the computer of each node possesses phaseSame zebra time, therefore it is a large amount of to be compared to the existing consumption of PoW common recognition algorithm (Proof of Work) in the prior artComputer resource, and transactions velocity slowly to less than 10/second the problem of, make both there is no meters in above-mentioned common recognition verification processThe problem of resource consumes excessively is calculated, the speed of block chain message authentication can also be substantially improved.
The embodiment of the invention provides a kind of history data processing method, by by efficiently peer-to-peer network (P2P),In believable multiple allied members, in conjunction with block chain and asymmetric encryption techniques, the curriculum vitae data encryption of user is generatedCiphertext, and the structured message including ciphertext is constructed, when propagating ciphertext between node in a peer-to-peer network, by confirming that ciphertext existsEach node has backup, is believed later by the specified node timing in peer-to-peer network the structuring comprising user A in cachingAt block alliance's block chain is written, due to that can decrypt the private key of encrypted history data in multiple information packages including breathBy user keeping, so that other nodes can not directly share to the history data of the user, user thus it can be prevented thatHistory data illegally inquired, distorted, and then can fully ensure that privacy and the safety of the history data of user.
Embodiment two
Fig. 2 is the flow chart of history data processing method provided by Embodiment 2 of the present invention, as shown in Fig. 2, the present invention is realThe history data processing method for applying example offer may comprise steps of:
210, the first node in peer-to-peer network using the history data of the public key encryption user A of user A to generate ciphertext,And the structured message comprising ciphertext is constructed, the corresponding private key of public key is saved by user A.
Specifically, the realization process of the step is identical as step 110, details are not described herein again.
Optionally, before step 210, method can also include:
First node generates the public key and private key of user A according to the biometric information of user A.
Wherein, biometric information include in finger print information, face information, eyeprint information and iris information appoint it is one or moreAny combination of kind.
220, structured message is broadcasted other nodes into peer-to-peer network by first node.
Specifically, the realization process of the step is identical as step 120, details are not described herein again.
230, other nodes verify structured message, if verification passes through, by each node in peer-to-peer networkCiphertext is recorded in respective caching.
Specifically, the realization process of the step is identical as step 130, details are not described herein again.
240, by peer-to-peer network specified node timing in caching ciphertext and other ciphertexts be packaged into block, be writtenAlliance's block chain.
Specifically, the realization process of the step is identical as step 140, details are not described herein again.
If 250, the second node in peer-to-peer network gets the interview request of user A, inquired from alliance's block chainCiphertext associated with user A, and the public key of oneself and the ciphertext that inquires are sent to the terminal of user A.
Wherein, second node is the node that first node is different from peer-to-peer network, and second node can be by its hetero-organizationMechanism operation, other organizations are different from the organization of the resume information of encryption user A.
When user A to the corresponding organization N of second node (e.g., school or enterprise) interview, organization N needsIt checks the resume of user A, then inquires ciphertext associated with user A from alliance's block chain.
Specifically, the embodiment of the present invention is not construed as limiting specific query process.
260, the terminal of user A generates transition key using the private key of user A and the public key of second node, and uses conversionKey pair ciphertext carries out re-encryption, generates re-encryption ciphertext.
270, second node is decrypted using the private key counterweight encrypted cipher text of oneself, to obtain the history data of user A.
Wherein, second node executes Decrypt function, using the private key of second node as the input pair of Decrypt functionThe re-encryption ciphertext got from the terminal of user A is decrypted.After successful decryption, the history data of user A is obtained, thusFoundation of the history data of user A as interview user A ability reference can be used.
Private key use as belonging to the history data in the embodiment of the present invention, since encrypted history data can be decryptedFamily is taken care of, therefore even if second node inquires history data from block chain, also can not directly share to the useThe history data at family, and only after being authorized by user, second node can just share to the history data of the user, thusIt is not only able to realize that the whole network is shared, while the history data for being also possible to prevent user is illegally inquired, distorted, thus, it is possible to avoidThe curriculum vitae data of user are accessed by unsuitable user or by incomplete trusted data center or ISPsLeakage, reduces leaking data risk；In addition, due to the decentralization of block chain, can not distort, retrospective characteristic,During curriculum vitae data query, the cost and redundancy of effort of curriculum vitae data query can be reduced, improves search efficiency,It can also guarantee privacy and the safety of curriculum vitae data simultaneously.
Embodiment three
Fig. 3 is the block diagram for the history data processing system that the embodiment of the present invention three provides, as shown in figure 3, the present invention is implementedExample provide history data processing system may include:.
DEU data encryption unit 31 uses the resume of the public key encryption user A of user A for the first node in peer-to-peer networkTo generate ciphertext, the corresponding private key of public key is saved data by user A；
Information structuring unit 32 includes the structured message of ciphertext for first node construction；
Structured message is broadcasted other multiple sections into peer-to-peer network for first node by information radio unit 33Point；
Information checking unit 34 verifies structured message for other nodes；
Information recording unit 35, if passing through for structured message verification, by each node in peer-to-peer network by structureChange information to be recorded in respective caching；
Block construction unit 36, for by peer-to-peer network specified node timing in caching include structured messageAlliance's block chain is written at block in multiple information packages inside.
In a preferred embodiment, system further include:
Key generating unit 30 generates public key and private key according to the biometric information of user A for first node；
Wherein, biometric information include in finger print information, face information, eyeprint information and iris information appoint it is one or moreAny combination of kind.
In a preferred embodiment, information structuring unit 32 is specifically used for:
First node carries out Hash operation to ciphertext, generates ciphertext abstract；And
Use ciphertext and ciphertext abstract structural texture information.
In a preferred embodiment, information checking unit 34 is specifically used for:
Other nodes carry out Hash operation to the ciphertext in structured message, cryptographic Hash are obtained, using cryptographic Hash to ciphertextAbstract is verified.
In a preferred embodiment, block construction unit 36 is specifically used for:
In preset time point, by specified node to multiple information including structured message, the time is generated by informationSort ascending is organized by specified hierarchical structure, and adds head building block；And
The whole network broadcast that the block of building carries out peer-to-peer network is write block if obtaining the whole network to the common recognition of blockEnter alliance's block chain.
In a preferred embodiment, further includes:
Cryptogram search unit 37, if the interview request of user A is got for the second node in peer-to-peer network, from connectionCiphertext associated with user A is inquired in alliance's block chain；
The public key of oneself and the ciphertext inquired are sent to the end of user A for second node by information transmitting unit 38End；
Re-encryption unit 39, the terminal for user A are close using the public key generation conversion of the private key and second node of user AKey, and re-encryption is carried out to ciphertext using transition key, generate re-encryption ciphertext；
Ciphertext decryption unit 310 is decrypted for second node using the private key counterweight encrypted cipher text of oneself, to obtainThe history data of user A.
The embodiment of the invention provides a kind of history data processing system, which passes through by efficiently peer-to-peer network(P2P), in believable multiple allied members, in conjunction with block chain and asymmetric encryption techniques, by the curriculum vitae data of userEncryption generates ciphertext, and constructs the structured message including ciphertext, when propagating ciphertext between node in a peer-to-peer network, by trueTo recognize ciphertext have backup in each node, later by specified node timing in peer-to-peer network in caching comprising user AAt block alliance's block chain is written, due to that can decrypt encrypted resume number in multiple information packages including structured messageAccording to private key by user keeping so that other nodes can not directly share to the history data of the user, it is possible thereby toIt prevents the history data of user from illegally being inquired, being distorted, and then can fully ensure that the privacy and peace of the history data of userQuan Xing.
In addition, another embodiment of the present invention also provides a kind of history data processing system, comprising:
One or more processors；
Storage device, for storing one or more programs；
When one or more of programs are executed by one or more of processors, so that one or more of processingDevice realizes the history data processing method as described in above-described embodiment is any.
In addition, another embodiment of the present invention also provides a kind of computer readable storage medium, it is stored with computer program,The history data processing method as described in above-described embodiment is any is realized when the program is executed by processor.
All the above alternatives can form alternative embodiment of the invention using any combination, herein no longerIt repeats one by one.
It should be understood that history data processing system provided by the above embodiment is executing history data processing methodWhen, only the example of the division of the above functional modules, in practical application, it can according to need and divide above-mentioned functionWith being completed by different functional modules, i.e., the internal structure of device is divided into different functional modules, to complete above descriptionAll or part of function.In addition, above-mentioned history data processing system belong to history data processing method embodiment it is sameDesign, specific implementation process are detailed in embodiment of the method, and which is not described herein again.
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardwareIt completes, associated hardware can also be instructed to complete by program, the program can store can in a kind of computerIt reads in storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all in spirit of the invention andWithin principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.