CN110569240B - Data storage method and device, computer equipment and storage medium - Google Patents
Data storage method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN110569240B CN110569240B CN201910677577.9A CN201910677577A CN110569240B CN 110569240 B CN110569240 B CN 110569240B CN 201910677577 A CN201910677577 A CN 201910677577A CN 110569240 B CN110569240 B CN 110569240B
- Authority
- CN
- China
- Prior art keywords
- block
- current
- current block
- deleted
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Probability & Statistics with Applications (AREA)
- Fuzzy Systems (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present application relates to block data storage in block chain storage, and in particular, to a data storage method, apparatus, computer device, and storage medium. The method comprises the following steps: storing the data to be recorded to a current block, wherein the current block comprises current block generation time and a current identification value corresponding to the current block; inquiring a target ending block associated with the current block, and extracting a current block chain according to the target ending block; acquiring a block connection time range corresponding to a current block chain, and inquiring whether the current block generation time is within the block connection time range; when the current block generation time is not in the block connection time range, acquiring a to-be-queried identification value contained in the current block and corresponding to a target ending block; changing the mark value to be inquired into a pre-stored target value, and calculating a target mark value corresponding to the current block according to the target value and the data to be recorded; and changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block. The method can reduce the storage cost.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a data storage method and apparatus, a computer device, and a storage medium.
Background
With the development of computer technology, more and more services can be handled through a computer, and in order to ensure transparency and incapability of tampering of corresponding service data, more and more service data are stored and interacted through a block chain.
Conventionally, all data are stored sequentially in a conventional blockchain storage manner, and since the amount of data involved is large, the processing speed of sequential storage on different node servers is high, and therefore, in order to ensure storage efficiency, the node servers need to be continuously upgraded, and the data storage cost is high.
Disclosure of Invention
In view of the above, it is necessary to provide a data storage method, an apparatus, a computer device, and a storage medium capable of reducing storage cost.
A method of data storage, the method comprising:
storing data to be recorded to a current block, wherein the current block comprises block generation time and a current identification value corresponding to the current block;
inquiring a target ending block associated with the current block, and extracting a current block chain according to the target ending block;
acquiring a block connection time range corresponding to a current block chain, and inquiring whether the current block generation time is within the block connection time range;
when the current block generation time is not in the block connection time range, acquiring a to-be-queried identification value contained in the current block and corresponding to a target ending block;
changing the identification value to be inquired into a pre-stored target value, and calculating a target identification value corresponding to the current block according to the target value and the data to be recorded;
and changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block.
In one embodiment, after changing the current identification value to the target identification value so that the current block is the initial block and generating the updated block chain according to the initial block, the method includes:
extracting block chain generation time corresponding to different block chains, and acquiring current system time;
calculating data storage duration according to the block chain generation time and the current system time;
and when the data storage duration exceeds the preset duration, inquiring a block to be deleted corresponding to the data storage duration exceeding the preset duration, and deleting the block to be deleted.
In one embodiment, querying a to-be-deleted block corresponding to a data storage duration exceeding a preset duration, and deleting the to-be-deleted block includes:
inquiring an initial block to be deleted corresponding to the data storage time length exceeding the preset time length, and inquiring an associated block to be deleted connected with the initial block to be deleted;
and deleting the initial block to be deleted and the associated block to be deleted.
In one embodiment, after querying the associated block to be deleted connected to the initial block to be deleted, the method includes:
acquiring first generation time contained in the associated block to be deleted, and acquiring second generation time contained in the initial block to be deleted;
judging whether the difference value between the first generation time and the second generation time is within a preset difference value range or not;
and when the difference value is not within the preset difference value range, outputting the checking information.
In one embodiment, after acquiring a block connection time range corresponding to a current block chain and querying whether a current block generation time is within the block connection time range, the method includes:
when the current block generation time is within the block connection time range, acquiring a target ending block in the current block chain corresponding to the current block connection time range;
and connecting the current block with the target end block.
In one embodiment, concatenating the current chunk with the target end chunk includes:
sending the current block to an endorsement node for verification;
receiving a verification result of the endorsement node verifying the current block;
and when the verification result is that the verification is passed, connecting the current block with the end block.
A data storage device, the device comprising:
the current block receiving module is used for storing the data to be recorded to a current block, and the current block comprises current block generation time and a current identification value corresponding to the current block;
the extracting module is used for inquiring a target ending block associated with the current block and extracting a current block chain according to the target ending block;
the first acquisition module is used for acquiring a block connection time range corresponding to the current block chain and inquiring whether the current block generation time is within the block connection time range;
the second obtaining module is used for obtaining the identifier value to be inquired corresponding to the target ending block contained in the current block when the current block generation time is not in the block connection time range;
the calculation module is used for changing the identification value to be inquired into a target value and calculating a target identification value corresponding to the current block according to a pre-stored target value and data to be recorded;
and the changing module is used for changing the current identification value into the target identification value, enabling the current block to be used as an initial block, and generating an updating block chain according to the initial block.
In one embodiment, the data storage device further comprises:
the extraction module is used for extracting block chain generation time corresponding to different block chains and acquiring current system time;
the time length calculating module is used for calculating the data storage time length according to the block chain generating time and the current system time;
and the deleting module is used for inquiring the block to be deleted corresponding to the data storage time length exceeding the preset time length and deleting the block to be deleted when the data storage time length exceeds the preset time length.
A computer device comprising a memory and a processor, the memory storing a computer program, the processor implementing the following steps when executing the computer program:
storing data to be recorded to a current block, wherein the current block comprises block generation time and a current identification value corresponding to the current block;
inquiring a target ending block associated with the current block, and extracting a current block chain according to the target ending block;
acquiring a block connection time range corresponding to a current block chain, and inquiring whether the current block generation time is within the block connection time range;
when the current block generation time is not in the block connection time range, acquiring a to-be-queried identification value contained in the current block and corresponding to a target ending block;
changing the identification value to be inquired into a pre-stored target value, and calculating a target identification value corresponding to the current block according to the target value and the data to be recorded;
and changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
storing data to be recorded to a current block, wherein the current block comprises block generation time and a current identification value corresponding to the current block;
querying a target ending block associated with the current block, and extracting a current block chain according to the target ending block;
acquiring a block connection time range corresponding to a current block chain, and inquiring whether the current block generation time is within the block connection time range;
when the current block generation time is not in the block connection time range, acquiring a to-be-queried identification value contained in the current block and corresponding to a target ending block;
changing the identification value to be inquired into a pre-stored target value, and calculating a target identification value corresponding to the current block according to the target value and the data to be recorded;
and changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block.
According to the data storage method, the data storage device, the computer equipment and the storage medium, all data are not sequentially stored in the same block chain, namely the data to be recorded are stored in the current block, the block connection time corresponding to the current block chain is obtained, the target ending block related to the current block is inquired by the recording node, the current block chain is extracted according to the target ending block, the recording node compares the current block generation time contained in the current block with the block connection time corresponding to the current block chain, when the current block generation time exceeds the block connection time, the identification value to be inquired corresponding to the target ending block contained in the current block is extracted, the identification value to be inquired is changed into a target value, the target identification value is generated according to the target value and the data to be recorded, the current identification value is changed into the target identification value, the current block is used as the initial block, the block chain can be updated according to the initial block, the single-chain storage is not required to be continuously updated, and the cost is reduced.
Drawings
FIG. 1 is a diagram illustrating an exemplary implementation of a data storage method;
FIG. 2 is a schematic flow chart diagram illustrating a data storage method according to one embodiment;
FIG. 3 is a flowchart illustrating a block deletion step according to an embodiment;
FIG. 4 is a block diagram of a data storage device in one embodiment;
FIG. 5 is a diagram of the internal structure of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The data storage method provided by the application can be applied to the application environment shown in fig. 1. The block chain system 100 includes different nodes, which may include a recording node 102, an endorsement node 104, and the like, the block chain system 100 stores data to be recorded to a current block through the recording node 102 included therein, the current block includes a current block generation time and a current identification value corresponding to the current block, further obtains a block connection time corresponding to the current block chain through the recording node 102, compares the current block generation time with the block connection time, when the current block generation time exceeds the block connection time, the recording node 102 extracts an identification value to be queried, which is included in the current block and corresponds to a target end block of the current block, the recording node 102 changes the identification value to be queried to a pre-stored target value, further the recording node 102 calculates a target identification value corresponding to the current block according to the target value and the data to be recorded, changes the current identification value to the target identification value, makes the current block serve as an initial block, and generates an updated block chain according to the initial block, wherein the recording node 102 and the endorsement node 104 may use an independent server, and the block chain system 100 may be a distributed storage system including different nodes, and may connect blocks generated by different nodes to form a chain of blocks.
In one embodiment, as shown in fig. 2, a data storage method is provided, which is described by taking the method as an example applied to the recording node 102 in fig. 1, and includes the following steps:
s202: and storing the data to be recorded to a current block, wherein the current block comprises block generation time and a current identification value corresponding to the current block.
Specifically, the data to be recorded refers to data that needs to be stored in a block chain, so as to avoid data tampering, and the data to be recorded may be corresponding service data, transaction data, insurance data, or environmental data. The block generation time refers to a specific time of generating a block included in the recording node generated block, that is, different blocks may be sequentially connected according to the specific time to generate a block chain. The current identification value is an identification value calculated for the stored data and the information of the blocks to be connected with each other according to the corresponding encryption algorithm in the current block, and may be a current hash value corresponding to the current block calculated by the recording node according to the hash algorithm and the data to be recorded and the hash value of the block to be connected, where the block to be connected may be an end block of different block chains stored in the block chain system.
Specifically, when a recording node in the block chain system receives a block generation instruction, the current system time is queried according to the block generation, and then the recording node queries end blocks in all stored block chains as blocks to be connected, and then the recording node can extract the block generation time to be connected from different blocks to be connected, and then the recording node calculates a difference value according to the block generation time to be connected and the instruction receiving time of the received block generation instruction, selects the block to be connected with the minimum difference value as a target end block, and then the recording node can query detailed data contained in the target end block first, and calculates an end hash value of the target end block, and according to the end hash value and data to be recorded, the recording node calculates a current identification value corresponding to the current block by using a hash algorithm, and when the recording node stores the data to be recorded to the current block and calculates the current identification value, the current system time can be recorded as the block generation time at the same time, so that the recording node in the block chain system stores the data to be recorded to the current block, and the current block generation time and the current corresponding current identification value. . The record node is a node that is included in the blockchain system and can record data, and may be a node that is included in the blockchain system and generates different blocks, so that the generated blocks are sent to the endorsement node for endorsement, that is, to the endorsement node for verification.
S204: a target end block associated with the current block is queried and a current block chain is extracted based on the target end block.
Specifically, the target end block is a block selected from end blocks included in different stored block chains, and the difference between the generation time and the current system time when the block generation instruction is received is the smallest. The current blockchain refers to a blockchain stored in different nodes in the blockchain system, and whether the current block is connected with the end block is inquired according to the block connection time range.
Specifically, the recording node in the block chain system queries the selected target end block as a target end block associated with the current block according to the received block generation command time, and further uses the block chain including the target end block as the current block chain. The recording node in the block chain system may extract an ending block from all stored block chains to serve as a to-be-connected block, and then the recording node calculates a difference value according to different to-be-connected block generation times and instruction receiving times, and selects the to-be-connected block with the smallest difference value as a target ending block, so that the recording node queries the target ending block associated with the currently associated block, and then the recording node takes the block chain including the target ending block as a current block chain. Or, the recording node in the block chain system is selected from
S206: and acquiring a block connection time range corresponding to the current block chain, and inquiring whether the current block generation time is in the block connection time range.
Specifically, the block connection time range refers to a time range of blocks stored in the current blockchain, that is, only when the current block generation time is in the time range, the current block can be connected with the target end block in the current blockchain. . Specifically, a recording node in the block chain system acquires a block connection time range corresponding to the current block chain, and then queries whether the current block generation time is within the block connection time range or not, based on the current block generation time of the current block obtained by storing the data to be recorded by the recording node.
The recording node in the block chain system may acquire an initial block included in the current block chain, query the initial block generation time of the initial block, extract, by the recording node, year information according to the initial block generation time, obtain, according to the year information, a block connection time range of the current block chain, and further query, by the recording node, whether the current block generation time is within the block connection time range. For example, the recording node queries an initial block included in the current block chain, and then extracts the initial block generation time of the initial block, and the recording node extracts year information from the initial block generation time, where the year information is the block connection time range, that is, the year information extracted from the initial block generation time corresponding to the initial block by the recording node is 2018, and then the block connection time range of the current block chain acquired by the recording node is 2018, 1 month to 2018, 12 months, and then the recording node in the block chain system queries whether the current block generation time is within the block connection time range of the current block chain.
S208: and when the current block generation time is not in the block connection time range, extracting the identifier value to be inquired corresponding to the target end block contained in the current block.
Specifically, the identifier value to be queried is an end block hash value corresponding to the end block, that is, an end block hash value generated by recording a recording node of the end block according to a corresponding encryption algorithm. Specifically, when the recording node in the block chain system queries that the current block generation time is not in the block connection time range, the recording node queries the identifier value to be queried, which is included in the current block and corresponds to the target end block of the current block chain.
For example, when the recording node in the blockchain system queries that the block generation time is not within the block connection time range, the current block needs to be used as an initial block, that is, the block needs to be stored in a new blockchain, the recording node in the blockchain system queries a field to be queried, which is included in the current block and corresponds to the target end block of the current blockchain, and the recording node in the blockchain system queries a hash value corresponding to the field to be queried as a to-be-queried identification value. For example, when the record node in the blockchain system queries that the block generation time is not within the block connection time range, the record node queries a field to be queried in the current block, which corresponds to the target end block of the current blockchain, that is, the query in the current block indicates that the identifier of the hash value of the target end block, such as "pre-hash", can be found, and then the blockchain system queries a corresponding hash value, which is also the identifier value to be queried, through the field to be queried.
S210: and changing the identifier value to be inquired into a pre-stored target value, and calculating the target identifier value corresponding to the current block according to the target value and the data to be recorded.
Specifically, the target value refers to a preset value of an end tile hash value contained in the current tile as the initial tile when the current tile is the initial tile, and the target value is a preset value pre-stored in a different node. The target identification value is the hash value of the current block obtained by recalculating when the hash value of the ending block is changed in the current block. Specifically, when the recording node in the blockchain system queries that the block generation time of the current block is not within the block connection time range corresponding to the current blockchain, the current block does not need to be connected to the ending blockchain of the current blockchain, that is, the current block needs to be used as an initial block, that is, the recording node in the blockchain system queries the identifier value to be queried in the current block, and further queries the target value corresponding to the initial block, which is prestored in the recording node, changes the identifier value to be queried to the target value, and further the recording node can directly calculate the hash value corresponding to the current block according to the modified target value and the data to be recorded according to an encryption algorithm, and use the hash value as the target identifier value.
For example, when a recording node in the blockchain system queries that the block generation time of the current block is 2019 year 1 month, and the block connection time range is 2018 year 1 month to 2018 year 12 month, if the block generation time of the current block is not within the block connection range, the current block is used as an initial block, a new blockchain is generated, and the block generation time of the block in the new blockchain is 2019 year 1 month to 2019 year 12 months, so that the current block is used as the initial block, the hash value of the target end block included in the current block is changed according to a pre-stored target value, if the target value is 0, the hash value of the target end block is changed to 0, and the recording node in the blockchain system may adopt a hash algorithm, such as SHA-256 algorithm (secure hash algorithm), to obtain the hash value of the current block as the initial block, and use the hash value as the target identification value. It should be noted that the hash algorithm may also use other algorithms, such as SHA-512, SHA-224 algorithm in the secure hash algorithm, or MD algorithm.
S212: and changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block.
In particular, updating a blockchain refers to a new blockchain that has a different blockchain connection time than a different blockchain stored in the blockchain system. When the recording node changes the current identification value to the target identification value, the current block is used as an initial block, the recording node in the block chain system changes the current identification value contained in the current block to the target identification value, the current block is used as the initial block, and then according to the generation time of the initial block, when the update block connection time range corresponding to the update block chain is obtained, when the block chain system generates a new block through the recording node, the new block chain can be generated by connecting the update block with the initial block according to the generation time of the new block.
In this embodiment, in the process of storing data, not the mode that all data are connected into a single block chain according to the traditional block chain in a unified manner, when the data volume is too large, the processing efficiency is low, the processing efficiency can be improved, and the hardware product needs to be upgraded in order to improve the processing efficiency, the cost is saved, in addition, because the data to be recorded can relate to different service data, such as environmental data, the environmental data is used for environment monitoring, and storing according to the traditional single chain mode causes that a large amount of data which need not be used can not be deleted, so that the applicability is not strong, and storing according to the block connection time can enhance the applicability.
In an embodiment, referring to fig. 3, a flow chart of a block deleting step is provided, where the block deleting step, namely changing the current identification value to the target identification value, makes the current block as an initial block, and generates an update block chain according to the initial block, includes: extracting block chain generation time corresponding to different block chains, and acquiring current system time; calculating data storage duration according to the block chain generation time and the current system time; and when the data storage duration exceeds the preset duration, inquiring a block to be deleted corresponding to the data storage duration exceeding the preset duration, and deleting the block to be deleted.
Specifically, the blockchain generation time refers to the generation time of different blockchains stored in the blockchain system, and may be a detailed year time or the like. The data storage duration is the duration of time that different block chains are stored in the block chain system. The to-be-deleted block refers to a different block included in the block chain when the data storage duration exceeds the preset time.
Specifically, different block chains stored in different nodes in a block chain system correspond to block connection time ranges, block chain generation time represented by the block connection time ranges is extracted, recording nodes in the block chain system acquire the stored block chain generation time of the different block chains and acquire current system time, then difference values between the block chain generation time of the different block chains and the current system time are respectively calculated, the difference value is data storage duration, then the recording nodes in the block chain system acquire pre-stored preset duration and compare the data storage duration with the preset duration, a block chain with the data storage duration exceeding the preset duration is selected, blocks included in the block chain are used as blocks to be deleted, and the inquired blocks to be deleted are deleted.
If the block link time ranges corresponding to four block chains are obtained, the block link time ranges are 2015 year 1 month to 2015 year 12 months, 2016 year 1 month to 2016 year 12 months, 2017 year 1 month to 2017 year 12 months and 20181 month to 2018 year 12 months respectively, and then according to the block link time ranges, block chain generation time corresponding to each block chain is extracted, block chain generation time can be obtained according to year information contained in the block link time ranges, for example, the block chain generation time is 2015 years, 2016 years, 2017 years and 2018 years respectively, then the recording node in the block chain system obtains current system time as 2019 years, the recording node in the block chain system calculates data storage time according to the different block chain generation time and the current system time, the data storage time of the block chains is 4 years, 3 years, 2 years and 1 year respectively, a preset recording node in the block chain system obtains a preset recording node, then compares the preset recording node in the block chain system with the current system time, and deletes the data storage time of the block to be deleted, and the block to be deleted is preset. In this embodiment, different nodes in the blockchain system may store blockchains of different times, and the preset duration may be set according to different application scenarios.
In this embodiment, the recording node in the block chain system stores different block chains according to the corresponding storage time, the recording node in the block chain system may calculate the data storage duration according to the block chain generation time and the current system time, and when the data storage duration exceeds the preset duration, the block to be deleted, to which the data storage duration exceeds the preset duration, is queried, and the block to be deleted is deleted, that is, the space resource may be stored.
In an embodiment, with reference to fig. 3, querying a to-be-deleted block corresponding to a data storage duration exceeding a preset duration, and deleting the to-be-deleted block includes: inquiring an initial block to be deleted corresponding to the data storage time length exceeding the preset time length, and inquiring an associated block to be deleted connected with the initial block to be deleted; (ii) a And deleting the initial block to be deleted and the associated block to be deleted.
Specifically, the initial block to be deleted refers to an initial block in a block chain corresponding to a data storage duration exceeding a preset duration. The associated blocks to be deleted refer to different blocks which are sequentially connected with the initial block in a block chain corresponding to the data storage time length exceeding the preset time length. Specifically, when a recording node in a block chain system inquires that data storage time corresponding to different block chains for storage exceeds preset time, inquiring a block chain to be deleted corresponding to the data storage time exceeding the preset time, further inquiring an initial block to be deleted contained in the block chain to be deleted, further inquiring other blocks connected with the initial block to be deleted according to the initial block to be deleted, wherein the other connected blocks are associated blocks to be deleted, further taking the initial block to be deleted and the associated blocks to be deleted as blocks to be deleted, and deleting the blocks to be deleted.
When a recording node in the block chain system queries that the data storage duration corresponding to different stored block chains exceeds a preset duration, querying a block chain to be deleted corresponding to the data storage duration exceeding the preset duration, further querying a field to be queried contained in the block chain to be deleted, further querying a block of which an identification value to be queried corresponding to the field to be queried is a target value as an initial block to be deleted, further querying a target identification value corresponding to the initial block to be queried, querying a next block according to the target identification value until a tail block contained in the block chain to be deleted is queried, sequentially querying all blocks according to the target identification values as associated blocks to be deleted, and further deleting the initial block to be deleted and the associated blocks to be deleted.
For example, when a recording node in a block chain system queries that the data storage duration corresponding to different stored block chains exceeds a preset duration, querying a to-be-deleted block chain corresponding to the data storage duration exceeding the preset duration, querying a query field of a previous block included in each block in the to-be-deleted block chain, and further querying the to-be-queried field, if a pre-hash is queried, further querying a hash value corresponding to the to-be-queried field, when a block of which the hash value corresponding to the field is 0 is queried as an initial block to be deleted, further querying the hash value of a current block corresponding to the initial block to be deleted by the recording node in the block chain system, further querying hash values of other blocks in the to-be-deleted block chain including the current block as a next block until a tail block of the to-be-deleted block chain is queried, thereby regarding an associated block queried according to the hash value corresponding to the initial block to be deleted as an associated block to be deleted, and deleting both the initial block to be deleted and the associated block to be deleted.
In this embodiment, the recording node in the blockchain system may delete the blockchain whose data storage duration exceeds the preset duration, thereby avoiding the need to expand the storage resource and continuously upgrade the hardware product, and reducing the cost.
In one embodiment, with continued reference to fig. 3, after querying the to-be-deleted associated block connected to the to-be-deleted initial block, the method includes: acquiring first generation time contained in the associated block to be deleted, and acquiring second generation time contained in the initial block to be deleted; judging whether the difference value between the first generation time and the second generation time is within a preset difference value range or not; and when the difference value is not within the preset difference value range, outputting the checking information.
Specifically, the first generation time refers to the generation time of a block included in the associated block to be deleted. The second generation time is a generation time of a block included in the initial block to be deleted. When a recording node in the block chain system inquires an associated block to be deleted, whether the block is the block to be deleted needs to be verified again, when the recording node in the block chain system inquires the associated block to be deleted, first generation time contained in the associated block to be deleted is obtained, second generation time contained in an initial block to be deleted is further obtained, a difference value between the first generation time and the second generation time is calculated, when the difference value is obtained, whether the difference value is within a preset difference value range is inquired, when the difference value is within the preset difference value range, the associated block to be deleted and the initial block to be deleted can be jointly used as the block to be deleted, when the difference value is not within the preset difference value range, corresponding checking information is output, whether an error block is inquired or not is inquired, and the like.
For example, if the preset time range may be within 1 year, acquiring a first generation time included in the associated block to be deleted, acquiring a second generation time included in the initial block to be deleted, calculating a difference between the first generation time and the second generation time, and querying whether the difference is within the preset time range, if the difference is within the preset time range, the associated block to be deleted and the initial block to be deleted may be deleted together as the block to be deleted, if the difference is not within the preset time range, outputting corresponding checking information, where the checking information may output a block identification value of the associated block to be deleted and the like within the preset time range, and querying whether an erroneous block or the like is queried.
In addition, when a recording node in a block chain system inquires about an initial block to be deleted and an associated block to be deleted, acquiring first generation time corresponding to the associated block to be deleted, acquiring second generation time of the initial block to be deleted, respectively calculating to obtain associated block storage time according to the first generation time and the current system time, inquiring whether the associated block storage time exceeds a preset time, further calculating to obtain initial block storage time according to the second generation time and the current system time, and inquiring whether the initial block storage time exceeds the preset time, further calculating a difference value between the first generation time and the second generation time when both the associated block storage time and the initial block storage time exceed the preset time, and directly outputting checking information, such as outputting corresponding block identification and the like when any one of the associated block storage time and the initial block storage time exceeds the preset time.
In this embodiment, when the recording node in the blockchain system selects the initial block to be deleted and the associated block to be deleted, the verification may be further performed, so as to ensure the accuracy of deleting the blockchain.
In one embodiment, after acquiring a block connection time range corresponding to a current block chain and querying whether a block generation time is within the current block connection time range, the method includes: when the current block generation time is within the block connection time range, acquiring a target ending block in the current block chain corresponding to the current block connection time range; and connecting the current block with the target end block.
In one embodiment, concatenating the current chunk with the target end chunk includes: sending the current block to an endorsement node for verification; receiving a verification result of the endorsement node verifying the current block; and when the verification result is that the verification is passed, connecting the current block with the target end block.
In one embodiment, after acquiring a block connection time range corresponding to a current block chain and querying whether a current block generation time is within the block connection time range, the method includes: when the current block generation time is within the block connection time range, acquiring a target end block in the current block chain corresponding to the current block connection time range: sending the current block to an endorsement node for verification through a recording node; receiving a verification result of the endorsement node for verifying the current block through the recording node; and when the verification result is that the verification is passed, connecting the current block with the target end block.
Specifically, the endorsement node is a node server included in the block chain system and capable of verifying and signing the generated block, and when the generated block is subjected to an endorsement operation by the endorsement node, the block may be connected with a tail block in the block chain to be connected, that is, the current block enters the chain.
Specifically, when the recording node in the block chain system inquires that the block generation time is within the block connection time range, the current block can be directly connected to the current block chain. The method comprises the steps that a recording node in a block chain system obtains a target ending block in a current block chain, the recording node generates a current block according to data to be recorded and an identifier to be inquired, the current block comprises a current identifier value, current block generation time, data to be recorded and the like, the current block generation time is inquired within a block connection time range, the recording node sends the generated current block to an endorsement node, when the endorsement node receives the current block, the identity of the recording node is obtained through the endorsement node, whether the identity is a credible identity is inquired, namely, the identity can be matched with a pre-stored credible identity, when the matching is successful, the identity of the recording node is a credible identity, corresponding data verification logic to be recorded is obtained through the endorsement node, if the inquiry data comprise false data and the like, the data to be verified through the verification logic to be recorded, the data to be recorded is further verified through the verification logic to be further, a verification result is generated according to the identity of the recording node and the data to be recorded, when the identity of the recording node and the data to be recorded pass verification, the verification result is verified, the current ending block is connected with the target ending block as the current block, and the current block is pointed to the target ending block when the verification of the block.
In this embodiment, when the block generation time is within the block connection time range, the current block may be connected to the end block, and the current block needs to be verified by an endorsement node before connection, so as to ensure accuracy and security of the generated block.
In an embodiment, the storage of the environmental protection data is described as an example below, where, for the block chain system, different node servers may be included, for example, a server corresponding to the recording node, the server corresponding to the recording node may be formed by servers of different environmental protection institutions and a server corresponding to an enterprise monitoring the environmental data, that is, may be a recording node of the environmental protection institution and a recording node of the enterprise, corresponding data may be environmental data of the monitored enterprise, and in addition, the block chain system may further include a server corresponding to an endorsement node, and performs endorsement on the environmental data of the monitored enterprise.
Specifically, further described by taking the example of recording and detecting the corresponding environmental data by the enterprise recording node, the enterprise recording node generates the current block according to the environmental data, the current block may include a block generation time, a hash value of an end block to be connected, and a hash value of the current block, and then the enterprise recording node included in the block chain system queries a block connection time range corresponding to the current block chain, if the block connection time range is from 2018 to 2018, 12 months, that is, the current block generation time is connected only within the time range, and when the enterprise recording node queries that the current block generation time is 2019, 1 month, 1 day, the block generation time is not within the block connection time range, the current block needs to be stored in a new block chain, so that the hash value of the end block in the current block is modified to 0, thereby recalculating the hash value of the current block, using the current block as the initial block, generating an updated block chain, and the updated block connection time range should be 2019 to 2019, 1 month to 20112 months.
When an update block chain is generated, the enterprise recording node may query block chains in which different environmental protection times are stored, that is, query different block chain generation times, where the block chain generation time may be determined according to a year in a block connection time range, and then calculate a data storage time according to a current system time and the block chain generation time, and then delete the whole block chain in which the data storage time exceeds a preset time, such as deleting the whole block chain in which the data storage time exceeds 3 years, that is, because of real-time property of environmental protection data, reference value of the environmental protection data exceeding 3 years is low, when a block chain system deletes the corresponding block chain, the corresponding initial block to be deleted may be queried first, and then the associated block to be deleted may be queried, and it may be verified whether a difference between the associated block to be deleted and the initial block to be deleted is within a preset time range, for example, whether the difference is within a year corresponding to the block chain generation time, and when the year corresponding to the block chain generation time is within the year corresponding to be deleted, the associated block to be deleted and the initial block to be deleted may be deleted as the block to be deleted.
In addition, for example, when the block generation time of the current block queried by the enterprise recording node is 2018, 3 months, and the block generation time is within the block connection time range, the block may be directly connected to a target ending block in a block chain whose block connection time range is 2018, 1 month, to 2018, 12 months, and before connection, the enterprise recording node may verify the current block through an endorsement node, for example, verify whether the environmental protection data included therein is counterfeit, such as data with a repeat date of the environmental protection data, and further verify whether the identity of the recording node is a reliable and real identity, and when the verification is passed, the current block may be connected to the ending block. It should be noted that the data in this embodiment may also be service data of other services to be processed, and the like.
It should be understood that although the various steps in the flow diagrams of fig. 2-3 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2-3 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or stages is not necessarily sequential, but may be performed alternately or alternatingly with other steps or at least some of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 4, there is provided a data storage device comprising: a current block receiving module 410, an extracting module 420, a first obtaining module 430, a second obtaining module 440, a calculating module 450, and a changing module 460, wherein:
the current block receiving module 410 is configured to store data to be recorded to a current block, where the current block includes a current block generation time and a current identifier corresponding to the current block.
The extracting module 420 is configured to query a target end block associated with the current block, and extract the current block chain according to the target end block.
The first obtaining module 430 is configured to obtain a block connection time range corresponding to the current block chain, and query whether the current block generation time is within the block connection time range.
The second obtaining module 440 is configured to, when the current block generation time is not within the block connection time range, obtain an identifier value to be queried corresponding to a target end block included in the current block.
The calculating module 450 is configured to change the identifier value to be queried into a pre-stored target value, and calculate a target identifier value corresponding to the current block according to the target value and the data to be recorded.
A changing module 460, configured to change the current identification value to the target identification value, so that the current block is used as the initial block, and generate an updated block chain according to the initial block.
In one embodiment, the data storage device 400 may further include:
and the extraction module is used for extracting block chain generation time corresponding to different block chains and acquiring the current system time.
And the time length calculating module is used for calculating the data storage time length according to the block chain generating time and the current system time.
And the deleting module is used for inquiring the block to be deleted corresponding to the data storage time length exceeding the preset time length and deleting the block to be deleted when the data storage time length exceeds the preset time length.
In one embodiment, a deletion module includes:
and the query unit is used for querying the initial block to be deleted corresponding to the data storage time length exceeding the preset time length and querying the associated block to be deleted connected with the initial block to be deleted.
And the deleting unit is used for deleting the initial block to be deleted and the associated block to be deleted.
In one embodiment, the deleting unit may include:
and the time acquisition subunit is used for acquiring the first generation time contained in the associated block to be deleted and acquiring the second generation time contained in the initial block to be deleted.
And the judging subunit is used for judging whether the difference value between the first generation time and the second generation time is within a preset difference value range.
And the output subunit is used for outputting the checking information when the difference value is not within the preset difference value range.
In one embodiment, the data storage device 400 may further include:
and the ending block acquiring module is used for acquiring a target ending block in the current block chain corresponding to the current block connection time range when the current block generation time is within the block connection time range.
And the connecting module is used for connecting the current block with the target ending block.
In one embodiment, the connection module may include:
and the verification result receiving unit is used for sending the current block to the endorsement node for verification. And the verification module is also used for receiving a verification result of the endorsement node verifying the current block.
And the connecting unit is used for connecting the current block with the target end block when the verification result is that the verification is passed.
For specific limitations of the data storage device, reference may be made to the above limitations of the data storage method, which are not described herein again. The various modules in the data storage device described above may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 5. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operating system and the computer program to run on the non-volatile storage medium. The database of the computer device is used for storing data. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a data storage method.
Those skilled in the art will appreciate that the architecture shown in fig. 5 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, there is provided a computer device comprising a memory storing a computer program and a processor implementing the following steps when the processor executes the computer program: and storing the data to be recorded to the current block, wherein the current block comprises the current block generation time and a current identification value corresponding to the current block. And querying a target ending block associated with the current block, and extracting the current block chain according to the target ending block. And acquiring a block connection time range corresponding to the current block chain, and inquiring whether the current block generation time is within the block connection time range. And when the current block generation time is not in the block connection time range, acquiring the identifier value to be inquired, which is contained in the current block and corresponds to the target ending block. And changing the identification value to be inquired into a target value, and calculating a target identification value corresponding to the current block according to the target value and the data to be recorded. And changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block. . In one embodiment, after the processor executes the computer program to change the current identification value to the target identification value so that the current block is the initial block and generate the updated block chain according to the initial block, the method includes: and extracting block chain generation time corresponding to different block chains, and acquiring the current system time. And calculating the data storage duration according to the block chain generation time and the current system time. And when the data storage duration exceeds the preset duration, inquiring a block to be deleted corresponding to the data storage duration exceeding the preset duration, and deleting the block to be deleted.
In one embodiment, when executing the computer program, the processor queries a to-be-deleted block corresponding to a data storage duration exceeding a preset duration, and deletes the to-be-deleted block, including: and inquiring the initial block to be deleted corresponding to the data storage time length exceeding the preset time length, and inquiring the associated block to be deleted connected with the initial block to be deleted. And deleting the initial block to be deleted and the associated block to be deleted.
In one embodiment, the processor, when executing the computer program, after querying the associated block to be deleted that is connected to the initial block to be deleted, includes: and acquiring first generation time contained in the associated block to be deleted, and acquiring second generation time contained in the initial block to be deleted. And judging whether the difference value between the first generation time and the second generation time is within a preset difference value range. And when the difference value is not within the preset difference value range, outputting the checking information.
In one embodiment, after the processor executes the computer program to obtain a block connection time range corresponding to the current block chain and query whether the current block generation time is within the block connection time range, the method includes: and when the current block generation time is within the block connection time range, acquiring a target ending block in the current block chain corresponding to the current block connection time range. And connecting the current block with the target end block.
In one embodiment, the processor, when executing the computer program, performs concatenating the current chunk with the target end chunk, including: and sending the current block to the endorsement node for verification. And receiving a verification result of the endorsement node verifying the current block. And when the verification result is that the verification is passed, connecting the current block with the target end block.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of: and storing the data to be recorded to the current block, wherein the current block comprises the current block generation time and the current identification value corresponding to the current block. And querying a target ending block associated with the current block, and extracting the current block chain according to the target ending block. And acquiring a block connection time range corresponding to the current block chain, and inquiring whether the current block generation time is within the block connection time range. And when the current block generation time is not in the block connection time range, acquiring the identifier value to be inquired, which is contained in the current block and corresponds to the target ending block. And changing the identifier value to be inquired into a pre-stored target value, and calculating the target identifier value corresponding to the current block according to the target value and the data to be recorded. And changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block.
In one embodiment, the computer program when executed by the processor, after modifying the current identification value to the target identification value such that the current block is the initial block and generating the updated block chain from the initial block, comprises: and extracting block chain generation time corresponding to different block chains, and acquiring the current system time. And calculating the data storage duration according to the block chain generation time and the current system time. And when the data storage duration exceeds the preset duration, inquiring a block to be deleted corresponding to the data storage duration exceeding the preset duration, and deleting the block to be deleted.
In one embodiment, when executed by a processor, a computer program queries a to-be-deleted block corresponding to a data storage duration exceeding a preset duration, and deletes the to-be-deleted block, including: and inquiring the initial block to be deleted corresponding to the data storage time length exceeding the preset time length, and inquiring the associated block to be deleted connected with the initial block to be deleted. And deleting the initial block to be deleted and the associated block to be deleted.
In one embodiment, the computer program, when executed by the processor, for after querying the associated block to be deleted that is connected to the initial block to be deleted, includes: and acquiring first generation time contained in the associated block to be deleted, and acquiring second generation time contained in the initial block to be deleted. And judging whether the difference value between the first generation time and the second generation time is within a preset difference value range. And when the difference value is not within the preset difference value range, outputting the checking information.
In one embodiment, the computer program, when executed by the processor, implements obtaining a block connection time range corresponding to the current block chain, and querying whether the current block generation time is within the block connection time range, including: when the current block generation time is within the block connection time range, the target end block in the current block chain corresponding to the current block connection time range is obtained. And connecting the current block with the target end block.
In one embodiment, the computer program when executed by the processor implements concatenating the current chunk with the ending chunk, comprising: and sending the current block to the endorsement node for verification. And receiving a verification result of the endorsement node verifying the current block. And when the verification result is that the verification is passed, connecting the current block with the target end block.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), rambus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
All possible combinations of the technical features in the above embodiments may not be described for the sake of brevity, but should be considered as being within the scope of the present disclosure as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method of data storage, the method comprising:
storing data to be recorded to a current block, wherein the current block comprises current block generation time and a current identification value corresponding to the current block;
inquiring a target ending block associated with the current block, and extracting a current block chain according to the target ending block;
acquiring a block connection time range corresponding to the current block chain, and inquiring whether the current block generation time is within the block connection time range;
when the current block generation time is not in the block connection time range, acquiring an identifier value to be queried, which is contained in the current block and corresponds to the target end block;
changing the identification value to be inquired into a pre-stored target value, and calculating a target identification value corresponding to the current block according to the target value and the data to be recorded;
and changing the current identification value into the target identification value to enable the current block to be used as an initial block, and generating an updating block chain according to the initial block.
2. The method according to claim 1, wherein after changing the current identification value to the target identification value so that the current block is an initial block and generating an updated block chain according to the initial block, the method comprises:
extracting block chain generation time corresponding to different block chains, and acquiring current system time;
calculating data storage duration according to the block chain generation time and the current system time;
and when the data storage duration exceeds a preset duration, inquiring a block to be deleted corresponding to the data storage duration exceeding the preset duration, and deleting the block to be deleted.
3. The method according to claim 2, wherein the querying for the to-be-deleted block corresponding to the data storage duration exceeding the preset duration and deleting the to-be-deleted block comprises:
inquiring an initial block to be deleted corresponding to the data storage time length exceeding the preset time length, and inquiring an associated block to be deleted connected with the initial block to be deleted;
and deleting the initial block to be deleted and the associated block to be deleted.
4. The method according to claim 3, wherein after querying the associated block to be deleted that is connected to the initial block to be deleted, the method comprises:
acquiring first generation time contained in the associated block to be deleted, and acquiring second generation time contained in the initial block to be deleted;
judging whether the difference value of the first generation time and the second generation time is within a preset difference value range or not;
and when the difference is not within the preset difference range, outputting checking information.
5. The method of claim 1, wherein the obtaining a block connection time range corresponding to a current block chain and querying whether the current block generation time is within the block connection time range comprises:
when the current block generation time is within the block connection time range, acquiring the target ending block in the current block chain corresponding to the current block connection time range;
and connecting the current block with the target end block.
6. The method of claim 5, wherein the concatenating the current block with the target end block comprises:
sending the current block to an endorsement node for verification;
receiving a verification result of the endorsement node verifying the current block;
and when the verification result is that the verification is passed, connecting the current block with the target end block.
7. A data storage device, the device comprising:
the current block receiving module is used for storing the data to be recorded to a current block, and the current block comprises current block generation time and a current identification value corresponding to the current block;
the extracting module is used for inquiring a target ending block associated with the current block and extracting a current block chain according to the target ending block;
a first obtaining module, configured to obtain a block connection time range corresponding to the current block chain, and query whether the current block generation time is within the block connection time range;
a second obtaining module, configured to, when the current block generation time is not within the block connection time range, obtain an identifier value to be queried, which is included in the current block and corresponds to a target end block;
a calculating module, configured to change the identifier value to be queried to a pre-stored target value, and calculate a target identifier value corresponding to the current block according to the target value and the data to be recorded;
and the changing module is used for changing the current identification value into the target identification value, so that the current block is used as an initial block, and an updating block chain is generated according to the initial block.
8. The apparatus of claim 7, wherein the data storage device further comprises:
the extraction module is used for extracting block chain generation time corresponding to different block chains and acquiring current system time;
the time length calculating module is used for calculating the data storage time length according to the block chain generating time and the current system time;
and the deleting module is used for inquiring the block to be deleted corresponding to the data storage duration exceeding the preset duration and deleting the block to be deleted when the data storage duration exceeds the preset duration.
9. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor when executing the computer program performs the steps of the method according to any of claims 1 to 6.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910677577.9A CN110569240B (en) | 2019-07-25 | 2019-07-25 | Data storage method and device, computer equipment and storage medium |
| PCT/CN2020/099213 WO2021012903A1 (en) | 2019-07-25 | 2020-06-30 | Data storage method and apparatus, computer device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910677577.9A CN110569240B (en) | 2019-07-25 | 2019-07-25 | Data storage method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110569240A CN110569240A (en) | 2019-12-13 |
| CN110569240B true CN110569240B (en) | 2023-04-07 |
Family
ID=68773797
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910677577.9A Active CN110569240B (en) | 2019-07-25 | 2019-07-25 | Data storage method and device, computer equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110569240B (en) |
| WO (1) | WO2021012903A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110569240B (en) * | 2019-07-25 | 2023-04-07 | 平安科技（深圳）有限公司 | Data storage method and device, computer equipment and storage medium |
| CN111552687B (en) * | 2020-03-10 | 2023-08-04 | 远景智能国际私人投资有限公司 | Time sequence data storage method, query method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106651332A (en) * | 2016-12-29 | 2017-05-10 | 先锋支付有限公司 | Block chain and method for generating new block in block chain |
| CN109815226A (en) * | 2018-12-13 | 2019-05-28 | 平安科技（深圳）有限公司 | Date storage method, device, equipment and storage medium based on block chain |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107527285A (en) * | 2016-06-20 | 2017-12-29 | 惠众商务顾问（北京）有限公司 | The polymorphic link of community's block chain and Intelligent processing system |
| CN108985790A (en) * | 2018-06-25 | 2018-12-11 | 平安科技（深圳）有限公司 | Method for anti-counterfeit, system, computer equipment and storage medium based on block chain |
| CN109472566B (en) * | 2018-09-26 | 2023-09-29 | 平安科技（深圳）有限公司 | Block dynamic generation method, device, computer equipment and storage medium |
| CN109447635B (en) * | 2018-10-15 | 2022-02-01 | 北京京东尚科信息技术有限公司 | Information storage method and device for block chain |
| CN109886693B (en) * | 2019-03-13 | 2021-05-07 | 百度在线网络技术（北京）有限公司 | Consensus realization method, device, equipment and medium for block chain system |
| CN110569240B (en) * | 2019-07-25 | 2023-04-07 | 平安科技（深圳）有限公司 | Data storage method and device, computer equipment and storage medium |
-
2019
- 2019-07-25 CN CN201910677577.9A patent/CN110569240B/en active Active
-
2020
- 2020-06-30 WO PCT/CN2020/099213 patent/WO2021012903A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106651332A (en) * | 2016-12-29 | 2017-05-10 | 先锋支付有限公司 | Block chain and method for generating new block in block chain |
| CN109815226A (en) * | 2018-12-13 | 2019-05-28 | 平安科技（深圳）有限公司 | Date storage method, device, equipment and storage medium based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110569240A (en) | 2019-12-13 |
| WO2021012903A1 (en) | 2021-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109492983B (en) | Electronic seal signing method, device, equipment and medium based on block chain intelligent contract | |
| CN107342867B (en) | Signature verification method and device | |
| CN110602239B (en) | Block chain information storage method and related equipment | |
| CN109474578B (en) | Message checking method, device, computer equipment and storage medium | |
| CN110750267B (en) | Service information updating method, device, computer equipment and storage medium | |
| CN109684347B (en) | Account checking method, account checking device, computer equipment and storage medium | |
| CN109359994B (en) | Service processing method, device and system based on block chain | |
| CN111563365B (en) | Method and device for processing modification information of test standard worksheet and computer equipment | |
| CN110555698A (en) | data processing method, data processing device, computer equipment and storage medium | |
| CN110555779A (en) | data processing method, data processing device, computer equipment and storage medium | |
| CN109902272B (en) | Electronic form data processing method, electronic form data processing device, computer equipment and storage medium | |
| CN110569240B (en) | Data storage method and device, computer equipment and storage medium | |
| CN109508964B (en) | Project establishing method, device, computer equipment and storage medium | |
| CN110650186A (en) | Interface calling method and device, computer equipment and storage medium | |
| CN110569389A (en) | Environment monitoring method and device, computer equipment and storage medium | |
| CN110727949A (en) | Data storage method and device, computer equipment and storage medium | |
| CN110599267A (en) | Electronic invoice billing method and device, computer readable storage medium and computer equipment | |
| CN108282484B (en) | Password acquisition method and device, computer equipment and storage medium | |
| CN111124421B (en) | Abnormal contract data detection method and device for blockchain intelligent contract | |
| CN110674500B (en) | Storage medium virus searching and killing method and device, computer equipment and storage medium | |
| CN109101232B (en) | Method, device, computer equipment and storage medium for product development | |
| CN108334452B (en) | Rule data transfer test method, apparatus, computer device and storage medium | |
| CN108389124B (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN108133026B (en) | Multi-data processing method, system and storage medium | |
| CN111858467B (en) | File data processing method, device, equipment and medium based on artificial intelligence |
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 |