Multi-measurement integrated surveying and mapping data management method and system

Abstract

The invention discloses a multi-measurement-in-one surveying and mapping data management method and system, and the method comprises the steps: pre-constructing RBAC access permissions between task nodes, and enabling the access permissions to comprise a surveying and mapping data range of a corresponding node role to access a current node; constructing a directed acyclic graph of the surveying and mapping task according to the RBAC access authority between each task node and the type of the surveying and mapping task, calling cross-node surveying and mapping data, generating verification parameters corresponding to surveying and mapping data according to each task type, and carrying out timeliness verification and surveying and mapping data standard verification on the surveying and mapping data; performing directed acyclic graph in-degree calculation on the current node, transferring to the next task node, and if at least one verification item of the current task node is not passed, returning to the previous task node; and calculating the in-degree value of each task node of all task chains of the surveying and mapping task in the directed acyclic graph, and selecting the surveying and mapping data task chain with the lowest sum in-degree value of the directed acyclic graph as an optimal task chain for output.

Description

Technical Field

[0001] This invention relates to the field of surveying and mapping technology, and in particular to a method and system for managing surveying and mapping data that integrates multiple surveys. Background Technology

[0002] In the field of surveying and mapping technology, existing surveying and mapping technologies have the problem of wasting surveying and mapping resources due to multiple commissions and multiple surveys. Furthermore, users often need to repeatedly submit materials for manual approval at multiple nodes. The manual approval at different nodes leads to low efficiency and long approval cycles in surveying and mapping approval.

[0003] Because the standards and accuracy requirements for surveying data differ in different tasks, and the standards and accuracy of existing surveying data results from different units are not uniform, data inconsistencies and errors can easily occur when applied to different tasks, thus affecting the progress of the tasks.

[0004] In addition, existing surveying and mapping data has technical problems such as mismatch in timeliness, lack of access rights, and leakage of sensitive surveying and mapping data when accessed across business departments. Summary of the Invention

[0005] One objective of this invention is to provide a method and system for managing surveying and mapping data that integrates multiple surveys. This method and system constructs a directed acyclic graph (DAG) based on the data retrieval dependencies of cross-departmental surveying and mapping tasks. It then constructs an adjacency list for each node in the DAG according to these dependencies. This adjacency list stores the node names and corresponding edges of each node pointing to all its neighboring nodes. The final task result is output at the last node of the DAG. Therefore, this invention eliminates the need to repeatedly submit surveying and mapping application materials at different nodes and to repeatedly perform surveying and mapping. Only after a single surveying and mapping task application, the invention automatically retrieves the required surveying and mapping data from the corresponding node on the task chain to complete the task. This makes the surveying and mapping task retrieval method using a directed acyclic graph simple and efficient.

[0006] Another objective of this invention is to provide a method and system for managing surveying and mapping data that integrates multiple measurements. This method and system construct a task verification mechanism based on the directed acyclic graph. When a task jumps to a corresponding task node, it first needs to perform multiple verifications on the timeliness and standards of the surveying and mapping data corresponding to that task node. If verification fails, the current task node jumps to the previous task node and selects a new neighbor node from the previous task node as the next task node, until all corresponding nodes meet the timeliness requirements and standards of the surveying and mapping data. Therefore, this invention effectively ensures that the standards of the surveying and mapping data on the task chain are unified and timely by combining the directed acyclic graph with the multiple verification method of surveying and mapping data, thereby avoiding contradictions and errors in task data calls and significantly improving the effectiveness and efficiency of task completion.

[0007] Another objective of this invention is to provide a method and system for managing surveying and mapping data that integrates multiple measurements. In the process of a node task, the method and system first perform multiple verifications on the timeliness and standards of the surveying and mapping data. Only when each verification item passes can the data flow to the next node for access. Therefore, when the surveying and mapping data of each node does not meet the corresponding timeliness and standards, the current node's task does not directly acquire the corresponding surveying and mapping data, but only acquires and verifies the formal data of the surveying and mapping data. This significantly reduces the possibility of data leakage at nodes where verification of directed acyclic graphs fails, and greatly improves the security of cross-departmental surveying and mapping data.

[0008] Another objective of this invention is to provide a method and system for managing surveying and mapping data that integrates multiple measurements. This method and system uses the RBAC algorithm to control access to nodes across departments or tasks. The RBAC algorithm assigns permissions to each node, and the permissions of each node to other nodes are used as the basis for constructing edges between nodes in the directed acyclic graph. This invention, through the RBAC algorithm, can effectively restrict access to other sensitive data of the current node by the accessing entity, thereby improving the security of cross-departmental or cross-task surveying and mapping data access.

[0009] To achieve at least one of the above-mentioned objectives, the present invention further provides a method for managing surveying and mapping data that integrates multiple measurements, the method comprising: Pre-build RBAC access permissions between each task node, where the access permissions include the mapping data range that the corresponding node role can access at the current node; A directed acyclic graph of surveying tasks is constructed based on the RBAC access permissions between each task node and the surveying task type, and cross-node surveying data retrieval is performed based on the directed acyclic graph. Based on each task type, corresponding verification parameters for the surveying and mapping data are generated. Based on the verification parameters, on the corresponding task node, verification of the timeliness and standard of the surveying and mapping data are first performed. If each of the verification items of the current task node passes, the in-degree of the directed acyclic graph is calculated for the current node, and the process moves to the next task node. If at least one verification item of the current task node fails, the process returns to the previous task node. Calculate the in-degree value of each task node in all task chains of the surveying task in the directed acyclic graph, and select the surveying data task chain with the lowest total in-degree value in the directed acyclic graph as the preferred task chain output.

[0010] According to a preferred embodiment of the present invention, the method for constructing the RBAC access permissions includes: obtaining the identity identifier of each task node; configuring a permission table in the current task node according to the mapping resources and task type of the current node; constructing a permission mapping table of identity identifiers for other nodes other than the current node according to the task type, for allocating corresponding permissions to other nodes; if the current node obtains an access request from another node, querying the permission mapping table of the identity identifiers of the other node according to the access request; if the access request contains a permission operation that does not exist in the permission mapping table of the identity identifiers of the other node, returning an error message; otherwise, returning the corresponding resources of the current node according to the access request.

[0011] According to another preferred embodiment of the present invention, the method for constructing the access permission further includes: constructing a resource service API, wherein the resource service API is connected to a resource entry point; if other nodes send a mapping service request message to the current node, the current node redirects the request to an authentication server; after receiving the request message, the authentication server verifies whether it satisfies the permission mapping table of the corresponding other node identity; if it does, it sends an authorization code to the other node; the other node sends the authorization code to the corresponding authentication server to obtain an access token; the other node generates an access request carrying the access token to access the resource service API; the resource service API verifies the validity of the access token; if the access token is valid, it sends the resource corresponding to the access request to the other node; wherein the access token contains encrypted token validity, issuer identity, audience identity, and business rule information.

[0012] According to another preferred embodiment of the present invention, the directed acyclic graph construction method includes: constructing a possible task node adjacency list of task nodes based on the surveying task name and surveying type, wherein the task node adjacency list includes different task nodes, wherein different task nodes are assigned upstream and downstream dependencies in the task node adjacency list according to the task type, wherein the upstream and downstream dependencies of task nodes are set according to the RBAC access permission settings, and if there are upstream and downstream RBAC access permissions for task nodes in the corresponding task type, then the upstream and downstream dependencies of the corresponding task nodes are defined in the task node adjacency list, and the directed acyclic graph is constructed based on the upstream and downstream dependencies of task nodes in the corresponding task type.

[0013] According to another preferred embodiment of the present invention, the directed acyclic graph construction method includes: initializing the in-degree value of each node according to the task type and the corresponding task node adjacency list, wherein the in-degree value represents the number of other upstream task nodes with which the current mapping task node has a dependency relationship; if all upstream task nodes with which the current task node has a dependency relationship complete the corresponding task, then the in-degree value of the current task node is 0; further, the current task node with an in-degree value of 0 is added to the task execution queue; the current task node in the task execution queue executes the corresponding task; and the in-degree value of the next task node of the current task node is determined according to the task execution result.

[0014] According to another preferred embodiment of the present invention, before executing the corresponding surveying task node of the current task node, a verification request including surveying data verification parameters is sent to the corresponding surveying task through the requesting end. The verification parameters of the surveying data include the requested task timestamp, task type label, surveying resource data name, and data standard verification parameters. The data standard type includes data specification standard verification parameters and data accuracy standard verification parameters. Timeliness key-value pairs, data specification key-value pairs, and data accuracy key-value pairs of the corresponding surveying data are pre-constructed in the corresponding task node. The timeliness key-value pairs, data specification key-value pairs, and data accuracy key-value pairs are queried according to the task type label in the verification request. If at least one of the timeliness verification and surveying data standard verification items does not meet the timeliness verification and surveying data standard verification items, the in-degree value of the current task node is incremented by 1, the surveying resource processing of the current task node is no longer executed, and the process returns to the previous task node of the current task node. The previous task node selects a new downstream neighbor node as the task node for processing.

[0015] According to another preferred embodiment of the present invention, the timeliness key-value pair includes a key-value pair structure with the corresponding task type name as the key and the corresponding surveying data name and timeliness range as the key values. When the current node obtains the verification request, it finds the key name of the corresponding task type name according to the task type tag, and finds the corresponding surveying data name and timeliness range. It then compares the corresponding surveying data name and the corresponding task timeliness range with the surveying data name and task timestamp in the request to perform timeliness verification of the corresponding task type. The data specification key-value pair is a key-value pair structure with the corresponding surveying resource data name as the key and the specification standard version to which the surveying resource data name belongs as the key value. After obtaining the corresponding surveying and mapping resource data name, the standard version of the surveying and mapping data is queried through the data specification key-value pair. The queried standard version is then compared with the data specification standard verification parameters. Similarly, the data precision key-value pair is a key-value pair structure with the corresponding surveying and mapping resource data name as the key and the precision value of the data corresponding to the corresponding surveying and mapping resource data name as the key. After obtaining the corresponding surveying and mapping resource data name, the corresponding surveying and mapping data precision is queried through the data precision key-value pair. The queried surveying and mapping data precision is then compared with the corresponding data precision standard verification parameters to determine whether the surveying and mapping data standard of the current node's surveying and mapping resource data meets the corresponding task type.

[0016] According to another preferred embodiment of the present invention, in the corresponding task type, when all task nodes of the directed acyclic graph have completed their tasks, the in-degree values ​​of all corresponding task nodes of each task chain that satisfy the timeliness verification and standard verification of the surveying and mapping data are statistically analyzed, and the initial sum of the in-degree values ​​of all corresponding task nodes of each task chain is calculated. The task chain with the smallest sum of in-degree values ​​is preferentially recommended as the preferred task chain of the corresponding task type.

[0017] To achieve at least one of the above-mentioned objectives, the present invention further provides a multi-measurement integrated surveying and mapping data management system, wherein the system executes the above-mentioned multi-measurement integrated surveying and mapping data management method.

[0018] The present invention further provides a computer-readable storage medium storing a computer program, which is executed by a processor to implement the above-described method for managing surveying and mapping data that integrates multiple measurements. Attached Figure Description

[0019] Figure 1 The diagram shown is a flowchart of a multi-measurement integrated surveying data management method according to the present invention. Detailed Implementation

[0020] The following description is intended to disclose the present invention and enable those skilled in the art to implement it. The preferred embodiments described below are merely examples, and other obvious variations will occur to those skilled in the art. The basic principles of the invention defined in the following description can be applied to other embodiments, modifications, improvements, equivalents, and other technical solutions that do not depart from the spirit and scope of the invention.

[0021] It is understood that the term "a" should be understood as "at least one" or "one or more," that is, in one embodiment, the number of an element can be one, while in another embodiment, the number of the element can be multiple, and the term "a" should not be understood as a limitation on the number.

[0022] Please combine Figure 1 This invention discloses a method and system for managing surveying and mapping data that integrates multiple measurements. The main steps of the method include: S01. Pre-build RBAC access permissions between each task node, where the access permissions include the mapping data range that the corresponding node role can access at the current node; S02. Construct a directed acyclic graph of surveying tasks based on the RBAC access permissions between each task node and the surveying task type, and perform cross-node surveying data retrieval for surveying tasks based on the directed acyclic graph. S03. Generate verification parameters for corresponding surveying and mapping data according to each task type, and perform timeliness verification and standard verification of surveying and mapping data on the corresponding task node according to the verification parameters. S04. If each of the verification items of the current task node passes, calculate the in-degree of the directed acyclic graph of the current node and move to the next task node. If at least one verification item of the current task node fails, return to the previous task node. S05. Calculate the in-degree value of each task node in all task chains of the surveying task in the directed acyclic graph, and select the surveying data task chain with the lowest total in-degree value of the directed acyclic graph as the preferred task chain output.

[0023] Since surveying data is typically generated by sensors or software including total stations, GNSS, laser scanners, UAV cameras, and BIM software, different sensors result in varying standards and accuracies in the surveying data. The accuracy of surveying data collected by different types of sensors, different personnel, and at different times will also vary significantly. Furthermore, surveying data has a certain time sensitivity; for example, it may become unusable due to human activities such as urban construction, boundary adjustments, and resource development, or it may contain errors due to natural factors such as geological activity, meteorological disasters, and hydrological changes. Therefore, the core technical problem solved by this invention is how to effectively manage the aforementioned surveying data, especially how to reduce the number of surveys, optimize the management of inefficient surveying data from multiple surveys to achieve low-frequency surveys, and enable effective retrieval of different surveying data to efficiently complete surveying tasks.

[0024] Specifically, this invention uses a directed acyclic graph (DAG) as the basis for executing surveying tasks, and combines surveying data timeliness verification and surveying data standard verification to verify the surveying data required in the surveying tasks. This achieves efficient management of surveying tasks, reduces unnecessary surveying activities, and improves the efficiency of the entire task chain. The specific method includes the following steps: First, the RBAC access permissions for each task node need to be determined according to the surveying task type. It should be noted that the RBAC access permissions described in this invention are a role-based access control technology, allocating corresponding permissions based on the role type in the access request. The role type in this invention refers to the identity identifier of all nodes other than the current task node. These identity identifiers are pre-recorded in the role database table by the current node, and further, corresponding surveying resource permissions are allocated according to the actual role in the corresponding surveying task type. This invention utilizes RBAC to construct the permission database table of the current node and constructs a mapping relationship between roles and permissions based on the surveying task type. The above method can be implemented through, but is not limited to, a database schema.

[0025] The above-described permission verification process based on RBAC access control includes the following steps: First, a mapping task request is sent to the current task node via a host computer or other dependent task nodes. The current node verifies the task request, wherein the verification method includes: obtaining the permission operations in the mapping task request, and searching for the corresponding permission operation set in the current task node's data table. If the current task node's permission operation set does not contain the corresponding permission operation in the mapping task request, the operation permission in the mapping task request is prohibited, and an error message or no permission message is returned. In this embodiment, RBAC access control is handled separately on each task node.

[0026] In another preferred embodiment of the present invention, in order to reduce repeated access to each task node and reduce the bandwidth consumption of the task nodes, the present invention provides an access control strategy based on an authentication server and a resource service API. The specific method includes: constructing a resource service API, wherein the resource service API connects to a resource entry point; if another node or a host computer sends a mapping service request message to the current node, the current node redirects the request to the authentication server AuthServer; after receiving the request message, the authentication server AuthServer verifies whether it satisfies the access mapping table of the corresponding other node's identity; if it does, it sends an authorization code Code to the other node; the other node sends the authorization code Code to the corresponding authentication server to obtain an access token Bearer Token; the other node carries the access token Bearer Token to generate an access request to access the resource service API; the resource service API verifies the validity of the access token; if the access token is valid, it sends the resource corresponding to the access request to the other node; wherein the access token Bearer Token contains encrypted token validity, issuer identity, audience identity, and business rule information; wherein when the access token Bearer Token... If at least one of the token's validity period, issuer identity, audience identity, or business rule information fails to meet the preset permission conditions of the current task node, a verification failure or error message will be returned. In the preferred embodiment described above, redirecting to the authentication server can significantly reduce the bandwidth consumption of the task node, and the Bearer Token can be repeatedly used in subsequent requests for quick and efficient access to the corresponding task node.

[0027] In another preferred embodiment of the present invention, access control for task nodes can be obtained based on role-based granularity using the RBAC access permission. In another preferred embodiment of the present invention, the present invention can also add attribute-based ABAC access permission control on the basis of the RBAC access permission. For example, after completing the RBAC access permission allocation for each task node based on role-based permissions, resource attribute access control can also be set, and resource attribute types can be defined. For example, the resource attribute types can be defined as laser scanning data, satellite image data, point cloud data, BIM modeling data, etc. The above different attribute data can be set to allow or deny access. Therefore, by combining the RBAC access permission control and the ABAC access permission control, a finer-grained access control can be obtained, so that other task nodes or host computers can only access the mapping resource data that they have permission to access, thereby greatly reducing the possibility of resource data leakage.

[0028] It is worth mentioning that the directed acyclic graph construction method described in this invention includes: initializing the in-degree value of each node according to the task type and the corresponding task node adjacency list, wherein the in-degree value represents the number of other upstream task nodes with which the current mapping task node has a dependency relationship. If all upstream task nodes with which the current task node has a dependency relationship complete the corresponding task, then the in-degree value of the current task node is 0. Further, the current task node with an in-degree value of 0 is added to the task execution queue. The current task node in the task execution queue executes the corresponding task, and the in-degree value of the next task node of the current task node is determined according to the task execution result. For example: If there exists a completed surveying task chain [A, B, C, D], where task node A is a vertex, task node A is the upstream dependency of task node B, and task node B is the upstream dependency of task node C, where task node B has 2 out-degrees, then task node C has 2 in-degrees; where task node D is the upstream dependency of task node C, the complete surveying task chain can be represented as [A(0), B(1), C(2), D(1)], where the parentheses represent the in-degree value of the current task node. The in-degree value has directionality, representing the dependency relationship between task nodes. The dependency relationship can be considered as the edge between nodes in a directed acyclic graph. At the start of the surveying task, task node A is a vertex, and the in-degree value of task node A is 0. At this time, task node A needs to be placed in the task execution queue for execution. When task node A is completed, the out-degree of the downstream dependency of task node A needs to be eliminated. At this time, the in-degree of the corresponding task node B is 0, so task node B is placed in the execution queue for execution of the corresponding task. When task node B completes two tasks, it outputs two out-degrees. These two out-degrees eliminate the two in-degrees of task node C. At this time, the in-degree value of task node C is 0. Task node C is then placed in the execution queue to execute the corresponding task until task D completes its corresponding task.

[0029] In one preferred embodiment of the present invention, a core technical means of the present invention lies in providing a non-contact core data verification method to verify whether the data of the corresponding task node is executable. That is, the present invention only verifies whether the format of the core mapping data of the corresponding task node meets the requirements. If the requirements are met, the core mapping data can be called; otherwise, the call fails. Therefore, the present invention adopts a non-contact verification method to reduce the collection of core mapping data, thereby significantly improving the security of mapping data and reducing the risk of mapping data leakage, even when the mapping data format does not meet the task standard requirements. The specific method includes the following steps: before executing the corresponding mapping task node of the current task node, a verification request including mapping data verification parameters is sent to the corresponding mapping task through the requesting end. The mapping data verification parameters include the requested task timestamp, task type label, and mapping... The resource data name and data standard verification parameters are specified, where the data standard type includes data specification standard verification parameters and data accuracy standard verification parameters. In the corresponding task node, key-value pairs for the timeliness, standard, and accuracy of the corresponding surveying and mapping data are pre-built. Based on the task type tag in the verification request, the key-value pairs for timeliness, standard, and accuracy are queried. If at least one of these does not meet the timeliness and surveying and mapping data standard verification items, the in-degree value of the current task node is incremented by 1, the current task node's surveying and mapping resource processing is stopped, and the process returns to the previous task node. The previous task node selects a new downstream neighbor node as the task node for processing.

[0030] It is worth mentioning that the timeliness key-value pairs include key-value pair structures with the corresponding task type name as the key and the corresponding surveying data name and timeliness range as the key values. When the current node obtains the verification request, it finds the key name of the corresponding task type name based on the task type tag, and then finds the corresponding surveying data name and timeliness range. It compares the corresponding surveying data name and corresponding task timeliness range with the surveying data name and task timestamp in the request to verify the timeliness of the corresponding task type. The data specification key-value pairs are key-value pair structures with the corresponding surveying resource data name as the key and the specification standard version to which the surveying resource data name belongs as the key value. When the current node obtains the verification request, it finds the key name of the corresponding task type name based on the task type tag, and then finds the corresponding surveying data name and timeliness range. When the current node obtains the verification request, it compares the key name of the corresponding task type name with the corresponding surveying resource data name and the specification standard version to which the surveying resource data name belongs. After retrieving the corresponding surveying and mapping resource data name, the standard version of the surveying and mapping data is queried using the data specification key-value pair. The queried standard version is then compared with the data specification standard verification parameters. Similarly, the data precision key-value pair is a key-value pair structure where the corresponding surveying and mapping resource data name is the key and the precision value of the data corresponding to the corresponding surveying and mapping resource data name is the key value. After retrieving the corresponding surveying and mapping resource data name, the corresponding surveying and mapping data precision is queried using the data precision key-value pair. The queried surveying and mapping data precision is then compared with the corresponding data precision standard verification parameters to determine whether the surveying and mapping data standard of the current node's surveying and mapping resource data meets the corresponding task type.

[0031] For example, the timeliness can be set in the task node to specify the deadline for calling the corresponding surveying and mapping data. If the requested timestamp is later than the deadline, the timeliness verification fails. In other preferred embodiments of the present invention, the timeliness can be triggered by specific conditions, such as the surveying and mapping resource data can only be called after a certain event is completed, or the surveying and mapping resource data can only be called before a certain event is completed. The surveying and mapping data standard can be, but is not limited to, national standards (GB) or European standards (EN). The test accuracy can be calculated by the number of decimal places. Since the standards to be unified for different types of task chains are different, and the accuracy requirements are also different, it is necessary to verify them separately through the above verification items in the present invention, so as to improve the overall effect of the surveying and mapping task chain.

[0032] To better complete the mapping task chain at a lower cost and higher efficiency, this invention, in the corresponding task type, when all task nodes of the directed acyclic graph have completed their tasks, statistically analyzes the in-degree values ​​of all corresponding task nodes in each task chain that satisfy the timeliness verification and standard verification of mapping data, and calculates the initial sum of the in-degree values ​​of all corresponding task nodes in each task chain. The task chain with the smallest sum of in-degree values ​​is preferentially recommended as the preferred task chain for the corresponding task type.

[0033] The processes described in the flowcharts above, as disclosed in the embodiments of this invention, can be implemented as computer software programs. The embodiments disclosed in this invention include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication component, and / or installed from a removable medium. When the computer program is executed by a central processing unit (CPU), the methods of this application are not limited to the aforementioned functions. It should be noted that the computer-readable medium described above in this application can be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wire segments, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this application, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in connection with an instruction execution system, apparatus, or device. In this application, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless segments, wire segments, optical fibers, RF, etc., or any suitable combination thereof.

[0034] The flow charts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, program segment, or a part of code, and the module, program segment, or a part of code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order than that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart, can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0035] Those skilled in the art should understand that the embodiments of the present invention described above and shown in the accompanying drawings are merely examples and do not limit the present invention. The purpose of the present invention has been fully and effectively achieved. The functions and structural principles of the present invention have been shown and explained in the embodiments. Without departing from the stated principles, the implementation of the present invention may have any variations or modifications.

Claims

1. A method for managing surveying and mapping data that integrates multiple measurements, characterized in that, The method includes: Pre-build RBAC access permissions between each task node, where the access permissions include the mapping data range that the corresponding node role can access at the current node; A directed acyclic graph of surveying tasks is constructed based on the RBAC access permissions between each task node and the surveying task type, and cross-node surveying data retrieval is performed based on the directed acyclic graph. Based on each task type, corresponding verification parameters for the surveying and mapping data are generated. Based on the verification parameters, on the corresponding task node, verification of the timeliness and standard of the surveying and mapping data are first performed. If each of the verification items of the current task node passes, the in-degree of the directed acyclic graph of the current node is calculated, and the process moves to the next task node. If at least one verification item of the current task node fails, the process returns to the previous task node. Calculate the in-degree value of each task node in all task chains of the surveying task in the directed acyclic graph, and select the surveying data task chain with the lowest total in-degree value in the directed acyclic graph as the preferred task chain output.

2. The method for managing surveying and mapping data integrating multiple measurements according to claim 1, characterized in that, The method for constructing RBAC access permissions includes: obtaining the identity identifier of each task node; configuring a permission table in the current task node according to the mapping resources and task type of the current node; constructing a permission mapping table of identity identifiers for other nodes other than the current node according to the task type, which is used to assign corresponding permissions to other nodes; if the current node obtains an access request from another node, querying the permission mapping table of the identity identifiers of the other node according to the access request; if the access request contains a permission operation that does not exist in the permission mapping table of the identity identifiers of the other node, then returning an error message; otherwise, returning the corresponding resources of the current node according to the access request.

3. The method for managing surveying and mapping data integrating multiple measurements according to claim 1, characterized in that, The method for constructing the access permissions includes: constructing a resource service API, wherein the resource service API connects to a resource entry point; if another node sends a mapping service request message to the current node, the current node redirects the request to an authentication server; after receiving the request message, the authentication server verifies whether it satisfies the permission mapping table of the corresponding other node's identity; if it does, it sends an authorization code to the other node; the other node sends the authorization code to the corresponding authentication server to obtain an access token; the other node generates an access request carrying the access token to access the resource service API; the resource service API verifies the validity of the access token; if the access token is valid, it sends the resource corresponding to the access request to the other node; wherein the access token contains encrypted token validity, issuer identity, audience identity, and business rule information.

4. The method for managing surveying and mapping data integrating multiple measurements according to claim 3, characterized in that, The method for constructing a directed acyclic graph includes: constructing a possible adjacency list of task nodes based on the surveying task name and surveying type. The adjacency list includes different task nodes, wherein different task nodes are assigned upstream and downstream dependencies according to the task type in the adjacency list. The upstream and downstream dependencies of the task nodes are set according to the RBAC access permission settings. If there are upstream and downstream RBAC access permissions for a task node in the corresponding task type, then the upstream and downstream dependencies of the corresponding task node are defined in the adjacency list. The directed acyclic graph is constructed based on the upstream and downstream dependencies of the task nodes in the corresponding task type.

5. The method for managing surveying and mapping data integrating multiple measurements according to claim 4, characterized in that, The method for constructing a directed acyclic graph includes: initializing the in-degree value of each node according to the task type and the corresponding task node adjacency list, wherein the in-degree value represents the number of upstream task nodes with which the current mapping task node has a dependency relationship. If all upstream task nodes with dependencies on the current task node complete their corresponding tasks, the in-degree value of the current task node is 0. The current task node with an in-degree value of 0 is then added to the task execution queue. The current task node in the task execution queue executes the corresponding task, and the in-degree value of the next task node of the current task node is determined according to the task execution result.

6. The method for managing surveying and mapping data integrating multiple measurements according to claim 1, characterized in that, Before executing the corresponding surveying task node of the current task node, a verification request including surveying data verification parameters is sent to the corresponding surveying task through the requesting end. The verification parameters of the surveying data include the requested task timestamp, task type tag, surveying resource data name, and data standard verification parameters. The data standard type includes data specification standard verification parameters and data accuracy standard verification parameters. Timeliness key-value pairs, data specification key-value pairs, and data accuracy key-value pairs of the corresponding surveying data are pre-built in the corresponding task node. The timeliness key-value pairs, data specification key-value pairs, and data accuracy key-value pairs are queried according to the task type tag in the verification request. If there is at least one verification item that does not meet the timeliness verification and surveying data standard verification, the in-degree value of the current task node is incremented by 1, the surveying resource processing of the current task node is no longer executed, and the process returns to the previous task node of the current task node. The previous task node selects a new downstream neighbor node as the task node for processing.

7. The method for managing surveying and mapping data integrating multiple measurements according to claim 6, characterized in that, The timeliness key-value pairs include key-value pair structures with the corresponding task type name as the key and the corresponding surveying data name and timeliness range as the key. When the current node obtains the verification request, it finds the key name of the corresponding task type name based on the task type tag, and then finds the corresponding surveying data name and timeliness range. It compares the corresponding surveying data name and corresponding task timeliness range with the surveying data name and task timestamp in the request to verify the timeliness of the corresponding task type. The data specification key-value pairs are key-value pair structures with the corresponding surveying resource data name as the key and the specification standard version to which the surveying resource data name belongs as the key. When the corresponding surveying resource data name is obtained... After obtaining the mapping resource data name, the mapping data standard version is queried using the data standard key-value pair. The queried standard version is then compared with the data standard verification parameters. Similarly, the data precision key-value pair is a key-value pair structure where the corresponding mapping resource data name is the key and the precision value of the data corresponding to the mapping resource data name is the key. After obtaining the corresponding mapping resource data name, the corresponding mapping data precision is queried using the data precision key-value pair. The queried mapping data precision is then compared with the corresponding data precision standard verification parameters to determine whether the mapping data standard of the current node's mapping resource data meets the corresponding task type.

8. The method for managing surveying and mapping data integrating multiple measurements according to claim 5, characterized in that, In the corresponding task type, when all task nodes of the directed acyclic graph have completed their tasks, the in-degree values ​​of all corresponding task nodes of each task chain that meet the timeliness verification and standard verification of the surveying and mapping data are counted, and the initial sum of the in-degree values ​​of all corresponding task nodes of each task chain is calculated. The task chain with the smallest sum of in-degree values ​​is preferentially recommended as the preferred task chain for the corresponding task type.

9. A multi-measurement integrated surveying and mapping data management system, characterized in that, The system executes a multi-measurement integrated surveying data management method as described in any one of claims 1-8.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that is executed by a processor to implement a multi-measurement integrated surveying data management method as described in any one of claims 1-8.

Images