Disclosure of Invention
The specification provides a block chain-based geospatial basic data sharing method and system, which are used for solving or partially solving the technical problems in the background art.
The specification discloses a geographic space basic data sharing method based on a block chain, which comprises the following steps:
acquiring first geospatial basic data from a current block chain node, wherein the current block chain node is a block chain node with a data sharing label, and the first geospatial basic data is data located in the current block chain node and used for recording a target geographic area;
under the condition that the data security level of the first geographic space basic data is the same as that of second geographic space basic data of a target block chain node, acquiring a shared data set in the first geographic space basic data, and writing the shared data set into a to-be-shared data set of the second geographic space basic data, which is the same as that of the first geographic space basic data;
under the condition that the data security level of the first geographic space basic data is different from that of the second geographic space basic data, acquiring the shared data set from the first geographic space basic data, performing data screening on the shared data set to obtain a target data set, and writing the target data set into a to-be-shared data set of the second geographic space basic data;
determining the data set to be shared of the second geographic space basic data as the data set to be issued after data sharing operation is performed on the current block chain link point; and releasing the data set to be released to a preset shared data pool according to a set time period cycle.
Optionally, the determining the data set to be shared of the second geospatial base data as the data set to be published after the data sharing operation is performed on the current block link point includes:
under the condition that the update frequency of the geospatial basic data in the target block chain node is a first update frequency, converting a data set to be shared of the second geospatial basic data into a first data flow queue in a data flow form;
under the condition that the update frequency of the geospatial basic data in the target block chain node is a second update frequency, converting a data set to be shared of the second geospatial basic data into a second data flow queue, wherein the second data flow queue is a dynamically adjustable queue;
performing data feature screening on the first data flow queue or the second data flow queue;
and determining the first data flow queue or the second data flow queue subjected to the data characteristic screening as a to-be-issued data set subjected to data sharing operation on the current block link point.
Optionally, the converting, in a case that the update frequency of the geospatial basic data in the target blockchain node is a first update frequency, the first data flow queue of the second geospatial basic data into a data flow format includes:
under the condition that the node state feature distribution of the current block chain node is dynamic distribution, determining each data field in the data set to be shared of the second geospatial basic data as a current data field, and executing the following steps until each data field in the data set to be shared of the second geospatial basic data is traversed: acquiring field attribute description data of the current data field; and inputting the field attribute description data into a preset queue conversion model to obtain a queue field of a first data field, wherein the first data field is a data field in the first data stream queue, and the data transmission coefficient of the current data field in the to-be-shared data set of the second geospatial basic data is the same as the data transmission coefficient of the first data field in the first data stream queue.
Optionally, when the update frequency of the geospatial basic data in the target blockchain node is a second update frequency, converting the to-be-shared data set of the second geospatial basic data into a second data flow queue, where the second data flow queue is a dynamically adjustable queue, and the converting includes:
under the condition that the node state feature distribution of the current block chain node is dynamic distribution, determining each data field in the data set to be shared of the second geospatial basic data as a current data field, and executing the following steps until each data field in the data set to be shared of the second geospatial basic data is traversed: acquiring attribute characteristics in field attribute description data of the current data field; determining the attribute characteristics as queue characteristics of a second data field, and obtaining a second data flow queue according to the queue characteristics; the second data field is a data field in the second data stream queue, and a data transfer coefficient of the current data field in the data set to be shared of the second geospatial basic data is the same as a data transfer coefficient of the second data field in the second data stream queue.
Optionally, when the data security level of the first geospatial basic data is different from the data security level of the second geospatial basic data, acquiring the shared data set from the first geospatial basic data, performing data screening on the shared data set to obtain a target data set, and writing the target data set into the to-be-shared data set of the second geospatial basic data includes:
determining each data field in the data set to be shared of the second geospatial basic data as a current data field, and executing the following steps until the data set to be shared of the second geospatial basic data is traversed: acquiring a target transmission path corresponding to a first transmission path of the current data field in the first geospatial basic data; acquiring four first data fields in the first geospatial basic data, wherein the four first data fields are related to the target transmission path in a path closed loop manner; determining a shared data set of a target data field by using a preset data sharing path list according to the four first data fields; determining the shared data set of the target data field as the shared data set of the current data field; and screening the shared data set to obtain a target data set, and writing the target data set into a data set to be shared of the second geospatial basic data.
Optionally, the obtaining a target delivery path corresponding to the first delivery path of the current data field in the first geospatial basic data includes:
acquiring a first relative proportion of the data set clustering factor of the first geospatial basic data and the data set clustering factor of the data set to be shared of the second geospatial basic data;
acquiring a second relative ratio of the spatial point cloud description value of the first geospatial basic data and the spatial point cloud description value of the data set to be shared of the second geospatial basic data;
determining a mapping relationship between the field label sequence of the current data field and the first relative scale as a field label sequence of the target delivery path; determining a mapping relation between the geographic identification sequence of the current data field and the second relative proportion as the geographic identification sequence of the target transmission path, wherein the first relative proportion and the second relative proportion are positive numbers;
and generating the target transmission path according to the field label sequence of the target transmission path and the geographic identification sequence of the target transmission path.
Optionally, the obtaining four first data fields of the first geospatial base data that are in closed-loop association with the target delivery path existing path includes:
determining an evaluation weight of a field correlation coefficient of each data field in the first geospatial basis data;
calculating the path correlation degree of the target transmission path and each field correlation coefficient according to the evaluation weight;
and determining four data fields corresponding to the minimum four path correlation degrees in the path correlation degrees as the first data field.
Optionally, the method further comprises:
receiving a data access request provided by a block link point to be detected aiming at the preset shared data pool;
performing data security verification on the block link points to be detected according to the data access request;
and when the block link point to be detected passes the data safety check, opening a data interface corresponding to the preset shared data pool to the block link point to be detected.
Optionally, performing data security check on the block link point to be detected according to the data access request includes:
determining a data tampering record of the block link point to be detected for the geographical position spatial data according to the data access request, and extracting first tampering evaluation data, second tampering evaluation data and third tampering evaluation data from the data tampering record; wherein the first tamper evaluation data, the second tamper evaluation data, and the third tamper evaluation data are tamper evaluation data of different time periods;
determining a first index difference value between a first data permission index corresponding to the first tampering evaluation data and a second data permission index corresponding to the second tampering evaluation data and a second index difference value between the second data permission index corresponding to the second tampering evaluation data and a third data permission index corresponding to the third tampering evaluation data;
for the first tampering evaluation data, performing data correction on the first tampering evaluation data by taking the first data authority index as a reference according to the first index difference value to obtain fourth tampering evaluation data; for the second tampering evaluation data, data correction is carried out on the second tampering evaluation data according to the second index difference value by taking the second data authority index as a reference, so as to obtain fifth tampering evaluation data; respectively performing data security level evaluation on the first tampering evaluation data, the second tampering evaluation data, the first tampering evaluation data, the fourth tampering evaluation data, the second tampering evaluation data, the third tampering evaluation data, the second tampering evaluation data and the fifth tampering evaluation data to obtain a first security level evaluation result, a second security level evaluation result, a third security level evaluation result and a fourth security level evaluation result;
determining a first result association weight between the first security level evaluation result and the second security level evaluation result and a second result association weight between the third security level evaluation result and the fourth security level evaluation result;
judging whether the first result association weight and the second result association weight are both located in a weight detection interval;
if so, determining a check index list for performing data security check on the to-be-detected block link point according to the first security level evaluation result and the third security level evaluation result, and performing data fusion on the first tampering evaluation data, the second tampering evaluation data and the third tampering evaluation data according to the check index list corresponding to the to-be-detected block link point to obtain an evaluation data matrix;
if not, respectively determining a first interval difference value and a second interval difference value between the first result association weight and the weight detection interval and between the second result association weight and the weight detection interval; comparing the magnitude of the first interval difference value and the magnitude of the second interval difference value; when the first interval difference value is smaller than the second interval difference value, determining a check index list for performing data security check on the to-be-detected block link point according to the first security level evaluation result and the second security level evaluation result, and performing data fusion on the first tampering evaluation data, the second tampering evaluation data and the third tampering evaluation data according to the check index list corresponding to the to-be-detected block link point to obtain an evaluation data matrix; when the first interval difference value is larger than the second interval difference value, determining a check index list for performing data security check on the to-be-detected block link point according to the third security level evaluation result and the fourth security level evaluation result, and performing data fusion on the first tampering evaluation data, the second tampering evaluation data and the third tampering evaluation data according to the check index list corresponding to the to-be-detected block link point to obtain an evaluation data matrix;
performing data safety check on the to-be-detected block link points based on the evaluation data matrix; if the matrix distribution characteristic value corresponding to the evaluation data matrix is the same as the node operation characteristic value corresponding to the block chain link point to be detected, judging that the block chain node to be detected passes data security check; and if the matrix distribution characteristic value corresponding to the evaluation data matrix is different from the node operation characteristic value corresponding to the block link point to be detected, judging that the block link point to be detected does not pass data safety check.
The specification discloses a geographic space basic data sharing system based on a block chain, which comprises a data sharing server and a plurality of block chain nodes, wherein the data sharing server is communicated with each other; wherein the data sharing server is configured to:
acquiring first geospatial basic data from a current block chain node, wherein the current block chain node is a block chain node with a data sharing label, and the first geospatial basic data is data located in the current block chain node and used for recording a target geographic area;
under the condition that the data security level of the first geographic space basic data is the same as that of second geographic space basic data of a target block chain node, acquiring a shared data set in the first geographic space basic data, and writing the shared data set into a to-be-shared data set of the second geographic space basic data, which is the same as that of the first geographic space basic data;
under the condition that the data security level of the first geographic space basic data is different from that of the second geographic space basic data, acquiring the shared data set from the first geographic space basic data, performing data screening on the shared data set to obtain a target data set, and writing the target data set into a to-be-shared data set of the second geographic space basic data;
determining the data set to be shared of the second geographic space basic data as the data set to be issued after data sharing operation is performed on the current block chain link point; and releasing the data set to be released to a preset shared data pool according to a set time period cycle.
The present specification discloses a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the above method.
The present specification discloses a data sharing server comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the above method when executing the program.
Through one or more technical schemes of this description, this description has following beneficial effect or advantage: the consistency comparison can be carried out on the data security level of the first geographic space basic data and the data security level of the second geographic space basic data, so that the consistency of data security evaluation between the current block chain node and the target block chain node is ensured. On the premise that the data security level of the first geospatial basic data is the same as or different from the data security level of the second geospatial basic data, the shared data set in the first geospatial basic data can be respectively determined, and the shared data set can be imported into the data set to be shared, so that the authenticity and the non-tamper property of the shared data can be ensured from the side of the block link point. In addition, the data set to be shared is determined as the data set to be issued after data sharing operation is performed on the current block chain node, calibration of a shared indication object of the shared geographic space basic data can be achieved, and the shared geographic space basic data is prevented from being accessed by unknown objects. And issuing the data sets to be issued to a preset shared data pool according to a set time period cycle, thereby realizing ordered data sharing.
The above description is only an outline of the technical solution of the present specification, and the embodiments of the present specification are described below in order to make the technical means of the present specification more clearly understood, and the present specification and other objects, features, and advantages of the present specification can be more clearly understood.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The embodiment of the specification provides a block chain-based geospatial basic data sharing method and a block chain-based geospatial basic data sharing system, and on the premise that the data security level of first geospatial basic data is the same as or different from the data security level of second geospatial basic data, a shared data set in the first geospatial basic data can be respectively determined, and the shared data set can be imported into a data set to be shared, so that the authenticity and non-tamper property of the shared data can be ensured from a block chain node side.
As an alternative embodiment, please refer to fig. 1, which illustrates a geospatial basic data sharing method based on a block chain, and the method is applied to a data sharing server, and the method may include the following steps S11-S14.
Step S11, obtaining first geospatial basis data from the current blockchain node.
In some examples, the current blockchain node is a blockchain link point at which a data sharing tag exists, and the first geospatial base data is data located in the current blockchain node for recording a target geographic region.
Step S12, when the data security level of the first geospatial basic data is the same as the data security level of the second geospatial basic data of the target block chain node, obtaining a shared data set in the first geospatial basic data, and writing the shared data set into a to-be-shared data set of the second geospatial basic data, which is the same as the data security level of the first geospatial basic data.
In some examples, the data security level is used to characterize data recovery performance after the geospatial base data is tampered with. The shared data set in the first geospatial basis data is part of the first geospatial basis data. The data set to be shared of the second geospatial elementary data is part of the second geospatial elementary data.
Step S13, when the data security level of the first geospatial basic data is different from the data security level of the second geospatial basic data, obtaining the shared data set from the first geospatial basic data, performing data screening on the shared data set to obtain a target data set, and writing the target data set into a to-be-shared data set of the second geospatial basic data.
In some examples, the target data set has a data security level that is higher than the data security level of the first geospatial basis data and a data security level that is higher than the data security level of the second geospatial basis data.
Step S14, determining the data set to be shared of the second geospatial basic data as the data set to be issued after the data sharing operation is performed on the current block link point; and releasing the data set to be released to a preset shared data pool according to a set time period cycle.
In some examples, the data sharing operation is performed by the current block link point according to user requirements. And the data format of the data set to be issued is the same as that of the preset shared data pool. The preset time period is determined according to the number of the block chain nodes communicated with the data sharing server, and the preset sharing data pool is configured in advance by the data sharing server.
In the above steps S11-S14, the tile link point may be an intelligent electronic device with data information transmission, processing and interaction functions, and the specific product form is not limited herein.
It is understood that based on the descriptions of the above steps S11-S14, the data security level of the first geospatial basic data and the data security level of the second geospatial basic data can be compared consistently, so as to ensure the consistency of the data security evaluation between the current blockchain node and the target blockchain node. On the premise that the data security level of the first geospatial basic data is the same as or different from the data security level of the second geospatial basic data, the shared data set in the first geospatial basic data can be respectively determined, and the shared data set can be imported into the data set to be shared, so that the authenticity and the non-tamper property of the shared data can be ensured from the side of the block link point. In addition, the data set to be shared is determined as the data set to be issued after data sharing operation is performed on the current block chain node, calibration of a shared indication object of the shared geographic space basic data can be achieved, and the shared geographic space basic data is prevented from being accessed by unknown objects. And issuing the data sets to be issued to a preset shared data pool according to a set time period cycle, thereby realizing ordered data sharing.
In some embodiments, the determining the to-be-shared data set of the second geospatial base data as the to-be-published data set after performing the data sharing operation on the current block link point described in step S14 includes: under the condition that the update frequency of the geospatial basic data in the target block chain node is a first update frequency, converting a data set to be shared of the second geospatial basic data into a first data flow queue in a data flow form; under the condition that the update frequency of the geospatial basic data in the target block chain node is a second update frequency, converting a data set to be shared of the second geospatial basic data into a second data flow queue, wherein the second data flow queue is a dynamically adjustable queue; performing data feature screening on the first data flow queue or the second data flow queue; and determining the first data flow queue or the second data flow queue subjected to the data characteristic screening as a to-be-issued data set subjected to data sharing operation on the current block link point. By the design, the data stream form conversion can be carried out on the data set to be shared of the second geospatial basic data based on the updating frequency, so that different data stream queues are obtained, and the data set to be issued is finally determined. This ensures the time-sequential continuity of the data sets to be published and the gradual change in the representation of the geographical location data.
Further, in a case that the update frequency of the geospatial elementary data in the target blockchain node is a first update frequency, the converting the to-be-shared data set of the second geospatial elementary data into a first data stream queue in the form of a data stream includes: under the condition that the node state feature distribution of the current block chain node is dynamic distribution, determining each data field in the data set to be shared of the second geospatial basic data as a current data field, and executing the following steps until each data field in the data set to be shared of the second geospatial basic data is traversed: acquiring field attribute description data of the current data field; and inputting the field attribute description data into a preset queue conversion model to obtain a queue field of a first data field, wherein the first data field is a data field in the first data stream queue, and the data transmission coefficient of the current data field in the to-be-shared data set of the second geospatial basic data is the same as the data transmission coefficient of the first data field in the first data stream queue.
Further, when the update frequency of the geospatial basic data in the target blockchain node is a second update frequency, converting the to-be-shared data set of the second geospatial basic data into a second data flow queue, where the second data flow queue is a dynamically adjustable queue, and the method includes: under the condition that the node state feature distribution of the current block chain node is dynamic distribution, determining each data field in the data set to be shared of the second geospatial basic data as a current data field, and executing the following steps until each data field in the data set to be shared of the second geospatial basic data is traversed: acquiring attribute characteristics in field attribute description data of the current data field; determining the attribute characteristics as queue characteristics of a second data field, and obtaining a second data flow queue according to the queue characteristics; the second data field is a data field in the second data stream queue, and a data transfer coefficient of the current data field in the data set to be shared of the second geospatial basic data is the same as a data transfer coefficient of the second data field in the second data stream queue.
In some examples, in step S13, in the case that the data security level of the first geospatial basic data is different from the data security level of the second geospatial basic data, the shared data set is obtained from the first geospatial basic data, data screening is performed on the shared data set to obtain a target data set, and the target data set is written into the to-be-shared data set of the second geospatial basic data, which may be implemented by the following content described in sub-step S13A.
Substep S13A, determining each data field in the to-be-shared data set of the second geospatial basic data as a current data field, and executing the following steps until traversing the to-be-shared data set of the second geospatial basic data: acquiring a target transmission path corresponding to a first transmission path of the current data field in the first geospatial basic data; acquiring four first data fields in the first geospatial basic data, wherein the four first data fields are related to the target transmission path in a path closed loop manner; determining a shared data set of a target data field by using a preset data sharing path list according to the four first data fields; determining the shared data set of the target data field as the shared data set of the current data field; and screening the shared data set to obtain a target data set, and writing the target data set into a data set to be shared of the second geospatial basic data. In this way, the target data sets can be independently written based on the target transfer paths, and data loss caused by mutual influence of the target data sets in the writing process is avoided.
On the basis of the above step S13A, the step of obtaining the target delivery path corresponding to the first delivery path of the current data field in the first geospatial basic data may include the following steps S1311 to S1314.
Step S1311, obtain a first relative proportion of the data set clustering factor of the first geospatial basic data and the data set clustering factor of the to-be-shared data set of the second geospatial basic data.
Step S1312 obtains a second relative ratio of the spatial point cloud description value of the first geospatial basic data and the spatial point cloud description value of the to-be-shared data set of the second geospatial basic data.
Step S1313, determining a mapping relationship between the field tag sequence of the current data field and the first relative proportion as the field tag sequence of the target transmission path; determining a mapping relation between the geographic identification sequence of the current data field and the second relative proportion as the geographic identification sequence of the target transmission path, wherein the first relative proportion and the second relative proportion are positive numbers.
Step S1314, generating the target delivery path according to the field tag sequence of the target delivery path and the geographic identification sequence of the target delivery path.
Therefore, the target transfer path can be generated completely, and interruption of the writing process can be avoided when the target data set is independently written based on the target transfer path, so that complete writing of the target data set is realized.
On the basis of the above step S13A, the step of obtaining four first data fields of the first geospatial basic data, which are associated with the target delivery path existence path closed loop, may further include the following sub-steps S1321 to S1323.
Step S1321, determining an evaluation weight of a field correlation coefficient of each data field in the first geospatial basic data.
Step S1322 is to calculate a path correlation degree between the target transmission path and each of the field correlation coefficients according to the evaluation weight.
Step S1323, determining four data fields corresponding to the minimum four path correlations among the path correlations as the first data field.
In practical applications, the inventor finds that, in order to ensure that the data in the preset shared data pool is not illegally accessed, thereby avoiding data tampering and data loss, the following steps S15 to S17 can be further designed on the basis of the above steps S11 to S14.
Step S15, receiving a data access request that is provided by the block link point to be detected for the preset shared data pool.
And step S16, performing data security check on the block link points to be detected according to the data access request.
And step S17, when the block link point to be detected passes the data safety check, opening the data interface corresponding to the preset shared data pool to the block link point to be detected.
By the design, the data in the preset shared data pool is ensured not to be illegally accessed, so that data tampering and data loss are avoided.
In practical implementation, the inventor finds that, when data security check is performed on a to-be-detected block chain node, a technical problem of hysteresis of a check result often occurs. In order to improve this technical problem, on the basis of step S16, the data security check is performed on the to-be-detected tile link point according to the data access request, and the following steps S161 to S166 may be further included.
Step S161, determining a data tampering record of the block link point to be detected for the geographical position spatial data according to the data access request, and extracting first tampering evaluation data, second tampering evaluation data and third tampering evaluation data from the data tampering record; wherein the first tamper evaluation data, the second tamper evaluation data, and the third tamper evaluation data are tamper evaluation data of different time periods.
Step S162, determining a first index difference value between a first data permission index corresponding to the first tampering evaluation data and a second data permission index corresponding to the second tampering evaluation data, and a second index difference value between a second data permission index corresponding to the second tampering evaluation data and a third data permission index corresponding to the third tampering evaluation data.
Step S163, performing data correction on the first tampering evaluation data according to the first index difference value with reference to the first data permission index to obtain fourth tampering evaluation data; for the second tampering evaluation data, data correction is carried out on the second tampering evaluation data according to the second index difference value by taking the second data authority index as a reference, so as to obtain fifth tampering evaluation data; and respectively performing data security level evaluation on the first tampering evaluation data, the second tampering evaluation data, the first tampering evaluation data, the fourth tampering evaluation data, the second tampering evaluation data, the third tampering evaluation data, the second tampering evaluation data and the fifth tampering evaluation data to obtain a first security level evaluation result, a second security level evaluation result, a third security level evaluation result and a fourth security level evaluation result.
In step S164, a first result association weight between the first security level evaluation result and the second security level evaluation result and a second result association weight between the third security level evaluation result and the fourth security level evaluation result are determined.
Step S165, judging whether the first result association weight and the second result association weight are both located in a weight detection interval; if so, determining a check index list for performing data security check on the to-be-detected block link point according to the first security level evaluation result and the third security level evaluation result, and performing data fusion on the first tampering evaluation data, the second tampering evaluation data and the third tampering evaluation data according to the check index list corresponding to the to-be-detected block link point to obtain an evaluation data matrix; if not, respectively determining a first interval difference value and a second interval difference value between the first result association weight and the weight detection interval and between the second result association weight and the weight detection interval; comparing the magnitude of the first interval difference value and the magnitude of the second interval difference value; when the first interval difference value is smaller than the second interval difference value, determining a check index list for performing data security check on the to-be-detected block link point according to the first security level evaluation result and the second security level evaluation result, and performing data fusion on the first tampering evaluation data, the second tampering evaluation data and the third tampering evaluation data according to the check index list corresponding to the to-be-detected block link point to obtain an evaluation data matrix; when the first interval difference is larger than the second interval difference, determining a check index list for performing data security check on the to-be-detected block link point according to the third security level evaluation result and the fourth security level evaluation result, and performing data fusion on the first tampering evaluation data, the second tampering evaluation data and the third tampering evaluation data according to the check index list corresponding to the to-be-detected block link point to obtain an evaluation data matrix.
Step S166, performing data safety check on the to-be-detected block link points based on the evaluation data matrix; if the matrix distribution characteristic value corresponding to the evaluation data matrix is the same as the node operation characteristic value corresponding to the block chain link point to be detected, judging that the block chain node to be detected passes data security check; and if the matrix distribution characteristic value corresponding to the evaluation data matrix is different from the node operation characteristic value corresponding to the block link point to be detected, judging that the block link point to be detected does not pass data safety check.
It can be understood that based on the descriptions in step S161 to step S166, different periods of time can be analyzed for the data tampering records of the geo-location spatial data of the block chain node to be detected, so as to determine different tampering evaluation data, so that an evaluation data matrix can be obtained based on the different tampering evaluation data. By comparing the matrix distribution characteristic value of the evaluation data matrix with the node operation characteristic value corresponding to the block link point to be detected, whether the block link point to be detected passes data safety verification or not can be determined in real time, the timeliness of the verification is ensured, and the verification delay is avoided.
Based on the same inventive concept as the foregoing embodiment, there is also provided a block chain based geospatial basic data sharing system, as shown in fig. 2, a block chain based geospatial basic data sharing system 200 includes a data sharing server 100 and a plurality of block chain nodes 300, which communicate with each other; wherein the data sharing server 100 is configured to:
acquiring first geospatial basic data from a current block chain node, wherein the current block chain node is a block chain node with a data sharing label, and the first geospatial basic data is data located in the current block chain node and used for recording a target geographic area;
under the condition that the data security level of the first geographic space basic data is the same as that of second geographic space basic data of a target block chain node, acquiring a shared data set in the first geographic space basic data, and writing the shared data set into a to-be-shared data set of the second geographic space basic data, which is the same as that of the first geographic space basic data;
under the condition that the data security level of the first geographic space basic data is different from that of the second geographic space basic data, acquiring the shared data set from the first geographic space basic data, performing data screening on the shared data set to obtain a target data set, and writing the target data set into a to-be-shared data set of the second geographic space basic data;
determining the data set to be shared of the second geographic space basic data as the data set to be issued after data sharing operation is performed on the current block chain link point; and releasing the data set to be released to a preset shared data pool according to a set time period cycle.
For the description of the above system, please refer to the description of the method shown in fig. 1, which is not described herein.
Based on the same inventive concept as in the previous embodiment, the embodiment of the present specification further provides a data sharing server, as shown in fig. 3, the data sharing server 100 includes a memory 104, a processor 102, and a computer program stored on the memory 104 and executable on the processor 102, and the processor 102 implements the steps of any one of the methods when executing the program.
Through one or more embodiments of the present description, the present description has the following advantages or advantages: the consistency comparison can be carried out on the data security level of the first geographic space basic data and the data security level of the second geographic space basic data, so that the consistency of data security evaluation between the current block chain node and the target block chain node is ensured. On the premise that the data security level of the first geospatial basic data is the same as or different from the data security level of the second geospatial basic data, the shared data set in the first geospatial basic data can be respectively determined, and the shared data set can be imported into the data set to be shared, so that the authenticity and the non-tamper property of the shared data can be ensured from the side of the block link point. In addition, the data set to be shared is determined as the data set to be issued after data sharing operation is performed on the current block chain node, calibration of a shared indication object of the shared geographic space basic data can be achieved, and the shared geographic space basic data is prevented from being accessed by unknown objects. And issuing the data sets to be issued to a preset shared data pool according to a set time period cycle, thereby realizing ordered data sharing.
The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, this description is not intended for any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present specification and that specific languages are described above to disclose the best modes of the specification.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the present description may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the specification, various features of the specification are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that is, the present specification as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this specification.
Those skilled in the art will appreciate that the modules in the embodiments may be adaptively changed and disposed in one or more devices different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the description and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
The various component embodiments of this description may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or Digital Signal Processor (DSP) may be used in practice to implement some or all of the functionality of some or all of the components of a gateway, proxy server, system in accordance with embodiments of the present description. The present description may also be embodied as an apparatus or device program (e.g., computer program and computer program product) for performing a portion or all of the methods described herein. Such programs implementing the description may be stored on a computer-readable medium or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the specification, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The description may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.