Spatial change data linked update method, system and device, and storage medium
By using spatial grid code and unique code to identify the associated data set when detecting changes in the geographic data set, and combining update rules for linkage update, the problem of linkage update of multi-source heterogeneous and multi-scale geographic vector data is solved, and the update efficiency and consistency are improved.
Patent Information
- Application Number
- PCT/CN2024/095066
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-12-24
- Filing Date
- 2024-05-24
- Publication Date
- 2025-07-03
AI Technical Summary
The prior art cannot quickly and accurately update the associated data in the associated data set, especially after multi-source heterogeneous and multi-scale geographic vector data change detection, there is a lack of effective linkage update methods.
When the original geographical dataset changes are detected, the candidate dataset spatial grid code is determined, combined with the incremental package spatial grid code and unique code, the associated dataset information is identified, and the linkage update is carried out according to the update rules, including the processing of data attribute information and blood relationships.
It improves the processing efficiency of data updates, ensures the version consistency and content timeliness of the basic data set and its associated data sets, and achieves fast and accurate linkage updates.
Smart Images

Figure CN2024095066_03072025_PF_FP_ABST
Abstract
Description
Spatial change data linkage update method, system, device and storage medium Technical Field
[0001] The present invention relates to the field of data processing technology, and in particular to a method, system, device and storage medium for linked updating of spatially varying data. Background Art
[0002] With the rapid development of geospatial, computer, network, and communications technologies, the methods for acquiring spatial data have become increasingly diverse, and the demand for its application is increasing. A massive amount of spatial data has accumulated, characterized by large volumes, complex and diverse structures and relationships, and strong autocorrelation. Different types of spatial data can be transformed through a series of processing steps. When data needs to be updated, existing technologies only enable change detection for multi-source, heterogeneous, and multi-scale geographic vector data, but do not address how to implement linked updates. Therefore, how to quickly and accurately link and update linked data within linked datasets has become a pressing issue.
[0003] The above content is only used to assist in understanding the technical solution of the present invention and does not constitute an admission that the above content is prior art.
[0004] Summary of the Invention
[0005] The main purpose of the present invention is to provide a method, system, device and storage medium for linking and updating spatially changing data, aiming to solve the technical problem of how to quickly and accurately link and update associated data in an associated data set.
[0006] To achieve the above-mentioned object, the present invention provides a method for updating spatially varying data in a linked manner, the method comprising:
[0007] When a data change is detected in the original geographic dataset, the spatial grid code of the candidate dataset corresponding to the dataset information to be updated is determined;
[0008] Determining associated dataset information according to the candidate dataset spatial grid code and the incremental packet spatial grid code;
[0009] Determine a unique code corresponding to the updated data in the incremental package, and determine the associated data in the associated data set information based on the unique code;
[0010] The to-be-updated data set information and the associated data are linked and updated according to the update data and update rules.
[0011] Optionally, the step of determining the associated data in the associated data set information according to the unique code includes:
[0012] Determining data attribute information according to the unique code;
[0013] Determining the data lineage relationship between the updated data and the associated data set information according to the data attribute information;
[0014] The associated data corresponding to the updated data is identified from the associated data set information according to the data lineage relationship.
[0015] Optionally, the step of performing a linkage update on the to-be-updated data set information and the associated data according to the update data and an update rule includes:
[0016] When the update rule is a simple update rule, the to-be-updated data set information and the associated data are updated respectively according to the update data;
[0017] After the data update is completed, check whether the updated data to be updated and the updated associated data are correct;
[0018] If the updated data to be updated and the updated associated data are correct, the linkage update between the data set information to be updated and the associated data is completed.
[0019] Optionally, the step of performing a linkage update on the to-be-updated data set information and the associated data according to the update data and an update rule includes:
[0020] When the update rule is a complex update rule, the to-be-updated data set information and the associated data are updated respectively according to the update data;
[0021] After the data update is completed, the road entity data is determined according to the updated data to be updated and the updated associated data;
[0022] Converting the road entity data into road mapping data, and determining whether the road mapping data has a conflicting area;
[0023] If the conflicting area exists, conflict processing is performed on the road mapping data to complete the linkage update between the to-be-updated dataset information and the associated data.
[0024] Optionally, the step of determining the candidate data set spatial grid code corresponding to the data set information to be updated includes:
[0025] Determining derived associated dataset category information based on the dataset information to be updated using dataset category association rules;
[0026] Determining the subcategory information of the linked dataset by using subcategory association rules according to the derived linked dataset category information;
[0027] Determining a linked dataset subclass spatial grid code according to the linked dataset subclass information;
[0028] The candidate data set spatial grid codes are determined according to the associated data set subclass spatial grid codes by using spatial grid code association rules.
[0029] Optionally, the step of determining the associated dataset information according to the candidate dataset spatial grid code and the incremental packet spatial grid code includes:
[0030] Determining a spatial grid code association relationship between the candidate data set spatial grid code and the incremental packet spatial grid code by using the spatial grid code association rule;
[0031] The associated data set information is determined according to the spatial grid code association relationship.
[0032] In addition, to achieve the above-mentioned purpose, the present invention further proposes a spatial variation data linkage update system, the spatial variation data linkage update system comprising:
[0033] A detection module is used to determine the spatial grid code of the candidate dataset corresponding to the dataset information to be updated when a data change is detected in the original geographic dataset;
[0034] A calculation module, configured to determine associated dataset information based on the candidate dataset spatial grid code and the incremental packet spatial grid code;
[0035] a determination module, configured to determine a unique code corresponding to the updated data in the incremental package, and determine the associated data in the associated data set information according to the unique code;
[0036] An updating module is configured to perform a linkage update on the to-be-updated data set information and the associated data according to the update data and an updating rule.
[0037] In addition, to achieve the above-mentioned purpose, the present invention also proposes a spatial change data linkage update device, which includes: a memory, a processor, and a spatial change data linkage update program stored in the memory and executable on the processor, wherein the spatial change data linkage update program is configured to implement the steps of the spatial change data linkage update method described above.
[0038] In addition, to achieve the above objectives, the present invention also proposes a storage medium, on which a spatial change data linkage update program is stored. When the spatial change data linkage update program is executed by a processor, the steps of the spatial change data linkage update method described above are implemented.
[0039] When the present invention detects a data change in the original geographic dataset, it first determines the spatial grid code of the candidate dataset corresponding to the dataset information to be updated. It then determines the associated dataset information based on the candidate dataset spatial grid code and the incremental package spatial grid code. It then determines the unique code corresponding to the updated data in the incremental package, and determines the associated data in the associated dataset information based on the unique code. Finally, based on the updated data, it applies update rules to the updated dataset information and the associated data. Compared to existing technologies that only detect changes in multi-source, heterogeneous, and multi-scale geographic vector data but do not explain how to perform linked updates, the present invention leverages the uniqueness, association, and location characteristics of unique codes to quickly identify specific data that needs to be updated, thereby improving update processing efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0040] 1 is a schematic diagram of the structure of a device for linking and updating spatially changing data in a hardware operating environment according to an embodiment of the present invention;
[0041] FIG2 is a flow chart of a first embodiment of a method for linking and updating spatially varying data according to the present invention;
[0042] FIG3 is a schematic diagram of a data processing flow of a first embodiment of a method for linking and updating spatially varying data according to the present invention;
[0043] FIG4 is a diagram showing a data set association relationship mapping relationship according to a first embodiment of the spatially varying data linkage updating method of the present invention;
[0044] FIG5 is a schematic diagram of spatial data type conversion according to a first embodiment of a method for linking and updating spatially changing data according to the present invention;
[0045] FIG6 is a simplified flowchart of the linkage update method for spatially varying data according to the first embodiment of the present invention;
[0046] 7 is a flowchart of a road parallel conflict check method according to a first embodiment of the spatially varying data linkage update method of the present invention;
[0047] FIG8 is a schematic diagram of a road intersection situation before and after processing of the first embodiment of the spatially varying data linkage updating method of the present invention;
[0048] FIG9 is a structural block diagram of the first embodiment of the spatial variation data linkage update system of the present invention.
[0049] The purpose, features and advantages of the present invention will be further described with reference to the accompanying drawings and in conjunction with the embodiments. DETAILED DESCRIPTION
[0050] It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.
[0051] 1 , which is a schematic diagram of a structure of a device for linking and updating spatially changing data in a hardware operating environment according to an embodiment of the present invention.
[0052] As shown in FIG1 , the spatial change data linkage update device may include: a processor 1001, such as a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. The communication bus 1002 is used to implement connection and communication between these components. The user interface 1003 may include a display screen and an input unit such as a keyboard. Optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a wireless fidelity (Wi-Fi) interface). The memory 1005 may be a high-speed random access memory (RAM) or a stable non-volatile memory (NVM), such as a disk storage. The memory 1005 may also be a storage system independent of the aforementioned processor 1001.
[0053] Those skilled in the art will understand that the structure shown in FIG1 does not constitute a limitation on the spatial variation data linkage update device, and may include more or fewer components than shown in the figure, or a combination of certain components, or a different arrangement of components.
[0054] As shown in FIG. 1 , the memory 1005 as a storage medium may include an operating system, a network communication module, a user interface module, and a space change data linkage update program.
[0055] In the spatial change data linkage update device shown in Figure 1, the network interface 1004 is mainly used for data communication with the network server; the user interface 1003 is mainly used for data interaction with the user; the processor 1001 and the memory 1005 in the spatial change data linkage update device of the present invention can be set in the spatial change data linkage update device. The spatial change data linkage update device calls the spatial change data linkage update program stored in the memory 1005 through the processor 1001 and executes the spatial change data linkage update method provided by the embodiment of the present invention.
[0056] An embodiment of the present invention provides a method for linked updating of spatially varying data. Referring to FIG. 2 , FIG. 2 is a flow chart illustrating a first embodiment of the method for linked updating of spatially varying data according to the present invention.
[0057] In this embodiment, the method for updating spatially varying data in a linked manner includes the following steps:
[0058] Step S10: When a data change is detected in the original geographic dataset, the spatial grid code of the candidate dataset corresponding to the dataset information to be updated is determined.
[0059] It is easy to understand that the execution subject of this embodiment can be a spatial change data linkage update system with functions such as data processing, network communication and program running, or other computer equipment with similar functions, etc., and this embodiment is not limited.
[0060] In a specific implementation, the original geographic data set can be understood as the geographic data currently stored in the system.
[0061] It should be understood that the original geographic dataset needs to be gridded using the global gridding framework of GeoSOT, and the divided grids need to be encoded to obtain the spatial grid code of the original geographic dataset.
[0062] It should also be noted that the original geographic dataset spatial grid code contains first-level spatial grid codes, second-level spatial grid codes, and third-level spatial grid codes.
[0063] The first-level space grid code includes the second-level space grid code, the second-level space grid code includes the third-level space grid code, and so on.
[0064] It should be noted that the incremental package spatial grid code is obtained through the grid coding engine based on the spatial grid code of the original geographic data set. The incremental package is the specific data that needs to be updated. The incremental package spatial grid code can be a second-level spatial grid code, or a third-level spatial grid code, etc.
[0065] Furthermore, the dataset information to be updated is determined based on the spatial grid code of the original geographic dataset and the spatial grid code of the incremental package, and the candidate dataset spatial grid code is determined through association rules based on the dataset information to be updated. The association rules include dataset category association rules, subcategory association rules and spatial grid code association rules.
[0066] In this embodiment, referring to FIG3 , FIG3 is a schematic diagram of a data processing flow of the first embodiment of the spatial change data identification method of the present invention. The information of the dataset to be updated includes the dataset to be updated and the spatial grid code of the dataset to be updated. The spatial grid code of the dataset to be updated can be a first-level spatial grid code. The information of the dataset to be updated can be dataset A or dataset B, etc., which is not limited in this embodiment.
[0067] It should also be noted that the dataset information to be updated is the dataset information that needs to be modified due to changes in the original geographic dataset, and the dataset information that needs to be modified includes specific data that needs to be modified and specific data that does not need to be modified.
[0068] Furthermore, the processing method for determining the candidate dataset spatial grid code through association rules based on the dataset information to be updated is to determine the derived associated dataset category information through dataset category association rules based on the dataset information to be updated; determine the associated dataset subcategory information through subcategory association rules based on the derived associated dataset category information; determine the associated dataset subcategory spatial grid code based on the associated dataset subcategory information; and determine the candidate dataset spatial grid code through spatial grid code association rules based on the associated dataset subcategory spatial grid code.
[0069] In this embodiment, in order to ensure the linkage changes of the basic dataset and its associated datasets, a three-level mapping rule including dataset category association rules, subcategory association rules and spatial grid code association rules is adopted. After the basic dataset (i.e., the dataset to be updated) changes, its associated datasets are quickly discovered and located, and then the changes of the associated datasets are completed. This can effectively ensure the version consistency and content timeliness of the basic dataset and its associated datasets.
[0070] The first-level association rules are dataset category association rules. The base dataset determines the category information of the derived association datasets (product datasets, thematic datasets, and service datasets); product datasets derive associated service datasets; and thematic datasets derive associated service datasets. Using dataset category association rules, when establishing associations, the datasets to be associated are first categorized, reducing the number of dataset association comparisons. Refer to Figure 4, which shows a dataset association mapping diagram for the first embodiment of the spatially varying data identification method of the present invention.
[0071] It should also be noted that the subcategory information of the linked dataset is determined through subcategory association rules based on the derived category information of the linked dataset.
[0072] The second-level association rules are sub-category association rules. By establishing a sub-category association rule mapping table, dataset types that require associations are searched in the sub-category association mapping table. Only datasets that meet the rules (i.e., the sub-category information of the associated datasets) can establish associations. For example, for a topographic map dataset, datasets that can be associated include surveying and mapping basic geographic entities, surveying and mapping thematic geographic entity datasets, surveying and mapping map library integrated products, and surveying and mapping raster tile services.
[0073] It should be understood that when the association rules need to be adjusted, only the following association mapping table needs to be modified:
[0074] It should also be noted that the spatial grid code of the associated dataset subclass is determined based on the associated dataset subclass information; the spatial grid code of the candidate dataset is determined based on the spatial grid code of the associated dataset subclass through the spatial grid code association rule. The third-level association rule is the spatial grid code association rule. Through the spatial grid code of the dataset, it is calculated whether the spatial range of the dataset has an intersection. Only when the datasets have an intersection can an association relationship be established. It mainly includes four intersection relationships: intersection, adjacent, separated, and inclusion. The spatial grid code association rule table is shown below:
[0075] Intersection relationship judgment mainly involves calculations to determine whether there is an intersection relationship between specified grids or grid sets; adjacent relationship judgment mainly involves calculations to determine whether there is an adjacent relationship between specified grids or grid sets, and what kind of adjacent relationship it is (edge adjacent, corner adjacent, and three-dimensional face adjacent, etc.); separation relationship judgment mainly involves calculations to determine whether two grids or grid sets are completely within the spatial range of the other.
[0076] It should also be noted that it is determined whether there is an intersection between the associated dataset subclass spatial grid code and the dataset to be updated spatial grid code, and the candidate dataset spatial grid code is determined based on the associated dataset subclass spatial grid codes that have an intersection.
[0077] It should also be noted that the associated dataset subclass spatial grid code can be a secondary spatial grid code. It is necessary to determine the primary spatial grid code based on the associated dataset subclass spatial grid code, and use the primary spatial grid code corresponding to the associated dataset subclass spatial grid code as the candidate dataset spatial grid code.
[0078] Step S20: Determine the associated dataset information according to the candidate dataset spatial grid code and the incremental packet spatial grid code.
[0079] In a specific implementation, the associated dataset information is determined according to the spatial grid code of the candidate dataset and the spatial grid code of the incremental packet through the spatial grid code association rule.
[0080] The associated dataset information includes the associated dataset space grid code and the associated dataset. It should be understood that the candidate dataset includes the associated dataset.
[0081] It should also be noted that the spatial grid code association relationship between the candidate dataset spatial grid code and the incremental packet spatial grid code is determined by the spatial grid code association rule, and the associated dataset information is determined based on the spatial grid code association relationship.
[0082] The spatial grid code association relationship may be an intersection relationship between the spatial grid codes.
[0083] Step S30: determining a unique code corresponding to the updated data in the incremental package, and determining the associated data in the associated data set information according to the unique code.
[0084] Furthermore, the processing method for determining the associated data in the associated data set information based on the unique code is to determine the data attribute information based on the unique code; determine the data lineage relationship between the updated data and the associated data set information based on the data attribute information; and identify the associated data corresponding to the updated data from the associated data set information based on the data lineage relationship.
[0085] In a specific implementation, unique code identification depends on the blood relationship between data. The spatial data described in this embodiment includes feature data sets, entity data sets, cartographic data sets, and tile service data sets; different types of data sets are transformed in the following ways: feature data is transformed into entity data through feature aggregation, combination, and set processing, and feature data is transformed into cartographic data through cartographic expression, feature symbolization, overlay processing, shifting, and interruption processing, and feature data is transformed into tile service data through symbolization processing and tile production; entity data can be transformed into cartographic data through cartographic expression, entity symbolization, overlay processing, shifting, and interruption processing, and entity data is transformed into tile service data through symbolization processing and tile production; cartographic data is transformed into tile service data through tile production. Refer to Figure 5, which is a schematic diagram of spatial data type conversion in the first embodiment of the spatial change data linkage update method of the present invention.
[0086] It's also important to note that unique code information is recorded in the data's attribute information. If data is related, the attribute information allows for quick retrieval of related data. For example, "a" might be a feature unique code, and "b" might be an entity unique code. If "b" is derived from "a," the unique code of "a" is recorded in "b"'s data attribute record. This allows for quick retrieval of the specific data that needs updating.
[0087] Step S40: Linkingly updating the to-be-updated data set information and the associated data according to the update data and the update rules.
[0088] Furthermore, a method for performing linkage updates on the dataset information to be updated and the associated data according to the update rule based on the update data is as follows: when the update rule is a simple update rule, the dataset information to be updated and the associated data are updated separately according to the update data; after the data update is completed, whether the updated data to be updated and the updated associated data are correct is checked; if the updated data to be updated and the updated associated data are correct, the linkage update between the dataset information to be updated and the associated data is completed.
[0089] In the specific implementation, refer to Figure 6, which is a simplified flowchart of the linkage update of the first embodiment of the spatial change data linkage update method of the present invention. For simple changes, the changes in the updated data in the update package are judged, and the same processing is performed on the data that needs to be associated and updated to achieve the first linkage update. After the update, the data is checked and found to be correct, and the linkage update of the current data is completed.
[0090] Furthermore, a processing method for linking and updating the dataset information to be updated and the associated data according to the update rules based on the update data is as follows: when the update rules are complex update rules, the dataset information to be updated and the associated data are updated separately according to the update data; after the data update is completed, the road entity data is determined based on the updated data to be updated and the updated associated data; the road entity data is converted into road mapping data, and it is determined whether there is a conflict area in the road mapping data; if there is a conflict area, the road mapping data is conflict processed to complete the linking update between the dataset information to be updated and the associated data.
[0091] In a specific implementation, refer to Figure 7, which illustrates a flowchart for parallel road conflict checking in the first embodiment of the spatially-variable data linkage update method of the present invention. For complex changes, after the simple changes described above, an additional operation, namely a second update, is required to obtain correct updated data. For example, for cartographic and publishing data, conflict checks must be performed before the second update based on different change scenarios, and then corresponding handling rules must be implemented.
[0092] This embodiment proposes common map expression conflict checking and handling rules, which mainly include polygon and discount conflict rules, road parallel conflict rules, and map symbol overlapping order rules.
[0093] It should also be understood that when road entity data is converted into road mapping data (i.e., a, b, and c in Figure 8), it needs to be symbolized. If there are road intersections after only simple changes, which is not in line with reality, it is necessary to judge based on the above rules and then interrupt and delete the line segments at the intersection to finally obtain usable current data.
[0094] Refer to Figure 8, which is a schematic diagram of the road intersection situation before and after processing of the first embodiment of the spatially varying data linkage update method of the present invention. In the figure, a is the image displayed by the road entity data before the update, b is the image displayed after the first linkage update, and c is the image displayed after the road mapping data is conflict processed.
[0095] In this embodiment, when a data change is detected in the original geographic dataset, the spatial grid code of the candidate dataset corresponding to the dataset to be updated is first determined. Then, the associated dataset information is determined based on the spatial grid code of the candidate dataset and the spatial grid code of the incremental package. The unique code corresponding to the updated data in the incremental package is then determined, and the associated data in the associated dataset information is determined based on the unique code. Finally, the updated dataset information and the associated data are linked and updated according to the update rules based on the updated data. Compared to the existing technology, which only detects changes in multi-source, heterogeneous, and multi-scale geographic vector data but does not explain how to perform linked updates, this embodiment leverages the uniqueness, association, and location characteristics of the unique code to quickly identify the specific data that needs to be updated, thereby improving the update processing efficiency.
[0096] 9 , which is a structural block diagram of a first embodiment of a spatially varying data linkage updating system according to the present invention.
[0097] As shown in FIG9 , the spatial change data linkage update system proposed in an embodiment of the present invention includes:
[0098] The detection module 9001 is used to determine the candidate dataset spatial grid code corresponding to the dataset information to be updated when a data change is detected in the original geographic dataset.
[0099] In a specific implementation, the original geographic data set can be understood as the geographic data currently stored in the system.
[0100] It should be understood that the original geographic dataset needs to be gridded using the global gridding framework of GeoSOT, and the divided grids need to be encoded to obtain the spatial grid code of the original geographic dataset.
[0101] It should also be noted that the original geographic dataset spatial grid code contains first-level spatial grid codes, second-level spatial grid codes, and third-level spatial grid codes.
[0102] The first-level space grid code includes the second-level space grid code, the second-level space grid code includes the third-level space grid code, and so on.
[0103] It should be noted that the incremental package spatial grid code is obtained through the grid coding engine based on the spatial grid code of the original geographic data set. The incremental package is the specific data that needs to be updated. The incremental package spatial grid code can be a second-level spatial grid code, or a third-level spatial grid code, etc.
[0104] Furthermore, the dataset information to be updated is determined based on the spatial grid code of the original geographic dataset and the spatial grid code of the incremental package, and the candidate dataset spatial grid code is determined through association rules based on the dataset information to be updated. The association rules include dataset category association rules, subcategory association rules and spatial grid code association rules.
[0105] In this embodiment, referring to FIG3 , FIG3 is a schematic diagram of a data processing flow of the first embodiment of the spatial change data identification method of the present invention. The information of the dataset to be updated includes the dataset to be updated and the spatial grid code of the dataset to be updated. The spatial grid code of the dataset to be updated can be a first-level spatial grid code. The information of the dataset to be updated can be dataset A or dataset B, etc., which is not limited in this embodiment.
[0106] It should also be noted that the dataset information to be updated is the dataset information that needs to be modified due to changes in the original geographic dataset, and the dataset information that needs to be modified includes specific data that needs to be modified and specific data that does not need to be modified.
[0107] Furthermore, the processing method for determining the candidate dataset spatial grid code through association rules based on the dataset information to be updated is to determine the derived associated dataset category information through dataset category association rules based on the dataset information to be updated; determine the associated dataset subcategory information through subcategory association rules based on the derived associated dataset category information; determine the associated dataset subcategory spatial grid code based on the associated dataset subcategory information; and determine the candidate dataset spatial grid code through spatial grid code association rules based on the associated dataset subcategory spatial grid code.
[0108] In this embodiment, in order to ensure the linkage changes of the basic dataset and its associated datasets, a three-level mapping rule including dataset category association rules, subcategory association rules and spatial grid code association rules is adopted. After the basic dataset (i.e., the dataset to be updated) changes, its associated datasets are quickly discovered and located, and then the changes of the associated datasets are completed. This can effectively ensure the version consistency and content timeliness of the basic dataset and its associated datasets.
[0109] The first-level association rules are dataset category association rules. The base dataset determines the category information of the derived association datasets (product datasets, thematic datasets, and service datasets); product datasets derive associated service datasets; and thematic datasets derive associated service datasets. Using dataset category association rules, when establishing associations, the datasets to be associated are first categorized, reducing the number of dataset association comparisons. Refer to Figure 4, which shows a dataset association mapping diagram for the first embodiment of the spatially varying data identification method of the present invention.
[0110] It should also be noted that the subcategory information of the linked dataset is determined through subcategory association rules based on the derived category information of the linked dataset.
[0111] The second-level association rules are sub-category association rules. By establishing a sub-category association rule mapping table, dataset types that require associations are searched in the sub-category association mapping table. Only datasets that meet the rules (i.e., the sub-category information of the associated datasets) can establish associations. For example, for a topographic map dataset, datasets that can be associated include surveying and mapping basic geographic entities, surveying and mapping thematic geographic entity datasets, surveying and mapping map library integrated products, and surveying and mapping raster tile services.
[0112] It should be understood that when the association rules need to be adjusted, only the following association mapping table needs to be modified:
[0113] It should also be noted that the spatial grid code of the associated dataset subclass is determined based on the associated dataset subclass information; the spatial grid code of the candidate dataset is determined based on the spatial grid code of the associated dataset subclass through the spatial grid code association rule. The third-level association rule is the spatial grid code association rule. Through the spatial grid code of the dataset, it is calculated whether the spatial range of the dataset has an intersection. Only when the datasets have an intersection can an association relationship be established. It mainly includes four intersection relationships: intersection, adjacent, separated, and inclusion. The spatial grid code association rule table is shown below:
[0114] Intersection relationship judgment mainly involves calculations to determine whether there is an intersection relationship between specified grids or grid sets; adjacent relationship judgment mainly involves calculations to determine whether there is an adjacent relationship between specified grids or grid sets, and what kind of adjacent relationship it is (edge adjacent, corner adjacent, and three-dimensional face adjacent, etc.); separation relationship judgment mainly involves calculations to determine whether two grids or grid sets are completely within the spatial range of the other.
[0115] It should also be noted that it is determined whether there is an intersection between the associated dataset subclass spatial grid code and the dataset to be updated spatial grid code, and the candidate dataset spatial grid code is determined based on the associated dataset subclass spatial grid codes that have an intersection.
[0116] It should also be noted that the associated dataset subclass spatial grid code can be a secondary spatial grid code. It is necessary to determine the primary spatial grid code based on the associated dataset subclass spatial grid code, and use the primary spatial grid code corresponding to the associated dataset subclass spatial grid code as the candidate dataset spatial grid code.
[0117] The operation module 9002 is configured to determine the associated dataset information according to the candidate dataset spatial grid code and the incremental packet spatial grid code.
[0118] In a specific implementation, the associated dataset information is determined according to the spatial grid code of the candidate dataset and the spatial grid code of the incremental packet through the spatial grid code association rule.
[0119] The associated dataset information includes the associated dataset space grid code and the associated dataset. It should be understood that the candidate dataset includes the associated dataset.
[0120] It should also be noted that the spatial grid code association relationship between the candidate dataset spatial grid code and the incremental packet spatial grid code is determined by the spatial grid code association rule, and the associated dataset information is determined based on the spatial grid code association relationship.
[0121] The spatial grid code association relationship may be an intersection relationship between the spatial grid codes.
[0122] The determination module 9003 is configured to determine a unique code corresponding to the updated data in the incremental package, and determine the associated data in the associated data set information according to the unique code.
[0123] Furthermore, the processing method for determining the associated data in the associated data set information based on the unique code is to determine the data attribute information based on the unique code; determine the data lineage relationship between the updated data and the associated data set information based on the data attribute information; and identify the associated data corresponding to the updated data from the associated data set information based on the data lineage relationship.
[0124] In a specific implementation, unique code identification depends on the blood relationship between data. The spatial data described in this embodiment includes feature data sets, entity data sets, cartographic data sets, and tile service data sets; different types of data sets are transformed in the following ways: feature data is transformed into entity data through feature aggregation, combination, and set processing, and feature data is transformed into cartographic data through cartographic expression, feature symbolization, overlay processing, shifting, and interruption processing, and feature data is transformed into tile service data through symbolization processing and tile production; entity data can be transformed into cartographic data through cartographic expression, entity symbolization, overlay processing, shifting, and interruption processing, and entity data is transformed into tile service data through symbolization processing and tile production; cartographic data is transformed into tile service data through tile production. Refer to Figure 5, which is a schematic diagram of spatial data type conversion in the first embodiment of the spatial change data linkage update method of the present invention.
[0125] It's also important to note that unique code information is recorded in the data's attribute information. If data is related, the attribute information allows for quick retrieval of related data. For example, "a" might be a feature unique code, and "b" might be an entity unique code. If "b" is derived from "a," the unique code of "a" is recorded in "b"'s data attribute record. This allows for quick retrieval of the specific data that needs updating.
[0126] The updating module 9004 is configured to perform a linkage update on the to-be-updated data set information and the associated data according to the update data and the updating rules.
[0127] Furthermore, a method for performing linkage updates on the dataset information to be updated and the associated data according to the update rule based on the update data is as follows: when the update rule is a simple update rule, the dataset information to be updated and the associated data are updated separately according to the update data; after the data update is completed, whether the updated data to be updated and the updated associated data are correct is checked; if the updated data to be updated and the updated associated data are correct, the linkage update between the dataset information to be updated and the associated data is completed.
[0128] In the specific implementation, refer to Figure 6, which is a simplified flowchart of the linkage update of the first embodiment of the spatial change data linkage update method of the present invention. For simple changes, the changes in the updated data in the update package are judged, and the same processing is performed on the data that needs to be associated and updated to achieve the first linkage update. After the update, the data is checked and found to be correct, and the linkage update of the current data is completed.
[0129] Furthermore, a processing method for linking and updating the dataset information to be updated and the associated data according to the update rules based on the update data is as follows: when the update rules are complex update rules, the dataset information to be updated and the associated data are updated separately according to the update data; after the data update is completed, the road entity data is determined based on the updated data to be updated and the updated associated data; the road entity data is converted into road mapping data, and it is determined whether there is a conflict area in the road mapping data; if there is a conflict area, the road mapping data is conflict processed to complete the linking update between the dataset information to be updated and the associated data.
[0130] In a specific implementation, refer to Figure 7, which illustrates a flowchart for parallel road conflict checking in the first embodiment of the spatially-variable data linkage update method of the present invention. For complex changes, after the simple changes described above, an additional operation, namely a second update, is required to obtain correct updated data. For example, for cartographic and publishing data, conflict checks must be performed before the second update based on different change scenarios, and then corresponding handling rules must be implemented.
[0131] This embodiment proposes common map expression conflict checking and handling rules, which mainly include polygon and discount conflict rules, road parallel conflict rules, and map symbol overlapping order rules.
[0132] It should also be understood that when road entity data is converted into road mapping data (i.e., a, b, and c in Figure 8), it needs to be symbolized. If there are road intersections after only simple changes, which is not in line with reality, it is necessary to judge based on the above rules and then interrupt and delete the line segments at the intersection to finally obtain usable current data.
[0133] Refer to Figure 8, which is a schematic diagram of the road intersection situation before and after processing of the first embodiment of the spatially varying data linkage update method of the present invention. In the figure, a is the image displayed by the road entity data before the update, b is the image displayed after the first linkage update, and c is the image displayed after the road mapping data is conflict processed.
[0134] In this embodiment, when a data change is detected in the original geographic dataset, the spatial grid code of the candidate dataset corresponding to the dataset to be updated is first determined. Then, the associated dataset information is determined based on the spatial grid code of the candidate dataset and the spatial grid code of the incremental package. The unique code corresponding to the updated data in the incremental package is then determined, and the associated data in the associated dataset information is determined based on the unique code. Finally, the updated dataset information and the associated data are linked and updated according to the update rules based on the updated data. Compared to the existing technology, which only detects changes in multi-source, heterogeneous, and multi-scale geographic vector data but does not explain how to perform linked updates, this embodiment leverages the uniqueness, association, and location characteristics of the unique code to quickly identify the specific data that needs to be updated, thereby improving the update processing efficiency.
[0135] Other embodiments or specific implementations of the spatial change data linkage update system of the present invention can refer to the above-mentioned method embodiments and will not be described in detail here.
[0136] It should be noted that, in this document, the terms "comprises," "includes," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, article, or system comprising a series of elements includes not only those elements but also other elements not explicitly listed, or elements inherent to such process, method, article, or system. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of other identical elements in the process, method, article, or system comprising the element.
[0137] The serial numbers of the above embodiments of the present invention are for description only and do not represent the advantages or disadvantages of the embodiments.
[0138] Through the description of the above embodiments, those skilled in the art can clearly understand that the above embodiment methods can be implemented by means of software plus the necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is a better embodiment. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as read-only memory / random access memory, magnetic disk, optical disk), and includes a number of instructions for enabling a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods described in each embodiment of the present invention.
[0139] The above are only preferred embodiments of the present invention and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention description and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.
Claims
1. A method for linked update of spatially varying data, characterized in that, The method for linked update of spatially varying data includes the following steps: When it is detected that there is a data change in the original geographic data set, determine the candidate data set spatial grid codes corresponding to the data set information to be updated; Determine the associated data set information according to the candidate data set spatial grid codes and the incremental package spatial grid codes; Determine the unique codes corresponding to the updated data in the incremental package, and determine the associated data in the associated data set information according to the unique codes; Perform a linked update on the data set information to be updated and the associated data according to the updated data through an update rule.
2. The method according to claim 1, characterized in that The step of determining the associated data in the associated data set information according to the unique codes includes: Determine the data attribute information according to the unique codes; Determine the data lineage relationship between the updated data and the associated data set information according to the data attribute information; Identify the associated data corresponding to the updated data from the associated data set information according to the data lineage relationship.
3. The method according to claim 1, characterized in that, The step of performing a linked update on the data set information to be updated and the associated data according to the updated data through an update rule includes: When the update rule is a simple update rule, perform data updates on the data set information to be updated and the associated data respectively according to the updated data; After the data update is completed, check whether the updated data set to be updated and the updated associated data are correct; If the updated data set to be updated and the updated associated data are correct, complete the linked update between the data set information to be updated and the associated data. The step of performing a linked update on the data set information to be updated and the associated data according to the updated data through an update rule includes:
4. The method according to claim 1, characterized in that, When the update rule is a complex update rule, perform data updates on the data set information to be updated and the associated data respectively according to the updated data; After the data update is completed, determine the road entity data according to the updated data set to be updated and the updated associated data; Convert the road entity data into road mapping data, and determine whether there are conflict areas in the road mapping data; If there are such conflict areas, perform conflict processing on the road mapping data to complete the linked update between the data set information to be updated and the associated data. The step of determining the candidate data set spatial grid codes corresponding to the data set information to be updated includes:
5. The method according to any one of claims 1-4, characterized in that, Determine the derived associated data set category information according to the data set information to be updated through the data set category association rule; Determine the associated data set subclass information according to the derived associated data set category information through the subclass association rule; Determine the associated data set subclass spatial grid codes according to the associated data set subclass information; Determine the candidate data set spatial grid codes according to the associated data set subclass spatial grid codes through the spatial grid code association rule. The step of determining the associated data set information according to the candidate data set spatial grid codes and the incremental package spatial grid codes includes:
6. The method according to claim 5, wherein Determine the spatial grid code association relationship between the candidate data set spatial grid codes and the incremental package spatial grid codes through the spatial grid code association rule; Determine the associated data set information according to the spatial grid code association relationship. 7. A spatial variation data linkage update system, characterized in that, The spatial change data linkage update system includes: A detection module, configured to determine a candidate dataset spatial grid code corresponding to the dataset information to be updated when it detects data changes in the original geographic dataset; An operation module, configured to determine associated dataset information according to the candidate dataset spatial grid code and the incremental package spatial grid code; A determination module, configured to determine a unique code corresponding to the updated data in the incremental package, and determine the associated data in the associated dataset information according to the unique code; An update module, configured to perform linkage updates on the dataset information to be updated and the associated data according to the update data through an update rule.
8. A spatially-varying data linkage update device, characterized in that, The device includes: a memory, a processor, and a spatial change data linkage update program stored on the memory and executable on the processor, and the spatial change data linkage update program is configured to implement the steps of the spatial change data linkage update method according to any one of claims 1 to 6.
9. A storage medium, characterized in that, A spatial change data linkage update program is stored on the storage medium, and when the spatial change data linkage update program is executed by a processor, it implements the steps of the spatial change data linkage update method according to any one of claims 1 to 6.
Citation Information
Patent Citations
On-line linkage update service method of multi-scale geographic data
CN102693306A
Fast topographic map charting database updating method based on increment and linkage
CN105302914A
Geographic entity encoding method capable of carrying out quick updating and data sharing
CN106951453A
Spatial change data linkage updating method, system and equipment and storage medium
CN117931818A
Method of and apparatus for generating / processing a spatial-data-change message
WO2009145609A1