CN110555129A - space image data interaction method and device based on alliance chain - Google Patents
space image data interaction method and device based on alliance chain Download PDFInfo
- Publication number
- CN110555129A CN110555129A CN201910759010.6A CN201910759010A CN110555129A CN 110555129 A CN110555129 A CN 110555129A CN 201910759010 A CN201910759010 A CN 201910759010A CN 110555129 A CN110555129 A CN 110555129A
- Authority
- CN
- China
- Prior art keywords
- data
- image data
- tracing
- space image
- interaction
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/70—Information retrieval; Database structures therefor; File system structures therefor of video data
- G06F16/71—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/70—Information retrieval; Database structures therefor; File system structures therefor of video data
- G06F16/73—Querying
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Abstract
the invention provides an application, which is applied to data interaction among a plurality of servers and optimizes the safety problem of data interaction of spatial image data, wherein the method comprises the following steps: establishing a consensus mechanism among a plurality of servers needing data interaction, and realizing data synchronization and verification of each server; coding the space image data of each server; cross-library tracing is carried out on data which is encoded in advance; and searching the spatial image data by using a data searching method established by a grid coding modulation technology so as to finish the interaction among the spatial image data of a plurality of servers. The invention rapidly retrieves and traces the space image data by a rapid practical Byzantine fault-tolerant consensus algorithm of space image data retrieval tracing based on the alliance chain, thereby realizing rapid retrieval of traceability of data.
Description
Technical Field
The invention belongs to the technical field of network communication, and particularly relates to a spatial image data interaction method and device based on a alliance chain.
Background
at present, large-scale data collection faces privacy risks, the problem of frequent privacy data leakage is solved, data security is more and more emphasized by people, space image data stored in a database relates to sensitive information such as a large amount of position information, the security problem of the data is particularly emphasized, meanwhile, the data volume of the space image data is huge, the relevance among the data is not strong, a set of unified management mechanism is lacked, the influence on the data use and management is caused, the time consumption and the efficiency are low during query, image preprocessing is added to encode and add an index mechanism to the space image data, and the unified and efficient management and data interaction of the space image data are facilitated. At present, a plurality of geographic information platforms containing abundant spatial image data are provided, and a set of efficient and safe interaction system is lacked among the platforms, which greatly hinders the development of the technology.
disclosure of Invention
In view of the foregoing disadvantages of the prior art, an object of the present invention is to provide a method and an apparatus for spatial image data interaction based on a federation chain.
in order to achieve the above and other related objects, the present invention provides a method for spatial image data interaction based on a federation chain, which is applied to data interaction among a plurality of servers, wherein a unified retrieval method is adopted among the plurality of servers, and the method for data interaction comprises:
Establishing a consensus mechanism among a plurality of servers needing data interaction, and realizing data synchronization and verification of each server;
coding the space image data of each server;
cross-library tracing is carried out on data which is encoded in advance;
and searching the spatial image data by using a data searching method established by a grid coding modulation technology so as to finish the interaction among the spatial image data of a plurality of servers.
Optionally, each server includes a master node and a plurality of slave nodes subordinate to the master node, and the mechanism for establishing consensus includes:
and (3) rapidly proposing and interacting: generating proposal information by a main node of a server needing data interaction, and putting block information to be interacted into a public area;
and a data synchronization stage: synchronizing the information of the blocks to be interacted, which are put into a public area by a data exchange party, and sending the synchronized information to the slave node;
a verification stage: and after receiving the synchronized information of the blocks to be interacted, the slave node verifies, if the synchronized information of the blocks to be interacted is legal, the slave node verifies successfully, and the slave node sends the information to the master node.
optionally, the encoding the spatial image data of each server includes:
Preprocessing an image to generate a binary code, and establishing a grid unit corresponding relation between space image data in a database, wherein the binary code comprises space information;
Establishing an index table among data;
matching the binary codes;
and carrying out decoding processing on the retrieved coded data.
optionally, the cross-library tracing on the spatial image data that is encoded in advance includes:
Step1, firstly, a server puts forward a block data query request;
step2, judging whether the block data to be inquired cross the database or not;
step3, if the cross-database needs to establish a consensus mechanism, a consensus request is made, a block header hash value is read, a transaction index table is generated on the basis of the transaction table, and the transaction index table records user state information including the ID of a user, data interaction records, credit and whether to perform data interaction online;
step4, verifying the block data, and if the block data is the space image data, tracing according to a tracing mechanism; the tracing mechanism is as follows: entering a database to obtain current block space image data, registering a user ID, obtaining user state information, and determining whether the space image data can be read or not by judging the credit degree of the user state information;
Step5, obtaining authorization to read the space image data after verification, and rapidly reading the space image data according to a space image data indexing mechanism;
step6, exiting after the tracing is finished, and tracing to a corresponding block according to the ID of the previous block and continuing tracing if the tracing is not finished;
and Step7, directly acquiring the data of the current block from the non-cross-database data, judging the data, if the data is the spatial image data, tracing according to the tracing mechanism mentioned in Step4, and sequentially executing Step5 and Step6 to realize the reading tracing of the spatial image data.
in order to achieve the above and other related objects, the present invention further provides a device for spatial image data interaction based on a federation chain, which is applied to data interaction among a plurality of servers, where a unified retrieval method is adopted among the plurality of servers, and the device includes:
the system comprises a creating module, a data synchronization module and a verification module, wherein the creating module is used for creating a consensus mechanism among a plurality of servers needing data interaction and realizing data synchronization and verification of each server;
the coding module is used for coding the space image data of each server;
The tracing module is used for performing cross-database tracing on data which is encoded in advance;
And the interaction module is used for retrieving the spatial image data by using a data retrieval method established by a grid coding modulation technology so as to complete interaction among the spatial image data of the plurality of servers.
optionally, each server includes a master node and a plurality of slave nodes subordinate to the master node, and the mechanism for establishing consensus includes:
And (3) rapidly proposing and interacting: generating proposal information by a main node of a server needing data interaction, and putting block information to be interacted into a public area;
and a data synchronization stage: synchronizing the information of the blocks to be interacted, which are put into a public area by a data exchange party, and sending the synchronized information to the slave node;
A verification stage: and after receiving the synchronized information of the blocks to be interacted, the slave node verifies, if the synchronized information of the blocks to be interacted is legal, the slave node verifies successfully, and the slave node sends the information to the master node.
Optionally, the encoding the spatial image data of each server includes:
preprocessing an image to generate a binary code, wherein the binary code comprises spatial information;
establishing an index table among data;
Matching the binary codes;
And decoding the coded data obtained by searching to read the space image data.
optionally, the cross-library tracing on the spatial image data that is encoded in advance includes:
step1, firstly, a server puts forward a block data query request;
step2, judging whether the block data to be inquired cross the database or not;
Step3, if the cross-database needs to establish a consensus mechanism, a consensus request is made, a block header hash value is read, a transaction index table is generated on the basis of the transaction table, and the transaction index table records user state information including the ID of a user, data interaction records, credit and whether to perform data interaction online;
step4, verifying the block data, and if the block data is the space image data, tracing according to a tracing mechanism; the tracing mechanism is as follows: entering a database to obtain current block space image data, registering a user ID, obtaining user state information, and determining whether the space image data can be read or not by judging the credit degree of the user state information;
step5, obtaining authorization to read the space image data after verification, and rapidly reading the space image data according to an index mechanism;
step6, exiting after the tracing is finished, and tracing to a corresponding block according to the ID of the previous block and continuing tracing if the tracing is not finished;
and Step7, directly acquiring the data of the current block from the non-cross-database data, judging the data, if the data is the spatial image data, tracing according to the tracing mechanism mentioned in Step4, and sequentially executing Step5 and Step6 to realize the reading tracing of the spatial image data.
to achieve the above and other related objects, the present invention also provides an electronic terminal, comprising:
a memory for storing a computer program;
A processor for executing the computer program stored by the memory to cause the apparatus to perform the method.
To achieve the above and other related objects, the present invention also provides a computer-readable storage medium storing a computer program which, when executed by a processor, performs the method.
As described above, the method and apparatus for spatial image data interaction based on league chain according to the present invention have the following beneficial effects:
the invention rapidly retrieves and traces the space image data by a rapid practical Byzantine fault-tolerant consensus algorithm of space image data retrieval tracing based on the alliance chain, thereby realizing rapid retrieval of traceability of data.
drawings
To further illustrate the description of the present invention, the following detailed description of the embodiments of the present invention is provided with reference to the accompanying drawings. It is appreciated that these drawings are merely exemplary and are not to be considered limiting of the scope of the invention.
FIG. 1 is a flowchart illustrating an exemplary method for spatial image data interaction based on a federation chain;
FIG. 2 is a diagram illustrating a consensus mechanism in a federation chain-based spatial image data interaction method according to an embodiment;
FIG. 3 is a diagram illustrating a consensus mechanism in a method for spatial image data interaction based on a federation chain according to another embodiment;
FIG. 4 is a state transition diagram of a master node and a slave node in a spatial image data interaction method based on a federation chain according to an embodiment;
fig. 5 is a schematic view illustrating tracing of spatial image data in a spatial image data interaction method based on a federation chain according to an embodiment.
Detailed Description
the embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It is to be noted that the features in the following embodiments and examples may be combined with each other without conflict.
It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention, and the drawings only show the components related to the present invention rather than the number, shape and size of the components in practical implementation, and the type, amount and ratio of the components in practical implementation may be changed arbitrarily, and the layout of the components may be complicated.
firstly, a consensus mechanism is established among servers needing data interaction, the synchronization and verification of data of each database in a common agreement are realized through an improved Byzantine algorithm, namely a fast practical Byzantine fault-tolerant consensus mechanism (FPBFT), and then cross-library tracing is carried out on spatial image data which is coded in advance. The spatial image data is required to be processed by 'precoding-index table making-unified retrieval method' in advance, so that the spatial image data required to be kept secret can be shared based on a alliance chain, potential safety hazards such as falsification and counterfeiting of the spatial image data by an attacker can be effectively prevented, data circulation and operation processes can be completely recorded, and the secret spatial image data is prevented from being leaked. And finally, completing the retrieval of the spatial image data by utilizing a spatial image data retrieval method established by a grid coding technology, and completing cross-database data interaction.
As shown in fig. 1, the present embodiment provides a method for spatial image data interaction based on a federation chain, including the following steps:
S1, establishing a consensus mechanism among a plurality of servers needing data interaction, and realizing data synchronization and verification of each server;
S2 encoding the spatial image data of each server;
s3 cross-library tracing is carried out on the data which is encoded in advance;
s4 retrieves the spatial image data by using the data retrieval method established by the trellis coded modulation technique to complete the interaction between the spatial image data of the multiple servers.
The following is a detailed description of data interaction between two servers.
the invention provides a rapid practical Byzantine fault-tolerant consensus algorithm for cross-library space image data retrieval traceability based on a alliance chain, which is characterized in that space image data coded by grids is designed by a unified retrieval method and is combined with data traceability to establish a rapid spatial image data retrieval and traceability mechanism. The algorithm consists of a consensus mechanism, a space image data tracing part and a cross-database data interaction part, wherein the consensus mechanism consists of a mathematical model provided by an improved practical Byzantine consensus fault-tolerant mechanism, namely a rapid practical Byzantine fault-tolerant algorithm. The flow of the FPBFT algorithm is shown in FIG. 2 and FIG. 3.
Two types of nodes are involved in the cluster: the master nodes two (master1, master2) represent administrators of database a and database B, respectively, and the slave nodes three (slave1, slave2, slave3) represent data in the two databases. The set of two nodes is represented by R, and the maximum tolerable malicious node number in the set R is f, the size of the set R must satisfy the formula:
|R|≥3f+1 (1)
the invention improves the flow of the practical Byzantine fault-tolerant consensus algorithm, changes the original single-node broadcast into double-node broadcast, and can simultaneously broadcast the two databases. The two clients simultaneously broadcast the transaction data attached with the signature in the whole network, thereby improving the broadcasting efficiency and being faster. The original Byzantine fault-tolerant consensus algorithm has the problem of correctness because the master node is randomly selected, and the system efficiency is seriously reduced. Therefore, the invention provides that the two clients directly carry out the master node election, and the two clients carry out the master node election according to the longest chain principle, thereby ensuring the correctness, improving the operation efficiency of the system and reducing the unnecessary communication overhead. And then, establishing a data synchronization process, synchronizing the data of the two parties for one time, finally verifying the data of the slave nodes, and continuing to perform the next round of consensus mechanism if the verification is passed, namely the selected master node becomes a new master node. Assuming that the number of nodes in the whole network is N, a three-stage consensus process is completed, and the total number of times Z required for message transmission is:
Z＝N2-N (2)
the improved quick and practical Byzantine fault-tolerant consensus mechanism has the advantages that the total communication times N (N-1) of the two main nodes are reduced compared with the communication times of the original algorithm, and the communication overhead is greatly reduced. The steps of independently verifying the data synchronism and verifying the data are omitted, the improved algorithm is simplified, the query time is greatly saved, and the system efficiency is improved.
the fast practical Byzantine fault-tolerant consensus algorithm comprises the following specific steps:
step1. quick proposal and interaction phase: the host nodes of the two parties generate proposal information and put the information of the blocks to be interacted into a public area. Fig. 2 and 3 show that different locations are set for the master nodes of different databases, and the communication paths generated in the stages of rapid proposal and interaction and verification are different because the master nodes are different in location, so that visitors to different databases can be distinguished.
Step2. data synchronization phase: the two parties synchronize the block data to be interacted in the public area, and the block information can be ensured to be accessed together.
step3. verification phase: and after receiving the data block of the master node, the slave node verifies the data block, inspects whether the data block is legal or not, and if the data block is successfully verified by the legal rule, the slave node sends a message to the master node.
The block validity can be verified by utilizing the characteristics of the block chain, and the verification stage is used for monitoring whether the main node to be determined is legal or not in the data synchronization stage. If the main node is not elected illegally.
In one embodiment, a set of state conversion mechanism of the master node and the slave node is also established, so that the flexibility of the system is effectively improved, and the change of the master node and the slave node and the selection matching mode of the node path can be recorded. A master slave node state transition diagram is shown in fig. 4.
View numbers are denoted by integer v, request numbers are denoted by integer n, v +1, n +1, and n must be satisfied between the pipelines in a view when a view changes or encounters a new request:
H≥n≥h (3)
in the master-slave node state conversion mechanism, the master node is verified, and the data is processed step by step after verification, so that the consistency problem of the data caused by a network in the synchronization process is reduced, and the risks of tampering and counterfeiting of the data by a non-local database visitor are reduced. And after election, validity detection is added, so that the safety problem of the undetermined slave node in the synchronization process is avoided, the robustness of the system is improved, and the undetermined master node can be reselected in time when the safety problem exists.
the specific algorithm flow is as follows:
And step1, if the system has a main node, directly judging the main node and selecting a path. If no main node exists, election is needed, all nodes are in a searching state at the moment, the main node is elected, and the selected main node is in an undetermined state.
and step2, verifying the elected master node, wherein the master node is a formal master node only when the slave node exceeding 2f +1 passes the verification, the state of the master node is changed into master, then judging whether the database belongs to the master1 or 2, and selecting different paths according to different databases.
As shown in fig. 5, the process of encoding the spatial image data of each server includes: pre-coding, index table, uniform search method and decoding read data.
And step1, the spatial image data pre-coding process is based on a GeoSOT global subdivision grid coding mode, a binary code containing spatial information is formed by utilizing a quad-tree subdivision mode, the coding mode can establish a grid unit corresponding relation among spatial image data in a database, and the regional range of the spatial image data is expressed by subdivision grid units according to regional characteristics of the data.
Step2, establishing an index table among data, wherein the retrieval of grid codes can be realized by matching codes, and the codes generated by preprocessing the image by step1 can be directly matched with binary codes, so that the query of the spatial image data can be simplified, and the time and the efficiency are saved.
Step3. the unified retrieval method replaces the original complex spatial relationship judgment by using multi-type one-dimensional binary coding calculation, saves a large amount of longitude and latitude calculation, can effectively improve the retrieval efficiency and saves the system overhead.
A unified retrieval method is established among databases to realize the high-efficiency retrieval of sensitive data, namely space image data, simplify retrieval operation, and avoid the problems that the retrieval process is complicated and occupies too much storage resources due to different retrieval modes among the databases, thus increasing system overhead.
And step4, the user acquires the coded data after searching, and the coded data needs to be decoded to read the spatial image data.
cross-library tracing is performed on spatial image data that is encoded in advance, and the flow is shown in fig. 5.
for a scene of data interaction between two databases, firstly, it is clear that only cross-database related spatial image data is traced, and local user data can be directly accessed in the local database without being confidential, but the spatial image data can be traced by accessing the spatial image data, and information of used visitors is recorded, so that data circulation conditions can be tracked in real time, and for example, if data tampering and leakage conditions occur, the problem that which client the leaked data occurs can be traced in time. When cross-database data interaction is carried out, tracing is carried out only on sensitive confidential space image data, non-confidential data can be directly read, and a rapid data interaction mode among cross-databases is achieved.
The tracing implementation steps of the spatial image data are as follows:
step1, firstly, a request for inquiring the block data is provided by the server.
And step2, judging whether the data to be inquired cross the database or not.
Whether cross-database is available can be judged according to the initial position of the main node, the initial points of different database main nodes are different, and the communication paths are different.
and step3, if the cross-database needs to establish a consensus mechanism, proposing a consensus request and reading a block header hash value, and generating a transaction index table for subsequent data interaction on the basis of the transaction table, wherein the table records user state information including the ID of the user, data interaction records, the credit degree and whether the data interaction is carried out online.
and step4, verifying the block data, if the block data is the space image data, performing a subsequent tracing step, and directly reading the non-confidential space image data. The tracing step specifically comprises: after entering the database to obtain the current block space image data, the user ID is registered, the state information of the user is obtained from the transaction index table in step3, and whether the space image data can be read is determined by judging the credit degree of the user.
and step5, obtaining the authorization to read the space image data after the verification of step4, and quickly reading the space image data according to a space image data indexing mechanism.
The indexing mechanism comprises the following steps: the method comprises the steps of adopting a GeoSOT global subdivision grid to realize integral, integral and integral second quadtree subdivision on remote sensing space image data in a database, generating binary codes with spatial significance, establishing corresponding relations between the space image data in different databases and grid units according to spatial ranges, expressing the regional ranges of the space image data in the grid units according to regional characteristics of the data, and realizing logically uniform management of the space image data in different databases. The index table between the data is established, the retrieval of the grid codes can be realized by matching the codes, and the generated binary codes can directly match the codes, so that the query of the space image data can be simplified, and the time and the efficiency are saved. Different data are associated with spatial image data containing position information through grid coding, and when retrieval is carried out, the spatial image data are converted into spatial grid retrieval, so that a method for retrieving the association degree of data-grid (coding process) -data (decoding process) is realized, and the retrieval of the spatial image data is realized. The code index table field design is shown in table 1.
the specific indexing steps are as follows:
Designing a coding index table;
Inputting a query area;
Simplifying the input grid coding set;
taking out the grid coding entries meeting the requirements in the sorted coding index table;
And finding out corresponding data according to the corresponding data table and the ID of the extracted data entry.
TABLE 1 coded index Table field design
and step6, exiting the system after the tracing is finished, if the tracing is not finished, tracing to the corresponding block according to the ID of the previous block and continuously tracing.
and step7, directly acquiring the data of the current block for the non-cross-database data, judging the data, if the data is the spatial image data, tracing according to a tracing mechanism mentioned in step4, and sequentially executing step5 and step6 to realize the tracing of reading the spatial image data.
The invention rapidly retrieves and traces the space image data by a rapid practical Byzantine fault-tolerant consensus algorithm of space image data retrieval tracing based on the alliance chain, thereby realizing rapid retrieval of traceability of data.
in another embodiment, a federation chain-based spatial image data interaction apparatus is provided, which is applied to data interaction among a plurality of servers, and includes:
the system comprises a creating module, a data synchronization module and a verification module, wherein the creating module is used for creating a consensus mechanism among a plurality of servers needing data interaction and realizing data synchronization and verification of each server;
the coding module is used for coding the space image data of each server;
the tracing module is used for performing cross-database tracing on data which is encoded in advance;
and the interaction module is used for retrieving the spatial image data by using a data retrieval method established by a grid coding modulation technology so as to complete interaction among the spatial image data of the plurality of servers.
In one embodiment, each server comprises a master node and a plurality of slave nodes subordinate to the master node, and the mechanism for establishing consensus comprises:
And (3) rapidly proposing and interacting: generating proposal information by a main node of a server needing data interaction, and putting block information to be interacted into a public area;
and a data synchronization stage: synchronizing the information of the blocks to be interacted, which are put into a public area by a data exchange party, and sending the synchronized information to the slave node;
A verification stage: and after receiving the synchronized information of the blocks to be interacted, the slave node verifies, if the synchronized information of the blocks to be interacted is legal, the slave node verifies successfully, and the slave node sends the information to the master node.
In an embodiment, the encoding the spatial image data of each server includes:
preprocessing an image to generate a binary code, wherein the binary code comprises spatial information;
Establishing an index table among data;
Matching the binary codes;
Step3. the unified retrieval method replaces the original complex spatial relationship judgment by using multi-type one-dimensional binary coding calculation, saves a large amount of longitude and latitude calculation, can effectively improve the retrieval efficiency and saves the system overhead.
A unified retrieval method is established among databases to realize the high-efficiency retrieval of sensitive data, namely space image data, simplify retrieval operation, and avoid the problems that the retrieval process is complicated and occupies too much storage resources due to different retrieval modes among the databases, thus increasing system overhead.
and decoding the coded data obtained by searching to read the space image data.
in an embodiment, the cross-library tracing on the spatial image data that is encoded in advance includes:
Step1, firstly, a server puts forward a block data query request;
step2, judging whether the block data to be inquired cross the database or not;
Step3, if the cross-database needs to establish a consensus mechanism, a consensus request is made, a block header hash value is read, a transaction index table is generated on the basis of the transaction table, and the transaction index table records user state information including the ID of a user, data interaction records, credit and whether to perform data interaction online;
step4, verifying the block data, and if the block data is the space image data, tracing according to a tracing mechanism; the tracing mechanism is as follows: entering a database to obtain current block space image data, registering a user ID, obtaining user state information, and determining whether the space image data can be read or not by judging the credit degree of the user state information;
step5 obtains authorization to read the space image data after passing the verification, and the space image data is quickly read according to the space image data indexing mechanism.
the indexing mechanism comprises the following steps: the method comprises the steps of adopting a GeoSOT global subdivision grid to realize integral, integral and integral second quadtree subdivision on remote sensing space image data in a database, generating binary codes with spatial significance, establishing corresponding relations between the space image data in different databases and grid units according to spatial ranges, expressing the regional ranges of the space image data in the grid units according to regional characteristics of the data, and realizing logically uniform management of the space image data in different databases. The index table between the data is established, the retrieval of the grid codes can be realized by matching the codes, and the generated binary codes can directly match the codes, so that the query of the space image data can be simplified, and the time and the efficiency are saved. Different data are associated with spatial image data containing position information through grid coding, and when retrieval is carried out, the spatial image data are converted into spatial grid retrieval, so that a method for retrieving the association degree of data-grid (coding process) -data (decoding process) is realized, and the retrieval of the spatial image data is realized. The code index table field design is shown in table 1.
The specific indexing steps are as follows:
Designing a coding index table;
Inputting a query area;
Simplifying the input grid coding set;
taking out the grid coding entries meeting the requirements in the sorted coding index table;
And finding out corresponding data according to the corresponding data table and the ID of the extracted data entry.
TABLE 1 coded index Table field design
step6, exiting after the tracing is finished, and tracing to a corresponding block according to the ID of the previous block and continuing tracing if the tracing is not finished;
And step7, directly acquiring the data of the current block for the non-cross-database data, judging the data, if the data is the spatial image data, tracing according to a tracing mechanism mentioned in step4, and sequentially executing step5 and step6 to realize the reading tracing of the spatial image data.
It should be noted that, because the embodiment of the apparatus portion and the embodiment of the method portion correspond to each other, please refer to the description of the embodiment of the method portion for the content of the embodiment of the apparatus portion, which is not repeated here.
the invention also provides a storage medium storing a computer program which, when executed by a processor, performs the method as set forth above.
The present invention also provides an electronic terminal, comprising:
A memory for storing a computer program;
a processor for executing the computer program stored by the memory to cause the apparatus to perform the aforementioned method.
the computer program comprises computer program code which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer readable medium may comprise any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a Random Access Memory (RAM), a carrier wave signal, a telecommunications signal, a software distribution medium, etc.
The Processor may be a Central Processing Unit (CPU), or may be other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete Gate or transistor logic, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory may be an internal storage unit or an external storage device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital Card (SD), a Flash memory Card (Flash Card), and the like. Further, the memory may also include both an internal storage unit and an external storage device. The memory is used for storing the computer program and other programs and data. The memory may also be used to temporarily store data that has been or will be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or recited in a certain embodiment.
those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
in the embodiments provided by the present invention, it should be understood that the disclosed apparatus/terminal device and method can be implemented in other ways. For example, the above-described embodiments of the apparatus/terminal device are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
the foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or change the above-mentioned embodiments without departing from the spirit and scope of the present invention. Accordingly, it is intended that all equivalent modifications or changes which may be accomplished by those skilled in the art without departing from the spirit and scope of the present invention as set forth in the appended claims.
Claims (10)
1. a space image data interaction method based on a alliance chain is characterized in that the method is applied to data interaction among a plurality of servers, a unified retrieval method is adopted among the servers, and the data interaction method comprises the following steps:
establishing a consensus mechanism among a plurality of servers needing data interaction, and realizing data synchronization and verification of each server;
Coding the space image data of each server;
cross-library tracing is carried out on data which is encoded in advance;
And searching the spatial image data by using a data searching method established by a grid coding modulation technology so as to finish the interaction among the spatial image data of a plurality of servers.
2. The data interaction method of claim 1, wherein each server comprises a master node and a plurality of slave nodes subordinate to the master node, and the establishing a consensus mechanism comprises:
And (3) rapidly proposing and interacting: generating proposal information by a main node of a server needing data interaction, and putting block information to be interacted into a public area;
And a data synchronization stage: synchronizing the information of the blocks to be interacted, which is put into a public area by a data exchange party, and sending the synchronized information to the slave node;
a verification stage: and after receiving the synchronized information of the blocks to be interacted at the slave node, verifying the slave node, and if the synchronized information of the blocks to be interacted is legal, successfully verifying the synchronized information of the blocks to be interacted at the slave node, and sending the information to the master node by the slave node.
3. The data interaction method of claim 1, wherein the encoding the spatial image data of each server comprises:
preprocessing an image to generate a binary code, and establishing a grid unit corresponding relation between space image data in a database, wherein the binary code comprises space information;
establishing an index table among data;
Matching the binary codes;
and carrying out decoding processing on the retrieved coded data.
4. The data interaction method of claim 3, wherein the cross-library tracing of the pre-encoded spatial image data comprises:
step1, firstly, a server puts forward a block data query request;
Step2, judging whether the block data to be inquired cross the database or not;
step3, if the cross-database needs to establish a consensus mechanism, a consensus request is made, a block header hash value is read, a transaction index table is generated on the basis of the transaction table, and the transaction index table records user state information including the ID of a user, data interaction records, credit and whether to perform data interaction online;
Step4, verifying the block data, and if the block data is the space image data, tracing according to a tracing mechanism; the tracing mechanism is as follows: entering a database to obtain current block space image data, registering a user ID, obtaining user state information, and determining whether the space image data can be read or not by judging the credit degree of the user state information;
Step5, obtaining authorization to read the space image data after verification, and rapidly reading the space image data according to a space image data indexing mechanism;
Step6, exiting after the tracing is finished, and tracing back to a corresponding block according to the ID of the previous block and continuing tracing back if the tracing back is not finished;
and Step7, directly acquiring the data of the current block from the non-cross-database data, judging the data, if the data is the space image data, tracing according to a tracing mechanism mentioned in Step4, and sequentially executing Step5 and Step6 to realize the reading and tracking of the space image data.
5. a space image data interaction device based on a alliance chain is characterized in that the device is applied to data interaction among a plurality of servers, a unified retrieval method is adopted among the servers, and the device comprises the following steps:
The system comprises a creating module, a data synchronization module and a verification module, wherein the creating module is used for creating a consensus mechanism among a plurality of servers needing data interaction and realizing data synchronization and verification of each server;
The coding module is used for coding the space image data of each server;
The tracing module is used for performing cross-database tracing on data which is encoded in advance;
And the interaction module is used for retrieving the spatial image data by using a data retrieval method established by a grid coding modulation technology so as to complete interaction among the spatial image data of the plurality of servers.
6. the data interaction device of claim 5, wherein each server comprises a master node and a plurality of slave nodes subordinate to the master node, and wherein the establishing a consensus mechanism comprises:
and (3) rapidly proposing and interacting: generating proposal information by a main node of a server needing data interaction, and putting block information to be interacted into a public area;
and a data synchronization stage: synchronizing the information of the blocks to be interacted, which is put into a public area by a data exchange party, and sending the synchronized information to the slave node;
a verification stage: and after receiving the synchronized information of the blocks to be interacted at the slave node, verifying the slave node, and if the verification by the rule combination is successful, sending the message to the master node by the slave node.
7. the data interaction device of claim 5, wherein the encoding of the spatial image data of each server comprises:
preprocessing an image to generate a binary code, wherein the binary code comprises spatial information;
establishing an index table among data;
matching the binary codes;
and decoding the coded data obtained by searching to read the space image data.
8. the data interaction device of claim 7, wherein the cross-library tracing of the pre-encoded spatial image data comprises:
step1, firstly, a server puts forward a block data query request;
step2, judging whether the block data to be inquired cross the database or not;
step3, if the cross-database needs to establish a consensus mechanism, a consensus request is made, a block header hash value is read, a transaction index table is generated on the basis of the transaction table, and the transaction index table records user state information including the ID of a user, data interaction records, credit and whether to perform data interaction online;
Step4, verifying the block data, and if the block data is the space image data, tracing according to a tracing mechanism; the tracing mechanism is as follows: entering a database to obtain current block space image data, registering a user ID, obtaining user state information, and determining whether the space image data can be read or not by judging the credit degree of the user state information;
Step5, obtaining authorization to read the space image data after verification, and rapidly reading the space image data according to an index mechanism;
step6, exiting after the tracing is finished, and tracing back to a corresponding block according to the ID of the previous block and continuing tracing back if the tracing back is not finished;
And Step7, directly acquiring the data of the current block from the non-cross-database data, judging the data, if the data is the space image data, tracing according to a tracing mechanism mentioned in Step4, and sequentially executing Step5 and Step6 to realize the reading and tracking of the space image data.
9. a computer-readable storage medium storing a computer program, characterized in that the computer program, when executed by a processor, performs the method of any one of claims 1 to 4.
10. An electronic terminal, comprising:
A memory for storing a computer program;
a processor for executing the computer program stored in the memory to cause the apparatus to perform the method of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910759010.6A CN110555129B (en) | 2019-08-16 | 2019-08-16 | Space image data interaction method and device based on alliance chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910759010.6A CN110555129B (en) | 2019-08-16 | 2019-08-16 | Space image data interaction method and device based on alliance chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110555129A true CN110555129A (en) | 2019-12-10 |
| CN110555129B CN110555129B (en) | 2022-02-18 |
Family
ID=68737613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910759010.6A Active CN110555129B (en) | 2019-08-16 | 2019-08-16 | Space image data interaction method and device based on alliance chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110555129B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111369266A (en) * | 2020-03-03 | 2020-07-03 | 珠海市一堂科技有限公司 | Technological product source tracing method based on block chain |
| CN111586168A (en) * | 2020-05-06 | 2020-08-25 | 恒宝股份有限公司 | Waterline height changing and setting method |
| CN112487459A (en) * | 2020-12-10 | 2021-03-12 | 浙江大学德清先进技术与产业研究院 | Remote sensing metadata chaining method based on alliance chain |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106991164A (en) * | 2017-03-31 | 2017-07-28 | 北京京东金融科技控股有限公司 | Method, device and electronic equipment that finance data is handled are used for based on block chain |
| CN106991612A (en) * | 2017-03-31 | 2017-07-28 | 北京京东金融科技控股有限公司 | Method, device and the electronic equipment shared for finance data |
| CN107657553A (en) * | 2017-09-21 | 2018-02-02 | 浙江惠码科技有限公司 | A kind of electronic contract generation method based on alliance's chain, information anti-fake method of tracing to the source |
| US20180276668A1 (en) * | 2017-03-24 | 2018-09-27 | Alibaba Group Holding Limited | Method and apparatus for consensus verification |
| CN109766673A (en) * | 2019-01-18 | 2019-05-17 | 四川大学 | A kind of alliance's formula audio-video copyright block catenary system and audio-video copyright cochain method |
| CN109784916A (en) * | 2018-12-12 | 2019-05-21 | 广东工业大学 | A method of ether mill common recognition mechanism that improving PBFT is applied to alliance's chain |
| CN109872156A (en) * | 2019-03-11 | 2019-06-11 | 赛迪(青岛)区块链研究院有限公司 | A kind of alliance's chain common recognition system and method |
| US10326802B1 (en) * | 2018-12-04 | 2019-06-18 | Xage Security, Inc. | Centrally managing data for orchestrating and managing user accounts and access control and security policies remotely across multiple devices |
-
2019
- 2019-08-16 CN CN201910759010.6A patent/CN110555129B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180276668A1 (en) * | 2017-03-24 | 2018-09-27 | Alibaba Group Holding Limited | Method and apparatus for consensus verification |
| CN106991164A (en) * | 2017-03-31 | 2017-07-28 | 北京京东金融科技控股有限公司 | Method, device and electronic equipment that finance data is handled are used for based on block chain |
| CN106991612A (en) * | 2017-03-31 | 2017-07-28 | 北京京东金融科技控股有限公司 | Method, device and the electronic equipment shared for finance data |
| CN107657553A (en) * | 2017-09-21 | 2018-02-02 | 浙江惠码科技有限公司 | A kind of electronic contract generation method based on alliance's chain, information anti-fake method of tracing to the source |
| US10326802B1 (en) * | 2018-12-04 | 2019-06-18 | Xage Security, Inc. | Centrally managing data for orchestrating and managing user accounts and access control and security policies remotely across multiple devices |
| CN109784916A (en) * | 2018-12-12 | 2019-05-21 | 广东工业大学 | A method of ether mill common recognition mechanism that improving PBFT is applied to alliance's chain |
| CN109766673A (en) * | 2019-01-18 | 2019-05-17 | 四川大学 | A kind of alliance's formula audio-video copyright block catenary system and audio-video copyright cochain method |
| CN109872156A (en) * | 2019-03-11 | 2019-06-11 | 赛迪(青岛)区块链研究院有限公司 | A kind of alliance's chain common recognition system and method |
Non-Patent Citations (6)
| Title |
|---|
| RUZHI XU 等: "Design of Network Media’s Digital Rights Management Scheme Based on Blockchain Technology", 《INTERNATIONAL SYMPOSIUM ON AUTONOMOUS DECENTRALIZED SYSTEM》 * |
| WENTAO FU 等: "Spatial Image Data Traceability and Interaction Mechanism Based on Alliance Chain", 《SOFTWARE ENGINEERING AND SERVICE SCIENCE》 * |
| 乔蕊 等: "基于联盟链的物联网动态数据溯源机制", 《软件学报》 * |
| 李剑锋: "基于拜占庭容错机制的区块链共识算法研究与应用", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 * |
| 李莉 等: "基于区块链的数字版权交易系统", 《网络与信息安全学报》 * |
| 马俊鹏 等: "智能信息化时代的时空信息研究", 《导航定位学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111369266A (en) * | 2020-03-03 | 2020-07-03 | 珠海市一堂科技有限公司 | Technological product source tracing method based on block chain |
| CN111586168A (en) * | 2020-05-06 | 2020-08-25 | 恒宝股份有限公司 | Waterline height changing and setting method |
| CN111586168B (en) * | 2020-05-06 | 2022-04-08 | 恒宝股份有限公司 | Waterline height changing and setting method |
| CN112487459A (en) * | 2020-12-10 | 2021-03-12 | 浙江大学德清先进技术与产业研究院 | Remote sensing metadata chaining method based on alliance chain |
| CN112487459B (en) * | 2020-12-10 | 2023-08-04 | 浙江大学德清先进技术与产业研究院 | Remote sensing metadata uplink method based on alliance chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110555129B (en) | 2022-02-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109639714B (en) | Internet of things identity registration and verification method based on block chain | |
| CN110225095B (en) | Data processing method, device and system | |
| KR20210095915A (en) | Systems and methods for efficient and secure data processing, access and transmission via blockchain networks | |
| CN110555129B (en) | Space image data interaction method and device based on alliance chain | |
| WO2018228973A1 (en) | Improved hardware security module management | |
| WO2020024904A1 (en) | Method and device for searching blockchain data, and readable storage medium | |
| CN112231283B (en) | Generation management method and system based on multi-source heterogeneous data unified entity identification code | |
| CN111274268A (en) | Internet of things data transmission method, device, medium and electronic equipment | |
| CN102891856A (en) | Safe access method between plural entity and plural entity identity relaying party | |
| CN116226880A (en) | Block chain ciphertext retrieval security traceability system based on searchable encryption | |
| CN115114372A (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN112069529B (en) | Block chain-based volume management method and device, computer and storage medium | |
| Li et al. | BEIR: A blockchain-based encrypted image retrieval scheme | |
| CN113129008A (en) | Data processing method and device, computer readable medium and electronic equipment | |
| CN111339193B (en) | Category encoding method and device | |
| CN113011960A (en) | Block chain-based data access method, device, medium and electronic equipment | |
| Zhang et al. | Blockchain-assisted data sharing supports deduplication for cloud storage | |
| CN112487065A (en) | Data retrieval method and device | |
| CN112416875A (en) | Log management method and device, computer equipment and storage medium | |
| Dong et al. | DSPM: A platform for personal data share and privacy protect based on metadata | |
| CN112732789A (en) | Searchable encryption method based on block chain and electronic equipment | |
| Liu et al. | Secure and controllable data management mechanism for multi‐sensor fusion in internet of things | |
| Tao et al. | UEPF: A blockchain based Uniform Encoding and Parsing Framework in multi-cloud environments. | |
| CN112883038B (en) | Data management method based on block chain, computer and readable storage medium | |
| CN113300853B (en) | Financial credit information management method, device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20191210 Assignee: Guangxi Huantai Aerospace Technology Co.,Ltd. Assignor: GUILIN University OF ELECTRONIC TECHNOLOGY Contract record no.: X2022450000392 Denomination of invention: A method and device for spatial image data interaction based on alliance chain Granted publication date: 20220218 License type: Common License Record date: 20221226 |