CN114661524B - Method for realizing real estate registration data backup technology based on log analysis - Google Patents
Method for realizing real estate registration data backup technology based on log analysis Download PDFInfo
- Publication number
- CN114661524B CN114661524B CN202210276577.XA CN202210276577A CN114661524B CN 114661524 B CN114661524 B CN 114661524B CN 202210276577 A CN202210276577 A CN 202210276577A CN 114661524 B CN114661524 B CN 114661524B
- Authority
- CN
- China
- Prior art keywords
- data
- value
- check value
- backup
- group
- 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
- 238000000034 method Methods 0.000 title claims abstract description 68
- 238000004458 analytical method Methods 0.000 title claims abstract description 13
- 238000005516 engineering process Methods 0.000 title claims abstract description 12
- 230000001360 synchronised effect Effects 0.000 claims abstract description 26
- 238000011084 recovery Methods 0.000 claims abstract description 17
- BTCSSZJGUNDROE-UHFFFAOYSA-N gamma-aminobutyric acid Chemical compound NCCCC(O)=O BTCSSZJGUNDROE-UHFFFAOYSA-N 0.000 claims description 31
- 230000008676 import Effects 0.000 claims description 7
- 238000012795 verification Methods 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 description 11
- 229910002056 binary alloy Inorganic materials 0.000 description 9
- 238000004891 communication Methods 0.000 description 5
- 102100029727 Enteropeptidase Human genes 0.000 description 3
- 101001012451 Homo sapiens Enteropeptidase Proteins 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
- G06F11/1469—Backup restoration techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1471—Saving, restoring, recovering or retrying involving logging of persistent data for recovery
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/1734—Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention provides a method for realizing real estate registration data backup technology based on log analysis, which comprises the following steps: s1, judging whether a real estate storage service database is down; s2, acquiring backup log data in the real estate backup database, and judging whether unsynchronized log data exist in the log data to be synchronized in the step S1 according to the acquired real estate backup log data; s3, importing the unsynchronized log data obtained in the step S1 into the backup log data obtained in the step S2; s4, sending the backup log data and the final check value to the appointed client; s5, after the received backup log data is judged by using the received final check value, the received backup log data is used for carrying out data recovery on the real estate storage service database. The invention can realize the safety of log backup.
Description
Technical Field
The invention relates to the technical field of logs, in particular to a method for realizing real estate registration data backup technology based on log analysis.
Background
HBase (Hadoop Database) is a highly reliable, high performance, column-oriented, scalable distributed storage system that can build large-scale structured storage clusters on personal computer servers using HBase technology. Patent application number 2021103481130, entitled "log data backup method, apparatus, device, and storage medium", discloses a method for backup of log data comprising: collecting a plurality of log records corresponding to each region service from a pre-written log file of each region service in a first cluster, pre-distributing at least one pre-distributed storage region for each region service, respectively determining a target storage region corresponding to each log record from the at least one pre-distributed storage region, analyzing each log record by adopting a target analysis thread corresponding to the target storage region to obtain log data in each log record, and backing up the log data in the plurality of log records. The log record is analyzed by adopting the target analysis thread, so that the log record is processed in parallel by multithreading and fragmentation, and all target storage areas cannot interfere with each other, so that all target storage areas can be analyzed in series and simultaneously ensure high throughput, and the configuration of the HBase cluster is not required to be additionally adjusted.
Disclosure of Invention
The invention aims at least solving the technical problems in the prior art, and particularly creatively provides a real estate registration data backup technology implementation method based on log analysis.
In order to achieve the above purpose of the present invention, the present invention provides a system for implementing real estate registration data backup technology based on log analysis, which includes a real estate storage service database downtime determination module, a backup log determination acquisition module, an import data module, a transmission data module and a data recovery module;
the data output end of the real estate storage service database downtime judging module is connected with the data input end of the backup log judging and acquiring module, the data output end of the backup log judging and acquiring module is connected with the data input end of the importing data module, the data output end of the importing data module is connected with the data input end of the transmitting data module, and the data output end of the transmitting data module is connected with the data input end of the data recovery module;
the real estate storage service database downtime judging module is used for judging whether the real estate storage service database is downtime or not:
if the real estate storage service database is monitored to be down, acquiring log data to be synchronized in the real estate storage service database;
If the real estate storage service database is not monitored to be down, continuing waiting, and returning to the real estate storage service database down judging module;
the backup log judging and acquiring module is used for acquiring backup log data in the real estate backup database, and judging whether unsynchronized log data exist in the log data to be synchronized in the real estate storage service database downtime judging module according to the acquired real estate backup log data:
if the log data to be synchronized has unsynchronized log data, executing an import data module;
if the log data to be synchronized does not have unsynchronized log data, executing a data sending module;
the import data module is used for importing the unsynchronized log data acquired in the real estate storage service database downtime judging module into the backup log data acquired in the backup log judging and acquiring module;
the data sending module is used for sending the backup log data and the final check value to the appointed client;
the data recovery module is used for carrying out data recovery on the real estate storage service database by utilizing the received backup log data after judging the received backup log data by utilizing the received final check value.
In a preferred embodiment of the present invention, a security determination module is included in the data recovery module, the security determination module being configured to determine security of the received backup log based on the client checkvalues and the received final checkvalues:
if the client check value is consistent with the received final check value, the received backup log is safe;
if the client check value is inconsistent with the received final check value, the received backup log is unsafe and has risk, the received backup log is deleted, and the server side is re-requested to send the backup log data and the final check value.
In a preferred embodiment of the present invention, the method for obtaining the client verification value from the received backup log includes the steps of:
s51, presetting a bit number G of binary mode data as a preset character length threshold at a client, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G by the client, wherein G is the number of the 1 st group, the 2 nd group, the 3 rd group, the … … th group and the G th group respectively, and G is the total group number;
s52, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; let g' =1;
S53, performing circular right shift according to the moving value i of the check value obtained in the step S52 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S52;
s54, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a client check value;
if g ' < g, g ' =g ' +1; returning to step S53.
In a preferred embodiment of the present invention, the method for calculating the division factor I in step S52 is as follows:
I＝(1-I)/I，
wherein I is a dividing factor;
1 represents a coefficient 1.
In a preferred embodiment of the present invention, the method for calculating the start value J of the check value in step S52 is as follows: j=int<I*2 G -I>，
Wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
In a preferred embodiment of the present invention, the generation method of the movement value i of the check value in step S52 is as follows:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
In a preferred embodiment of the present invention, the method for calculating the total group number g in step S51 is as follows:
wherein, int < > represents a rounding-down algorithm;
g' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
if the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
if the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group.
In a preferred embodiment of the present invention, the method for pre-filling the characters in the g group comprises the following steps:
s511, the binary system of the preset alignment data is aligned with the lowest order of the characters in the g group, the preset alignment data is aligned with 0XH 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h ，
wherein h represents the total bit number of the preset filling data;
H h′ hexadecimal values of one of 0, 1, 2, 3, … …, F;
h' is a positive integer less than or equal to h and greater than or equal to 1;
s512, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S53 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
In a preferred embodiment of the present invention, the method for obtaining the final check value from the backup log includes the steps of:
s41, presetting a bit number G of binary mode data as a preset character length threshold at a server, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G, wherein the backup logs are respectively in a 1 st group, a 2 nd group, a 3 rd group, a … … th group and a G th group, and G is the total group number;
S42, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; let g' =1;
s43, performing circular right shift according to the moving value i of the check value obtained in the step S42 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S42;
s44, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a final check value;
if g ' < g, g ' =g ' +1; returning to step S43.
In a preferred embodiment of the present invention, the method for calculating the division factor I in step S42 is as follows:
I＝(1-I)/I，
wherein I is a dividing factor;
1 represents a coefficient 1.
In a preferred embodiment of the present invention, the method for calculating the start value J of the check value in step S42 is as follows:
J＝int<I*2 G -I>，
wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
In a preferred embodiment of the present invention, the generation method of the movement value i of the check value in step S42 is as follows:
Wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
In a preferred embodiment of the present invention, the method for calculating the total group number g in step S41 is as follows:
wherein, int < > represents a rounding-down algorithm;
g' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
if the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
if the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group.
In a preferred embodiment of the present invention, the method for pre-filling the characters in the g group comprises the following steps:
s411, filling the lowest bit of the characters in the g group with preset filling data to 0XH in a binary system 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h ，
wherein h represents the total bit number of the preset filling data;
H h′ hexadecimal values of one of 0, 1, 2, 3, … …, F;
h' is a positive integer less than or equal to h and greater than or equal to 1;
s412, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S43 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
The invention also discloses a method for realizing the real estate registration data backup technology based on log analysis, which comprises the following steps:
s1, judging whether a real estate storage service database is down or not:
if the real estate storage service database is monitored to be down, acquiring log data to be synchronized in the real estate storage service database;
if the real estate storage service database is not monitored to be down, continuing waiting, and returning to the step S1;
S2, acquiring backup log data in the real estate backup database, and judging whether unsynchronized log data exist in the log data to be synchronized in the step S1 according to the acquired real estate backup log data:
if the log data to be synchronized has unsynchronized log data, executing the next step;
if the log data to be synchronized does not have unsynchronized log data, executing step S4;
s3, importing the unsynchronized log data obtained in the step S1 into the backup log data obtained in the step S2; even if the real estate storage service database is down, the real estate backup database can provide service according to the backup log data after the unsynchronized log data is imported, so that the user experience is enhanced.
S4, sending the backup log data and the final check value to the appointed client;
s5, after the received backup log data is judged by using the received final check value, the received backup log data is used for carrying out data recovery on the real estate storage service database. And after the machine is stopped, the real estate storage service database can be restored to be synchronous with the real estate backup database data according to the received backup log data.
In a preferred embodiment of the present invention, the security of the received backup log is determined in step S5 based on the client checkvalues and the received final checkvalues:
If the client check value is consistent with the received final check value, the received backup log is safe;
if the client check value is inconsistent with the received final check value, the received backup log is unsafe and has risk, the received backup log is deleted, and the server side is re-requested to send the backup log data and the final check value.
In a preferred embodiment of the present invention, the method for obtaining the client verification value from the received backup log includes the steps of:
s51, presetting a bit number G of binary mode data as a preset character length threshold at a client, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G by the client, wherein G is the number of the 1 st group, the 2 nd group, the 3 rd group, the … … th group and the G th group respectively, and G is the total group number;
s52, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; let g' =1;
s53, performing circular right shift according to the moving value i of the check value obtained in the step S52 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S52;
S54, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a client check value;
if g ' < g, g ' =g ' +1; returning to step S53.
In a preferred embodiment of the present invention, the method for calculating the division factor I in step S52 is as follows: i= (1-I)/I,
wherein I is a dividing factor;
1 represents a coefficient 1.
In a preferred embodiment of the present invention, the method for calculating the start value J of the check value in step S52 is as follows: j=int<I*2 G -I>，
Wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
In a preferred embodiment of the present invention, the generation method of the movement value i of the check value in step S52 is as follows:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
In a preferred embodiment of the present invention, the method for calculating the total group number g in step S51 is as follows:
Wherein, int < > represents a rounding-down algorithm;
g' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
if the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
if the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group.
In a preferred embodiment of the present invention, the method for pre-filling the characters in the g group comprises the following steps:
s511, the binary system of the preset alignment data is aligned with the lowest order of the characters in the g group, the preset alignment data is aligned with 0XH 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h ，
wherein h represents the total bit number of the preset filling data;
H h′ hexadecimal values of one of 0, 1, 2, 3, … …, F;
h' is a positive integer less than or equal to h and greater than or equal to 1;
s512, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S53 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
In a preferred embodiment of the present invention, the method for obtaining the final check value from the backup log includes the steps of:
s41, presetting a bit number G of binary mode data as a preset character length threshold at a server, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G, wherein the backup logs are respectively in a 1 st group, a 2 nd group, a 3 rd group, a … … th group and a G th group, and G is the total group number;
s42, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; let g' =1;
s43, performing circular right shift according to the moving value i of the check value obtained in the step S42 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S42;
S44, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a final check value;
if g ' < g, g ' =g ' +1; returning to step S43.
In a preferred embodiment of the present invention, the method for calculating the division factor I in step S42 is as follows:
I＝(1-I)/I，
wherein I is a dividing factor;
1 represents a coefficient 1.
In a preferred embodiment of the present invention, the method for calculating the start value J of the check value in step S42 is as follows:
J＝int<I*2 G -I>，
wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
In a preferred embodiment of the present invention, the generation method of the movement value i of the check value in step S42 is as follows:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
In a preferred embodiment of the present invention, the method for calculating the total group number g in step S41 is as follows:
wherein, int < > represents a rounding-down algorithm;
G' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
if the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
if the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group.
In a preferred embodiment of the present invention, the method for pre-filling the characters in the g group comprises the following steps:
s411, filling the lowest bit of the characters in the g group with preset filling data to 0XH in a binary system 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h ，
wherein h represents the total bit number of the preset filling data;
H h′ 0, 1, 2, 3, … …,Hexadecimal value of one of F;
h' is a positive integer less than or equal to h and greater than or equal to 1;
s412, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S43 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
In summary, by adopting the technical scheme, the log backup safety can be realized.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the invention will become apparent and may be better understood from the following description of embodiments taken in conjunction with the accompanying drawings in which:
fig. 1 is a schematic block diagram of a flow of the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.
The invention provides a realization system of real estate registration data backup technology based on log analysis, which comprises a real estate storage service database downtime judging module, a backup log judging and acquiring module, a data importing module, a data sending module and a data recovering module;
the data output end of the real estate storage service database downtime judging module is connected with the data input end of the backup log judging and acquiring module, the data output end of the backup log judging and acquiring module is connected with the data input end of the importing data module, the data output end of the importing data module is connected with the data input end of the transmitting data module, and the data output end of the transmitting data module is connected with the data input end of the data recovery module;
the real estate storage service database downtime judging module is used for judging whether the real estate storage service database is downtime or not:
if the real estate storage service database is monitored to be down, acquiring log data to be synchronized in the real estate storage service database;
if the real estate storage service database is not monitored to be down, continuing waiting, and returning to the real estate storage service database down judging module;
the backup log judging and acquiring module is used for acquiring backup log data in the real estate backup database, and judging whether unsynchronized log data exist in the log data to be synchronized in the real estate storage service database downtime judging module according to the acquired real estate backup log data:
If the log data to be synchronized has unsynchronized log data, executing an import data module;
if the log data to be synchronized does not have unsynchronized log data, executing a data sending module;
the import data module is used for importing the unsynchronized log data acquired in the real estate storage service database downtime judging module into the backup log data acquired in the backup log judging and acquiring module;
the data sending module is used for sending the backup log data and the final check value to the appointed client; in order to ensure the security of the backup log data and the final check value, the backup log data is encrypted by using an SM4 symmetric KEY SM4_KEY and then sent to the appointed client;
the data recovery module is used for carrying out data recovery on the real estate storage service database by utilizing the received backup log data after judging the received backup log data by utilizing the received final check value. The client decrypts the received encrypted backup log data and the final check value by using an SM4 symmetric KEY SM4_KEY to obtain decrypted backup log data and the final check value; the method for obtaining the SM4 symmetric KEY SM4_KEY by the server side comprises the following steps:
Firstly, a client sends a request for acquiring an SM2 public key to a server, and the server stores an SM2 public key SM2_PUBKEY and an SM2 private key SM2_PRIKEY pair;
the second step, after receiving the SM2 public key request sent by the client, the server returns the SM2 public key SM2_PUBKEY to the client in a plaintext form;
thirdly, after receiving the SM2 public KEY SM2_PUBKEY sent by the server side, the client side generates an SM4 symmetric KEY SM4_KEY;
step four, using SM2 public KEY SM2_PUBKEY to encrypt SM4 symmetric KEY SM4_KEY to obtain ciphertext ENSM4K, and sending ciphertext ENSM4K to the server;
fifthly, after receiving the ciphertext ENSM4K sent by the client, the server decrypts the received ciphertext ENSM4K by using the SM2 private KEY SM2_PRIKEY to obtain an SM4 symmetric KEY SM4_KEY, and at this time, the server obtains the SM4 symmetric KEY SM4_KEY, so as to ensure the communication inquiry between the client and the server, and the method further comprises the following steps:
sixthly, the server generates a communication identifier TK, establishes association between the communication identifier TK and an SM4 symmetric KEY SM4_KEY to form a KV KEY value pair, and stores the KV KEY value pair in a cache server; carrying out SM4 symmetric encryption on the communication identifier TK by using an SM4 symmetric KEY SM4 KEY to obtain an encrypted identifier ENTK, and returning the encrypted identifier ENTK to the client;
And seventhly, the client performs SM4 symmetric decryption on the received encrypted identification ENTK by using an SM4 symmetric KEY SM4_KEY to obtain a communication identification TK. The SM4 symmetric KEY sm4_key has timeliness, which can be one hour, one day, one month, etc., after expiration, the SM4 symmetric KEY sm4_key can be updated, and for the sake of safety, the server side can also update the SM2 public KEY sm2_pubkey and the SM2 private KEY sm2_prikey pair simultaneously.
In a preferred embodiment of the present invention, a security determination module is included in the data recovery module, the security determination module being configured to determine security of the received backup log based on the client checkvalues and the received final checkvalues:
if the client check value is consistent with the received final check value, the received backup log is safe;
if the client check value is inconsistent with the received final check value, the received backup log is unsafe and has risk, the received backup log is deleted, and the server side is re-requested to send the backup log data and the final check value.
In a preferred embodiment of the present invention, the method for obtaining the client verification value from the received backup log includes the steps of:
S51, presetting a bit number G of binary mode data as a preset character length threshold at a client, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G by the client, wherein G is the number of the 1 st group, the 2 nd group, the 3 rd group, the … … th group and the G th group respectively, and G is the total group number;
s52, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; let g' =1;
s53, performing circular right shift according to the moving value i of the check value obtained in the step S52 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S52;
s54, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a client check value;
if g ' < g, g ' =g ' +1; returning to step S53.
In a preferred embodiment of the present invention, the method for calculating the division factor I in step S52 is as follows:
I＝(1-I)/I，
wherein I is a dividing factor;
1 represents a coefficient 1.
In a preferred embodiment of the present invention, the method for calculating the start value J of the check value in step S52 is as follows:
J＝int<I*2 G -I>，
wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
In a preferred embodiment of the present invention, the generation method of the movement value i of the check value in step S52 is as follows:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
In a preferred embodiment of the present invention, the method for calculating the total group number g in step S51 is as follows:
wherein, int < > represents a rounding-down algorithm;
g' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
if the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
If the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group.
In a preferred embodiment of the present invention, the method for pre-filling the characters in the g group comprises the following steps:
s511, the binary system of the preset alignment data is aligned with the lowest order of the characters in the g group, the preset alignment data is aligned with 0XH 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h ，
wherein h represents the total bit number of the preset filling data;
H h′ hexadecimal values of one of 0, 1, 2, 3, … …, F;
h' is a positive integer less than or equal to h and greater than or equal to 1;
s512, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S53 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
In a preferred embodiment of the present invention, the method for obtaining the final check value from the backup log includes the steps of:
s41, presetting a bit number G of binary mode data as a preset character length threshold at a server, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G, wherein the backup logs are respectively in a 1 st group, a 2 nd group, a 3 rd group, a … … th group and a G th group, and G is the total group number;
s42, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; let g' =1;
s43, performing circular right shift according to the moving value i of the check value obtained in the step S42 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S42;
s44, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a final check value;
if g ' < g, g ' =g ' +1; returning to step S43.
In a preferred embodiment of the present invention, the method for calculating the division factor I in step S42 is as follows:
I＝(1-I)/I，
Wherein I is a dividing factor;
1 represents a coefficient 1.
In a preferred embodiment of the present invention, the method for calculating the start value J of the check value in step S42 is as follows:
J＝int<I*2 G -I>，
wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
In a preferred embodiment of the present invention, the generation method of the movement value i of the check value in step S42 is as follows:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
In a preferred embodiment of the present invention, the method for calculating the total group number g in step S41 is as follows:
wherein, int < > represents a rounding-down algorithm;
g' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
If the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
if the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group.
In a preferred embodiment of the present invention, the method for pre-filling the characters in the g group comprises the following steps:
s411, filling the lowest bit of the characters in the g group with preset filling data to 0XH in a binary system 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h ，
wherein h represents the total bit number of the preset filling data;
H h′ hexadecimal values of one of 0, 1, 2, 3, … …, F;
h' is a positive integer less than or equal to h and greater than or equal to 1;
s412, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S43 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
The invention also discloses a method for realizing real estate registration data backup technology based on log analysis, as shown in figure 1, comprising the following steps:
s1, judging whether a real estate storage service database is down or not:
if the real estate storage service database is monitored to be down, acquiring log data to be synchronized in the real estate storage service database;
if the real estate storage service database is not monitored to be down, continuing waiting, and returning to the step S1;
s2, acquiring backup log data in the real estate backup database, and judging whether unsynchronized log data exist in the log data to be synchronized in the step S1 according to the acquired real estate backup log data:
if the log data to be synchronized has unsynchronized log data, executing the next step;
if the log data to be synchronized does not have unsynchronized log data, executing step S4;
s3, importing the unsynchronized log data obtained in the step S1 into the backup log data obtained in the step S2;
s4, sending the backup log data and the final check value to the appointed client;
S5, after the received backup log data is judged by using the received final check value, the received backup log data is used for carrying out data recovery on the real estate storage service database.
In step S4, the calculation method of obtaining the final collation value includes the steps of:
s41, presetting a bit number G of binary data as a preset character length threshold, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G, wherein the backup logs are respectively in a 1 st group, a 2 nd group, a 3 rd group, a … … th group and a G group, and G is the total group number; the calculation method of the total group number g is as follows:
wherein, int < > represents a rounding-down algorithm; the down-rounding algorithm indicates that if a fractional part is present, only the integer part is reserved, e.g., int (2.892) =2, int (1.715) =1, int (0.196) =0, int (6.342) =6.
G' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
if the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
If the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group; the method for carrying out preset filling on the characters in the g group comprises the following steps:
s411, filling the lowest bit of the characters in the g group with preset filling data to 0XH in a binary system 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h preferably, 0XA8C8739F is used.
Wherein h represents the total bit number of the preset filling data; 0X represents hexadecimal system, 0XH 1 H 2 H 3 …H h Converting into binary system with character length greater than or equal to preset character length threshold G;
H h′ hexadecimal values of one of 0, 1, 2, 3, … …, F;
h' is a positive integer less than or equal to h and greater than or equal to 2;
H 1 hexadecimal values of one of 1, 2, 3, … … and F;
s412, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
For example, backup log 3236345679821432093973 (0 XAF715190E73E8AFD 15), binary expressed as:
1010 1111 0111 0001 0101 0001 1001 0000 1110 0111 0011 1110 1000 1010 1111 1101 0001 0101；
Grouping according to a preset character length threshold of 32 bits, due to
Thus g=3, a total of three groups, group 1, group 2, group 3, respectively, wherein group 1 is 0XAF715190, expressed in binary form as:
1010 1111 0111 0001 0101 0001 1001 0000；
group 2 is 0XE73E8AFD, expressed in binary form as:
1110 0111 0011 1110 1000 1010 1111 1101；
group 3 is 0X15, expressed in binary form as:
0001 0101；
because the length of the 3 rd group of characters is not equal to 32 bits, carrying out data filling processing on the 3 rd group, taking 0XA as a starting point when filling data, sequentially filling subsequent data until the length is equal to 32 bits, and obtaining the data as follows:
0001 0101 1010 1000 1100 1000 0111 0011；
i.e. the data for the patch is 0XA8C873, the last set of data is eventually 0X15A8C873.
S42, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; the method for calculating the division factor I comprises the following steps:
the method for calculating the division factor I comprises the following steps:
∵I＞0
∴
wherein I is a dividing factor;
1 represents a coefficient 1.
The method for calculating the initial value J of the check value is as follows:
wherein, int < > is a downward rounding algorithm; i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
The generation method of the movement value i of the check value comprises the following steps:
/>
∵
∴
wherein i represents a movement value of the collation value;
I is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
S43, performing circular right shift according to the moving value i of the check value obtained in the step S42 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S42;
the current collation value used for the first time is the start value j= 2654435768 of the collation value calculated in step S42;
the binary manner is expressed as:
1001 1110 0011 0111 0111 1001 1011 1000；
the current check value is shifted by i=19, and j= 2654435768 is shifted by 19 bits in a loop, and the loop is shifted by 19 bits in the right direction, so that the following steps are obtained:
1110 1111 0011 0111 0001 0011 1100 0110；
s44, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a final check value;
if g ' < g, g ' =g ' +1; returning to step S43.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S43 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
In a preferred embodiment of the present invention, the security of the received backup log is determined in step S5 based on the client checkvalues and the received final checkvalues:
if the client check value is consistent with the received final check value, the received backup log is safe;
if the client check value is inconsistent with the received final check value, the received backup log is unsafe and has risk, the received backup log is deleted, and the server side is re-requested to send the backup log data and the final check value. The calculation method of the client side check value comprises the following steps:
s51, presetting a bit number G of binary mode data as a preset character length threshold at a client, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G by the client, wherein G is the number of the 1 st group, the 2 nd group, the 3 rd group, the … … th group and the G th group respectively, and G is the total group number;
s52, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; let g' =1;
S53, performing circular right shift according to the moving value i of the check value obtained in the step S52 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S52;
s54, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a client check value;
if g ' < g, g ' =g ' +1; returning to step S53.
In a preferred embodiment of the present invention, the method for calculating the division factor I in step S52 is as follows:
I＝(1-I)/I，
wherein I is a dividing factor;
1 represents a coefficient 1.
In a preferred embodiment of the present invention, the method for calculating the start value J of the check value in step S52 is as follows:
J＝int<I*2 G -I>，
wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the starting value of the check value.
In a preferred embodiment of the present invention, the generation method of the movement value i of the check value in step S52 is as follows:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents the collective character symbol belongs to.
In a preferred embodiment of the present invention, the method for calculating the total group number g in step S51 is as follows:
wherein, int < > represents a rounding-down algorithm;
g' represents the character length of the backup log;
g represents a preset character length threshold;
e represents that the aggregate character symbol belongs to;
Z + represents a positive integer set, Z + ＝{1，2，3，……}；
g represents the total group number;
judging whether the character length in the G group is equal to a preset character length threshold G:
if the number of characters in the G group is equal to a preset character length threshold G, the characters in the G group are not subjected to preset filling;
if the number of characters in the G group is smaller than a preset character length threshold G, carrying out preset filling on the characters in the G group.
In a preferred embodiment of the present invention, the method for pre-filling the characters in the g group comprises the following steps:
s511, the binary system of the preset alignment data is aligned with the lowest order of the characters in the g group, the preset alignment data is aligned with 0XH 1 As a starting point, the preset patch data is in the form of:
0XH 1 H 2 H 3 …H h ，
wherein h represents the total bit number of the preset filling data;
H h′ hexadecimal values of one of 0, 1, 2, 3, … …, F;
h' is a positive integer less than or equal to h and greater than or equal to 1;
s512, taking out one bit of data each time according to the sequence from the starting point of the preset filling data, filling the least significant bit of the characters in the g group until the bit number of the binary mode of the characters in the g group after filling is equal to the preset character length threshold value.
In a preferred embodiment of the present invention, the calculation method for generating the new collation value in step S53 is as follows:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' denotes the generation of a new collation value.
While embodiments of the present invention have been shown and described, it will be understood by those of ordinary skill in the art that: many changes, modifications, substitutions and variations may be made to the embodiments without departing from the spirit and principles of the invention, the scope of which is defined by the claims and their equivalents.
Claims (2)
1. The system for realizing the real estate registration data backup technology based on log analysis is characterized by comprising a real estate storage service database downtime judging module, a backup log judging and acquiring module, a data importing module, a data sending module and a data recovering module;
The data output end of the real estate storage service database downtime judging module is connected with the data input end of the backup log judging and acquiring module, the data output end of the backup log judging and acquiring module is connected with the data input end of the importing data module, the data output end of the importing data module is connected with the data input end of the transmitting data module, and the data output end of the transmitting data module is connected with the data input end of the data recovery module;
the real estate storage service database downtime judging module is used for judging whether the real estate storage service database is downtime or not:
if the real estate storage service database is monitored to be down, acquiring log data to be synchronized in the real estate storage service database;
if the real estate storage service database is not monitored to be down, continuing waiting, and returning to the real estate storage service database down judging module;
the backup log judging and acquiring module is used for acquiring backup log data in the real estate backup database, and judging whether unsynchronized log data exist in the log data to be synchronized in the real estate storage service database downtime judging module according to the acquired real estate backup log data:
if the log data to be synchronized has unsynchronized log data, executing an import data module;
If the log data to be synchronized does not have unsynchronized log data, executing a data sending module;
the import data module is used for importing the unsynchronized log data acquired in the real estate storage service database downtime judging module into the backup log data acquired in the backup log judging and acquiring module;
the data sending module is used for sending the backup log data and the final check value to the appointed client;
the data recovery module is used for carrying out data recovery on the real estate storage service database by utilizing the received backup log data after judging the received backup log data by utilizing the received final check value; the data recovery module comprises a security judging module which is used for judging the security of the received backup log according to the client check value and the received final check value:
if the client check value is consistent with the received final check value, the received backup log is safe; the method for obtaining the client verification value comprises the following steps:
s51, presetting a bit number G of binary mode data as a preset character length threshold at a client, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G by the client, wherein G is the number of the 1 st group, the 2 nd group, the 3 rd group, the … … th group and the G th group respectively, and G is the total group number;
S52, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; the method for calculating the division factor I comprises the following steps:
I＝(1-I)/I，
wherein I is a dividing factor;
1 represents a coefficient 1;
the method for calculating the initial value J of the check value is as follows:
J＝int<I*2 G -I>，
wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the initial value of the check value;
the generation method of the movement value i of the check value comprises the following steps:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents that the aggregate character symbol belongs to;
let g' =1;
s53, performing circular right shift according to the moving value i of the check value obtained in the step S52 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S52;
the new check value calculating method comprises the following steps:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' represents generating a new collation value;
s54, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a client check value;
if g ' < g, g ' =g ' +1; returning to step S53;
if the client check value is inconsistent with the received final check value, the received backup log is unsafe and has risk, the received backup log is deleted, and the server side is re-requested to send the backup log data and the final check value.
2. The method for realizing the real estate registration data backup technology based on log analysis is characterized by comprising the following steps of:
s1, judging whether a real estate storage service database is down or not:
if the real estate storage service database is monitored to be down, acquiring log data to be synchronized in the real estate storage service database;
if the real estate storage service database is not monitored to be down, continuing waiting, and returning to the step S1;
s2, acquiring backup log data in the real estate backup database, and judging whether unsynchronized log data exist in the log data to be synchronized in the step S1 according to the acquired real estate backup log data:
If the log data to be synchronized has unsynchronized log data, executing the next step;
if the log data to be synchronized does not have unsynchronized log data, executing step S4;
s3, importing the unsynchronized log data obtained in the step S1 into the backup log data obtained in the step S2;
s4, sending the backup log data and the final check value to the appointed client;
s5, after the received backup log data are judged by using the received final check value, the received backup log data are used for carrying out data recovery on the real estate storage service database; in step S5, the security of the received backup log is determined according to the client checkvalues and the received final checkvalues:
if the client check value is consistent with the received final check value, the received backup log is safe; the method for obtaining the client verification value comprises the following steps:
s51, presetting a bit number G of binary mode data as a preset character length threshold at a client, wherein G is a positive integer greater than or equal to 1, grouping backup logs from high to low according to the preset character length threshold G by the client, wherein G is the number of the 1 st group, the 2 nd group, the 3 rd group, the … … th group and the G th group respectively, and G is the total group number;
S52, calculating a starting value J of the check value by using the division factor I, and calculating a moving value I of the check value by using the division factor I; the method for calculating the division factor I comprises the following steps:
I＝(1-I)/I，
wherein I is a dividing factor;
1 represents a coefficient 1;
the method for calculating the initial value J of the check value is as follows:
J＝int<I*2 G -I>，
wherein, int < > is a downward rounding algorithm;
i is a dividing factor, and I is a positive number;
g is a preset character length threshold value,
j is the initial value of the check value;
the generation method of the movement value i of the check value comprises the following steps:
wherein i represents a movement value of the collation value;
i is a division factor;
g is a preset character length threshold;
int < > is a downward rounding algorithm;
odd number represents an even number;
even number represents an odd number;
{ odd number } represents an even set;
{ even number } represents an odd set;
e represents that the aggregate character symbol belongs to;
let g' =1;
s53, performing circular right shift according to the moving value i of the check value obtained in the step S52 by using the current check value, and calculating the check value subjected to circular right shift by i bits and the data in the g' th group to generate a new check value; the current collation value used for the first time is the start value J of the collation value calculated in step S52;
the new check value calculating method comprises the following steps:
wherein ,
a check value indicating that the loop has shifted right by i bits;
[ g '] represents the data within group g';
j' represents generating a new collation value;
s54, judging the relation between g' and g:
if g' =g, ending, and finally generating a new check value as a client check value;
if g ' < g, g ' =g ' +1; returning to step S53;
if the client check value is inconsistent with the received final check value, the received backup log is unsafe and has risk, the received backup log is deleted, and the server side is re-requested to send the backup log data and the final check value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210276577.XA CN114661524B (en) | 2022-03-21 | 2022-03-21 | Method for realizing real estate registration data backup technology based on log analysis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210276577.XA CN114661524B (en) | 2022-03-21 | 2022-03-21 | Method for realizing real estate registration data backup technology based on log analysis |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114661524A CN114661524A (en) | 2022-06-24 |
| CN114661524B true CN114661524B (en) | 2023-06-02 |
Family
ID=82032229
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210276577.XA Active CN114661524B (en) | 2022-03-21 | 2022-03-21 | Method for realizing real estate registration data backup technology based on log analysis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114661524B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW201103298A (en) * | 2009-03-25 | 2011-01-16 | Pacid Technologies Llc | Method and system for securing communication |
| CN111628953A (en) * | 2020-04-28 | 2020-09-04 | 珠海中慧微电子有限公司 | Method for reducing peak-to-average ratio of OFDM signal |
| CN113095212A (en) * | 2021-04-08 | 2021-07-09 | 武汉理工大学 | Face recognition method and system based on local sorting algorithm encryption |
| CN113590604A (en) * | 2021-08-04 | 2021-11-02 | 中国工商银行股份有限公司 | Service data processing method and device and server |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938350B (en) * | 2010-07-16 | 2012-06-06 | 黑龙江大学 | File encryption and decryption method based on combinatorial coding |
| CN102567146B (en) * | 2011-12-29 | 2014-01-22 | 北京握奇数据系统有限公司 | Log backup method and device and smart card |
| CN106407356B (en) * | 2016-09-07 | 2020-01-14 | 网易（杭州）网络有限公司 | Data backup method and device |
| CN107844386B (en) * | 2016-09-19 | 2020-11-27 | 北京金山云网络技术有限公司 | Data backup and recovery method and device |
| CN106447198A (en) * | 2016-09-28 | 2017-02-22 | 国网山东省电力公司电力科学研究院 | Power consumption checking method based on business expanding installation data |
| CN106910050A (en) * | 2017-04-17 | 2017-06-30 | 国网安徽省电力公司芜湖供电公司 | Based on the fixed electronic handing-over and automatic checking system and its operating method that are wirelessly transferred |
| CN111639132B (en) * | 2020-05-29 | 2023-06-06 | 中国联合网络通信集团有限公司 | Log synchronization method and equipment |
| CN111860888B (en) * | 2020-07-17 | 2022-09-06 | 国网江苏省电力有限公司 | Real-time monitoring and searching system and method for inspection state of unmanned aerial vehicle of power transmission line |
| CN112365373B (en) * | 2020-11-10 | 2022-07-12 | 四川大学 | Method for preserving and mutually recognizing electronic file on case |
| CN112905390A (en) * | 2021-03-31 | 2021-06-04 | 恒生电子股份有限公司 | Log data backup method, device, equipment and storage medium |
| CN113452522B (en) * | 2021-06-28 | 2022-09-13 | 杭州云象网络技术有限公司 | Hardware security module software implementation method based on state password, storage medium and device |
-
2022
- 2022-03-21 CN CN202210276577.XA patent/CN114661524B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW201103298A (en) * | 2009-03-25 | 2011-01-16 | Pacid Technologies Llc | Method and system for securing communication |
| CN111628953A (en) * | 2020-04-28 | 2020-09-04 | 珠海中慧微电子有限公司 | Method for reducing peak-to-average ratio of OFDM signal |
| CN113095212A (en) * | 2021-04-08 | 2021-07-09 | 武汉理工大学 | Face recognition method and system based on local sorting algorithm encryption |
| CN113590604A (en) * | 2021-08-04 | 2021-11-02 | 中国工商银行股份有限公司 | Service data processing method and device and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114661524A (en) | 2022-06-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5568554A (en) | Method for improving the processing and storage performance of digital signature schemes | |
| CN110768787B (en) | Data encryption and decryption method and device | |
| EP4007983A1 (en) | Systems and methods for generating signatures | |
| CN113824728B (en) | Network communication method and system based on data encryption | |
| WO2014075469A1 (en) | Method and device for information hiding | |
| CN110838912B (en) | Block chain-based key management method, device, equipment and computer medium | |
| CN112383397B (en) | Heterogeneous signcryption communication method based on biological characteristics | |
| CN110351297B (en) | Verification method and device applied to block chain | |
| CN110969431A (en) | Safe trusteeship method, equipment and system of block chain digital currency private key | |
| CN111222645A (en) | Management system and method based on Internet of things block chain quantum algorithm artificial intelligence | |
| CN111342961B (en) | Method for realizing data cross-platform sharing by configuring key pair | |
| CN115632880A (en) | Reliable data transmission and storage method and system based on state cryptographic algorithm | |
| CN108199836B (en) | Method and device for binding and unbinding key and equipment | |
| CN111740965B (en) | Internet of things equipment authentication method based on physical unclonable equation | |
| CN114661524B (en) | Method for realizing real estate registration data backup technology based on log analysis | |
| CN209881821U (en) | Intelligent identity recognition system based on 5G network | |
| CN109670827B (en) | Anti-quantum computation blockchain transaction method based on symmetric key pool | |
| CN111931194A (en) | Security monitoring big data processing method and device based on cloud computing | |
| CN112953716A (en) | Method and device for generating and verifying exchange code | |
| CN115423474A (en) | Transaction processing method and device based on chaotic mapping | |
| CN112507366B (en) | Method and system for efficiently aggregating multidimensional data in smart power grid | |
| CN114745689A (en) | Multi-time-segment data fusion method and system for wireless sensor network | |
| CN110059630B (en) | Verifiable outsourced monitoring video pedestrian re-identification method with privacy protection | |
| CN108200108B (en) | Asymmetric encryption algorithm and application thereof | |
| KR101974345B1 (en) | Data communication apparatus for connected vehicle supporting secure communication between vehicles via digital signature and operating method thereof |
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 |