CN113704255A - Data insertion method and device, and data verification method and device - Google Patents
Data insertion method and device, and data verification method and device Download PDFInfo
- Publication number
- CN113704255A CN113704255A CN202110892593.7A CN202110892593A CN113704255A CN 113704255 A CN113704255 A CN 113704255A CN 202110892593 A CN202110892593 A CN 202110892593A CN 113704255 A CN113704255 A CN 113704255A
- Authority
- CN
- China
- Prior art keywords
- data
- identification information
- verified
- verification
- 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.)
- Pending
Links
- 238000012966 insertion method Methods 0.000 title claims abstract description 15
- 238000000034 method Methods 0.000 title claims description 27
- 238000013524 data verification Methods 0.000 title claims description 25
- 238000013500 data storage Methods 0.000 claims abstract description 22
- 238000012545 processing Methods 0.000 claims abstract description 14
- 238000012795 verification Methods 0.000 claims description 77
- 238000004590 computer program Methods 0.000 claims description 12
- 238000003780 insertion Methods 0.000 claims description 8
- 230000037431 insertion Effects 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
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
- G06F16/2282—Tablespace storage structures; Management thereof
-
- 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/21—Design, administration or maintenance of databases
- G06F16/219—Managing data history or versioning
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Storage Device Security (AREA)
Abstract
The invention is suitable for data storage, and provides a data insertion method, which comprises the steps of obtaining a distributed lock of data to be inserted, obtaining target data of a data storage table in a database when the distributed lock of the data to be inserted is determined, obtaining identification information of the target data, processing the identification information of the target data according to a preset processing strategy to obtain target identification information, calculating according to the data to be inserted, the target identification information and a hash value of the target data to obtain a target hash value of the data to be inserted, and finally inserting the data to be inserted into the database according to the target identification information, the data to be inserted and the target hash value. The embodiment of the invention can effectively prevent the data from being modified, and if the data is modified, the data can be verified and found in time.
Description
Technical Field
The invention belongs to the technical field of data storage, and particularly relates to a data insertion method and device and a data verification method and device.
Background
In the prior art, when data is inserted or read, generally, the modification permission of the data in a data table is controlled through the account number and the permission of a database, and different account numbers have different operation permissions.
The account number is misoperation or intentional operation of a person who cannot control the authority, but some data are not allowed to be modified once generated and are not allowed to be deleted. The prior art cannot provide an effective technical scheme for preventing misoperation or data tampering.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a data insertion method and apparatus, and a data verification method and apparatus, and aims to solve the problem that the technology cannot provide an effective technical scheme for preventing misoperation or data tampering.
The embodiment of the invention is realized in such a way that a data insertion method comprises the following steps:
acquiring a distributed lock of data to be inserted;
when the distributed lock exists in the data to be inserted, acquiring target data in a data storage table in a database;
acquiring identification information of the target data, and processing the identification information of the target data according to a preset processing strategy to obtain target identification information;
calculating a target hash value of the data to be inserted according to the data to be inserted, the target identification information and the hash value of the target data;
and inserting the data to be inserted into the database according to the target identification information, the data to be inserted and the target hash value.
Further, each data and the corresponding identification information thereof are stored in the data storage table, the identification information is sorted in a descending order, and the acquiring of the target data in the data storage table in the database includes:
reading the data storage table;
and acquiring the data with the maximum identification information in the data storage table, and taking the data with the maximum identification information as the target data.
Further, the processing the identification information of the target data according to a preset processing policy to obtain the target identification information includes:
and adding the identification information of the target data and a first preset numerical value to obtain the target identification information.
The embodiment of the present invention further provides a data insertion apparatus, which includes a memory, a processor, and a computer program stored in the memory and running on the processor, and when the processor executes the computer program, the data insertion apparatus implements the steps of the data insertion method described above.
The embodiment of the invention also provides a data verification method, which comprises the following steps:
acquiring a distributed lock of data to be verified in a database;
when the distributed lock of the data to be verified is determined to exist, acquiring all identification information in a verification data table, wherein the identification information of the data to be verified is stored in the verification data table, and the identification information of each data to be verified is arranged in sequence;
when all the identification information in the verification data table is determined to meet verification conditions, target data to be verified in the verification data table are obtained;
verifying the hash value of the target data to be verified;
when the hash value of the target data to be verified passes verification, reading the next target data to be verified according to a preset reading strategy;
verifying the hash value of the next data to be verified according to the hash value of the target data to be verified;
and circularly executing the steps of reading the next target data to be verified according to the reading strategy and verifying the hash value of the next data to be verified according to the hash value of the previous target data to be verified until the verification of the hash value of the data to be verified in the verification data table is completed.
Further, the step of determining whether all the identification information in the verification data table satisfies the verification condition includes:
judging whether all the identification information in the verification data table is a continuous array or not;
if yes, determining that all the identification information in the verification data table meets the verification condition, and if not, determining that all the identification information in the verification data table does not meet the verification condition.
Further, the acquiring target data to be verified in the verification data table includes:
and acquiring the data to be verified with the minimum identification information in the verification data table, and taking the data to be verified as the target data to be verified.
Further, the reading the next target data to be verified according to the preset reading strategy includes:
acquiring identification information of the target data to be verified;
adding the identification information of the target data to be verified with a second preset numerical value to obtain the next identification information;
and reading the database according to the next identification information, and taking the data to be verified corresponding to the next identification information as the next target data to be verified.
Further, the data verification method further comprises:
and if the hash value of the data to be verified is not verified, the verification step is quitted.
The embodiment of the present invention further provides a data verification apparatus, which includes a memory, a processor, and a computer program stored in the memory and running on the processor, and when the processor executes the computer program, the data verification apparatus implements the steps of the data verification method described above.
Compared with the prior art, the invention has the beneficial effects that: the embodiment of the invention obtains the distributed lock of the data to be inserted, obtains the target data of the data storage table in the database when determining that the distributed lock exists in the data to be inserted, obtains the identification information of the target data, processes the identification information of the target data according to a preset processing strategy to obtain the target identification information, calculates according to the data to be inserted, the target identification information and the hash value of the target data to obtain the target hash value of the data to be inserted, and finally inserts the data to be inserted into the database according to the target identification information, the data to be inserted and the target hash value. The embodiment of the invention prevents concurrent operation by obtaining the distributed lock of the data to be inserted, performs hash calculation on the data to be inserted and the hash value of the previous row of inserted data, and inserts the calculated hash value and the data to be inserted into the database by using the atomicity of the database.
Drawings
FIG. 1 is a flow chart of a data insertion method according to an embodiment of the present invention;
FIG. 2 is a flow chart of a data insertion method according to another embodiment of the present invention;
FIG. 3 is a flow chart of a data verification method provided by an embodiment of the invention;
fig. 4 is a flowchart of a data verification method according to another embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention 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 invention and are not intended to limit the invention.
The embodiment of the invention discloses a method for realizing database data tamper-proof verification technology, which comprises the following steps: before the record in the database table is inserted into the database, SHA-256 hash calculation is carried out on the hash value of the data record in the row and the record in the previous row; the computed hash value and the row of data records to be inserted into the database are inserted into the database using the atomicity of the database. And then performing chain hash calculation verification on the database records according to the ID columns of the database records, and checking whether the records in the database table are modified or deleted. The scheme can effectively verify whether the data in the database is modified or deleted.
Fig. 1 illustrates a data insertion method provided by an embodiment of the present invention, including:
s101, acquiring a distributed lock of data to be inserted.
In this step, before the operation is performed on the data to be inserted, the distributed lock of the data to be inserted is obtained, if the distributed lock exists, it indicates that there is no concurrent operation currently, the related operation of data insertion can be performed, and if the distributed lock does not exist, the insertion operation is directly ended.
S102, when the distributed lock of the data to be inserted is determined, target data in a data storage table in a database are obtained.
In this step, each piece of data and identification information corresponding to the piece of data are stored in the data storage table, the identification information is sorted in a descending order, and the obtaining of the target data in the data storage table in the database includes: reading the data storage table; and acquiring the data with the maximum identification information in the data storage table, and taking the data with the maximum identification information as the target data. Specifically, the identification information is an ID value of the data, each data and its corresponding ID value are stored in the data storage table, each ID value is a unique numerical value, and the ID values are arranged in descending order. In this step, the data with the largest ID value in the data storage table is determined, and the data with the largest ID value is used as the target database.
S103, acquiring the identification information of the target data, and processing the identification information of the target data according to a preset processing strategy to obtain target identification information.
In this step, the identification information of the target data is added to a first preset value to obtain the target identification information. Specifically, the first preset value may be set according to actual needs, in this embodiment, the first preset value is 1, that is, after the ID value of the target data is determined, an operation is performed on the ID value to obtain another ID value, where the another ID value is the target identification information.
S104, calculating the target hash value of the data to be inserted according to the data to be inserted, the target identification information and the hash value of the target data.
In this step, the data to be inserted, the new ID value calculated in step S103, and the hash value of the target data are calculated together, so as to obtain the hash value of the data to be inserted.
And S105, inserting the data to be inserted into the database according to the target identification information, the data to be inserted and the target hash value.
In this step, the new ID value calculated in step S103, the data to be inserted, and the hash value calculated in step S104 are inserted into the database together.
The embodiment of the invention is further illustrated by fig. 2 below:
as shown in fig. 2, the insertion data flow includes:
s201, acquiring a distributed lock, namely acquiring the distributed lock of data to be inserted, and preventing concurrent operation;
s202, taking out the previous data, namely reading the row of data with the maximum ID in the data storage table;
s203, calculating a new ID value, namely adding one to the maximum value of the ID read in the step S202;
s204, calculating a new hash value, namely calculating the new ID obtained by the calculation in the step S203 and the hash value of the data to be inserted and the previous data together to calculate the hash value;
s205, insert the data, that is, insert the new ID calculated in step S203, the data to be inserted, and the new hash value calculated in step S204 into the database together.
An embodiment of the present invention further provides a data insertion apparatus, which includes a memory, a processor, and a computer program stored in the memory and running on the processor, where when the processor executes the computer program, each step in the data insertion method shown in fig. 1 or fig. 2 is implemented.
In inserting data into data, in order to facilitate verifying data stored in a database to determine whether data in the database is modified or deleted, an embodiment of the present invention further provides a data verification method as shown in fig. 3, including:
s301, acquiring a distributed lock of data to be verified in the database.
In this step, before the operation is performed on the data to be verified, the distributed lock of the data to be verified is obtained, if the distributed lock exists, it indicates that there is no concurrent operation currently, the related operation of data verification can be performed, and if the distributed lock does not exist, the verification operation is directly ended.
S302, when the data to be verified is determined to have the distributed lock, all identification information in a verification data table is obtained, wherein the identification information of the data to be verified is stored in the verification data table, and the identification information of each data to be verified is arranged in sequence.
In this step, the data stored in the verification data table in the database and the identification information corresponding to the data are stored, in this embodiment, the identification information is an ID value, each stored data has a corresponding ID value, and the ID value is a unique identification. In this step, all the ID values in the verification data table are acquired.
S303, when all the identification information in the verification data table is determined to meet the verification condition, the target data to be verified in the verification data table is obtained.
In this step, the step of determining whether all the identification information in the verification data table satisfies the verification condition includes: judging whether all the identification information in the verification data table is a continuous array or not; if yes, determining that all the identification information in the verification data table meets the verification condition, and if not, determining that all the identification information in the verification data table does not meet the verification condition. Specifically, if the ID value is determined to be a continuous value, it indicates that all the ID values in the verification data table are valid, and the next operation can be performed, and if the ID value is not continuous, the verification step is exited. The acquiring target data to be verified in the verification data table comprises: and acquiring the data to be verified with the minimum identification information in the verification data table, and taking the data to be verified as the target data to be verified. Specifically, if the ID values are continuous, the data with the smallest ID value is obtained, and the data with the smallest ID value is used as the target data to be verified.
S304, verifying the hash value of the target data to be verified.
In this step, the hash value of the data with the smallest ID value is verified, and the verification step and method may use an existing verification algorithm. If the hash value of the data with the minimum ID value passes the verification, executing the next step, and if the hash value of the data with the minimum ID value does not pass the verification, directly ending the verification operation.
S305, when the hash value of the target data to be verified passes verification, reading the next target data to be verified according to a preset reading strategy.
In this step, the reading the next target data to be verified according to the preset reading strategy includes: acquiring identification information of the target data to be verified; adding the identification information of the target data to be verified with a second preset numerical value to obtain the next identification information; and reading the database according to the next identification information, and taking the data to be verified corresponding to the next identification information as the next target data to be verified. Specifically, if the hash value of the data with the smallest ID value passes the verification, the data with the second smallest ID value is obtained, that is, the ID value is added to a second preset value, where the second preset value is 1. The next data to be verified is the data to be verified with the second smallest ID.
S306, verifying the hash value of the next data to be verified according to the hash value of the target data to be verified.
In this step, the hash value of the data having the smallest ID value is verified based on the hash value of the data having the smallest ID value.
S307, circularly executing the steps of reading the next target data to be verified according to the reading strategy and verifying the hash value of the next data to be verified according to the hash value of the previous target data to be verified until the verification of the hash value of the data to be verified in the verification data table is completed.
In this step, the hash values of the data are verified in the order of the ID values from small to large, if the ID value of the current data to be verified is 2, the ID value of the next data to be verified is 3, the ID values of the subsequent data to be verified are 4, 5, and 6 … … N, and so on until the verification of the hash values of all the data to be verified is completed, it should be noted that, in the verification process, if the hash value of the data to be verified does not pass the verification, the verification step is exited, and the verification operation is ended.
The embodiments of the present invention are further described below with reference to fig. 4:
the data verification process provided by the embodiment of the invention comprises the following steps:
s401, acquiring a distributed lock, namely acquiring the distributed lock of the data to be verified, and preventing concurrent operation;
s402, judging whether the ID values in the verification data table are continuous or not to ensure the ID continuity and prevent deletion operation;
s403, acquiring a row of data (including a hash value) with the smallest ID value in the verification data table, and starting verification from the row of data with the smallest ID value, wherein the ID value generally starts from 1;
s404, verifying the hash value, namely verifying the hash value of the row of data with the minimum ID value;
s405, acquiring data corresponding to the next ID value, namely adding 1 to the ID value to obtain the ID value of the next data and determining the data of the next row;
s406, verifying the hash value: namely, the hash value of the previous line is combined for verification;
and S407, circulating the operation until all data verification is finished, and normally finishing.
And if the abnormal condition is ended, exiting the verification step and generating an alarm record.
An embodiment of the present invention further provides a data verification apparatus, which includes a memory, a processor, and a computer program stored in the memory and running on the processor, where when the processor executes the computer program, each step in the data verification method shown in fig. 3 or fig. 4 is implemented.
The data insertion method and device, and the data verification method and device provided by the embodiment of the invention ensure that the data cannot be modified, once the data is modified, the data can be found, and the more the data is, the higher the security is, and the more the modification difficulty is. The verification of the verification program can be escaped only by modifying the hash values of all records through the embodiment provided by the invention, so that the integrity of the data is ensured, and misoperation or data tampering are effectively prevented.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical division, and other divisions may be realized in practice, for example, a plurality of modules or components may be combined or integrated into another apparatus, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical modules, may be located in one place, or may be distributed on a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing module, or each of the modules may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It should be noted that, for the sake of simplicity, the above-mentioned method embodiments are described as a series of acts or combinations, but those skilled in the art should understand that the present invention is not limited by the described order of acts, as some steps may be performed in other orders or simultaneously according to the present invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no acts or modules are necessarily required of the invention.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the above description, for a person skilled in the art, there are variations on the specific implementation and application scope according to the concepts of the embodiments of the present invention, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (10)
1. A method of data insertion, comprising:
acquiring a distributed lock of data to be inserted;
when the distributed lock exists in the data to be inserted, acquiring target data in a data storage table in a database;
acquiring identification information of the target data, and processing the identification information of the target data according to a preset processing strategy to obtain target identification information;
calculating a target hash value of the data to be inserted according to the data to be inserted, the target identification information and the hash value of the target data;
and inserting the data to be inserted into the database according to the target identification information, the data to be inserted and the target hash value.
2. The data insertion method according to claim 1, wherein each data and its corresponding identification information are stored in the data storage table, the identification information is sorted in descending order, and the obtaining of the target data in the data storage table in the database includes:
reading the data storage table;
and acquiring the data with the maximum identification information in the data storage table, and taking the data with the maximum identification information as the target data.
3. The data insertion method of claim 1, wherein the processing the identification information of the target data according to a preset processing policy to obtain the target identification information comprises:
and adding the identification information of the target data and a first preset numerical value to obtain the target identification information.
4. A data insertion device comprising a memory, a processor and a computer program stored on the memory and running on the processor, wherein the processor implements the steps of the data insertion method according to any one of claims 1 to 3 when executing the computer program.
5. A data verification method, comprising:
acquiring a distributed lock of data to be verified in a database;
when the distributed lock of the data to be verified is determined to exist, acquiring all identification information in a verification data table, wherein the identification information of the data to be verified is stored in the verification data table, and the identification information of each data to be verified is arranged in sequence;
when all the identification information in the verification data table is determined to meet verification conditions, target data to be verified in the verification data table are obtained;
verifying the hash value of the target data to be verified;
when the hash value of the target data to be verified passes verification, reading the next target data to be verified according to a preset reading strategy;
verifying the hash value of the next data to be verified according to the hash value of the target data to be verified;
and circularly executing the steps of reading the next target data to be verified according to the reading strategy and verifying the hash value of the next data to be verified according to the hash value of the previous target data to be verified until the verification of the hash value of the data to be verified in the verification data table is completed.
6. The data verification method of claim 5, wherein the step of determining whether all the identification information in the verification data table satisfies the verification condition comprises:
judging whether all the identification information in the verification data table is a continuous array or not;
if yes, determining that all the identification information in the verification data table meets the verification condition, and if not, determining that all the identification information in the verification data table does not meet the verification condition.
7. The data verification method of claim 5, wherein the obtaining target data to be verified in the verification data table comprises:
and acquiring the data to be verified with the minimum identification information in the verification data table, and taking the data to be verified as the target data to be verified.
8. The data verification method of claim 5, wherein reading the next target data to be verified according to the preset reading policy comprises:
acquiring identification information of the target data to be verified;
adding the identification information of the target data to be verified with a second preset numerical value to obtain the next identification information;
and reading the database according to the next identification information, and taking the data to be verified corresponding to the next identification information as the next target data to be verified.
9. The data verification method of any one of claims 5 to 8, further comprising:
and if the hash value of the data to be verified is not verified, the verification step is quitted.
10. A data verification device comprising a memory, a processor and a computer program stored on the memory and running on the processor, wherein the processor implements the steps of the data verification method according to any one of claims 5 to 9 when executing the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110892593.7A CN113704255A (en) | 2021-08-04 | 2021-08-04 | Data insertion method and device, and data verification method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110892593.7A CN113704255A (en) | 2021-08-04 | 2021-08-04 | Data insertion method and device, and data verification method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113704255A true CN113704255A (en) | 2021-11-26 |
Family
ID=78651542
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110892593.7A Pending CN113704255A (en) | 2021-08-04 | 2021-08-04 | Data insertion method and device, and data verification method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113704255A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114282268A (en) * | 2021-12-10 | 2022-04-05 | 南京国电南自电网自动化有限公司 | Database integrity checking method and device based on SM3 algorithm |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103518364A (en) * | 2013-03-19 | 2014-01-15 | 华为技术有限公司 | Data update method for distributed storage system and server |
| CN109559164A (en) * | 2018-11-19 | 2019-04-02 | 泰康保险集团股份有限公司 | Favor information processing method, device, electronic equipment and computer-readable medium |
| CN110390743A (en) * | 2018-04-17 | 2019-10-29 | 松下电器（美国）知识产权公司 | Control method, information processing unit, management system and recording medium |
| CN112487009A (en) * | 2020-12-14 | 2021-03-12 | 北京字节跳动网络技术有限公司 | Data updating method, device, equipment, storage medium and program product |
-
2021
- 2021-08-04 CN CN202110892593.7A patent/CN113704255A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103518364A (en) * | 2013-03-19 | 2014-01-15 | 华为技术有限公司 | Data update method for distributed storage system and server |
| CN110390743A (en) * | 2018-04-17 | 2019-10-29 | 松下电器（美国）知识产权公司 | Control method, information processing unit, management system and recording medium |
| CN109559164A (en) * | 2018-11-19 | 2019-04-02 | 泰康保险集团股份有限公司 | Favor information processing method, device, electronic equipment and computer-readable medium |
| CN112487009A (en) * | 2020-12-14 | 2021-03-12 | 北京字节跳动网络技术有限公司 | Data updating method, device, equipment, storage medium and program product |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114282268A (en) * | 2021-12-10 | 2022-04-05 | 南京国电南自电网自动化有限公司 | Database integrity checking method and device based on SM3 algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107480555B (en) | Database access authority control method and device based on block chain | |
| CN109831487B (en) | Fragmented file verification method and terminal equipment | |
| CN110472201B (en) | Text similarity detection method and device based on block chain and electronic equipment | |
| CN108734028B (en) | Data management method based on block chain, block chain link point and storage medium | |
| US20210049715A1 (en) | Blockchain-based data procesing method, apparatus, and electronic device | |
| CN109255056B (en) | Data reference processing method, device, equipment and storage medium of block chain | |
| CN112464212B (en) | Data authority control reconstruction method based on mature complex service system | |
| CN112037058B (en) | Data verification method, device and storage medium | |
| CN111010284B (en) | Processing method of block to be identified, related device and block chain system | |
| CN112328558B (en) | Access log storage method and system of medical system based on block chain | |
| CN109242676B (en) | Block issuing method and device and electronic equipment | |
| CN113360548A (en) | Data processing method, device, equipment and medium based on data asset analysis | |
| CN113704255A (en) | Data insertion method and device, and data verification method and device | |
| CN110555682A (en) | multi-channel implementation method based on alliance chain | |
| CN112182555A (en) | Weak password detection method, device, electronic apparatus, storage medium, and program | |
| CN106469042A (en) | The generation method of pseudo random number and device | |
| CN114707141A (en) | Multi-party computing method and system based on block chain system | |
| CN113919006A (en) | Method, equipment and computer storage medium for protecting data integrity | |
| CN113656043B (en) | Code verification method and device, electronic equipment and storage medium | |
| CN112307510A (en) | Data asset authority management method and management system for data center | |
| CN117272278B (en) | Decentralization management method and device for digital asset platform | |
| CN112309518B (en) | Medical record auditing method, system, computer equipment and readable storage medium | |
| CN103176918A (en) | Verification method of access storage local area network disc array device | |
| CN116910821A (en) | Data reading and writing method, device, equipment and storage medium | |
| CN118051956A (en) | Log processing method and device, electronic equipment and storage medium |
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 |