Intelligent map data inspection system and map data updating method

Abstract

The embodiment of the invention discloses an intelligent map data inspection system and a map data updating method, and relates to the technical field of data processing. The map data updating method comprises the following steps: acquiring an updating instruction for target map data; generating a corresponding map data inspection instruction according to the updating instruction; obtaining first data structure information and second data structure information according to the map data inspection instruction; determining a first pointer sequence corresponding to the first data structure information according to pointer information in the first data structure information; determining a corresponding first data substructure based on the first pointer sequence; obtaining a first pointer addressing range corresponding to each to-be-checked data unit based on the first data substructure; determining a test result according to the first pointer addressing range and the second data structure information; and updating the target map data according to the inspection result. By means of the method, the checking efficiency of the map data can be improved, and calculation resource occupation in the map data checking and updating process is reduced.

Description

Technical Field

[0001] The present application relates to the technical field of map data processing, and in particular to an intelligent map data verification system and a map data updating method. Background Art

[0002] Map data plays a vital role in modern navigation systems and geographic information systems. With the continuous development of society, map data usually needs to be updated and maintained in real time to ensure the accuracy of navigation systems and the reliability of geographic information systems.

[0003] Since map data is relatively complex and updated frequently, local updates can be used to improve update efficiency. However, local updates bring some other challenges. For example, when using traditional data verification methods to determine the data units that need to be updated, they often need to be read and compared one by one, which not only has low verification efficiency, but also takes up more computing resources.

[0004] Based on this, it is necessary to study an intelligent map data verification system and a map data updating method to improve the verification efficiency of map data and reduce the computing resource usage during map data verification and updating. Summary of the invention

[0005] In order to solve the above technical problems, one aspect of an embodiment of this specification provides a map data updating method, the method comprising:

[0006] Obtaining an update instruction for updating target map data corresponding to the target area;

[0007] generating a map data verification instruction corresponding to the target map data according to the update instruction;

[0008] Acquire first data structure information and second data structure information corresponding to the target map data according to the map data verification instruction, wherein the first data structure information includes pointer information corresponding to at least one data unit to be verified in the target map data, and the second data structure information is a data structure table used to compare with the first data structure information to realize data verification;

[0009] Determine a first pointer sequence corresponding to the first data structure information according to the pointer information corresponding to the data unit to be checked;

[0010] Determine a first data substructure corresponding to at least one to-be-checked data unit based on the first pointer sorting;

[0011] Acquire a first pointer addressing range corresponding to each to-be-checked data unit based on the first data substructure;

[0012] Determine a test result corresponding to the map data test instruction according to the first pointer addressing range and the second data structure information;

[0013] The target map data corresponding to the target area is updated according to the inspection result.

[0014] In some embodiments, the second data structure information includes pointer information of a to-be-checked data unit corresponding to the target map data, and determining the check result corresponding to the map data check instruction according to the first pointer addressing range and the second data structure information includes:

[0015] Processing the second data structure information in sequence according to the pointer information of the data unit to be checked to obtain a second pointer sequence;

[0016] Determine a first data structure verification result and a second data structure verification result according to the first pointer addressing range and the second pointer sorting;

[0017] Based on the first data structure verification result and the second data structure verification result, a verification result corresponding to the map data verification instruction is obtained.

[0018] In some embodiments, determining the first data structure verification result and the second data structure verification result according to the first pointer addressing range and the second pointer sorting includes: determining the first data structure verification result through the following steps S1 to S3, and determining the second data structure verification result through the following steps S4 to S5:

[0019] S1, determining a first target data substructure corresponding to a target to-be-inspected data unit, and obtaining a first target pointer addressing range corresponding to the first target data substructure;

[0020] S2, detecting whether there is a second data substructure matching the target data unit to be checked in the second pointer sorting within the first target pointer addressing range;

[0021] S3, if it exists, then based on the first target data substructure corresponding to the target data unit to be checked and the second data substructure corresponding to the target data unit to be checked, obtain the first target data structure verification result; if it does not exist, then determine the first target data substructure corresponding to the target data unit to be checked as the first difference data substructure corresponding to the difference unit, and sort according to the first difference data substructure corresponding to the difference unit and the second pointer to obtain the first target data structure verification result;

[0022] S4, determining at least one pointer checking range according to the first pointer addressing range and the second pointer sorting;

[0023] S5, when there is no pointer mapping object in each pointer check range, determine that the second data structure check result is a pass; when there is a pointer mapping object in each pointer check range, determine the second difference data structure in the second data structure information based on each pointer check range, and determine the second data structure check result according to each second difference data structure.

[0024] In some embodiments, the detecting whether there is a second data substructure matching the target to-be-checked data unit in the second pointer sorting within the first target pointer addressing range includes:

[0025] Determine a corresponding lower limit and an upper limit of an address range according to the first target pointer addressing range;

[0026] When the lower limit of the address range and the upper limit of the address range corresponding to the first target pointer addressing range are included in the second pointer sorting, an address range whose lower limit and the upper limit of the address range are consistent with the lower limit and the upper limit of the address range corresponding to the first target pointer addressing range is determined as a second target pointer addressing range corresponding to the target data unit to be checked, and a second data substructure corresponding to the target data unit to be checked is determined according to the second target pointer addressing range corresponding to the target data unit to be checked;

[0027] When the lower limit of the address range and the upper limit of the address range corresponding to the first target pointer addressing range are not included in the second pointer sorting, it is determined that the first target pointer addressing range does not have a second data substructure matching the target data unit to be checked in the second pointer sorting.

[0028] In some embodiments, the obtaining the first target data structure verification result based on the first target data substructure corresponding to the target data unit to be verified and the second data substructure corresponding to the target data unit to be verified includes:

[0029] Obtaining first target data substructure comparison data corresponding to the first target data substructure, and second target data substructure comparison data corresponding to the second data substructure, wherein the first target data substructure comparison data includes at least one pointer parameter corresponding to each subunit in the first target data substructure corresponding to the target data unit to be checked, and the second target data substructure comparison data includes at least one pointer parameter corresponding to each subunit in the second data substructure corresponding to the target data unit to be checked;

[0030] Detecting whether the first target data substructure comparison data is consistent with the second target data substructure comparison data;

[0031] If they are consistent, the inspection result of the first target data structure is determined to be passed; if they are inconsistent, the first target data substructure corresponding to the target data unit to be inspected is determined to be the first difference data substructure corresponding to the difference unit, and the second data substructure corresponding to the target data unit to be inspected is determined to be the second difference data substructure corresponding to the difference unit, and then based on the first difference data substructure corresponding to the difference unit and the second difference data substructure corresponding to the difference unit, the inspection result of the first target data structure is obtained.

[0032] In some embodiments, the obtaining the first target data structure verification result based on the first difference data substructure corresponding to the difference unit and the second difference data substructure corresponding to the difference unit includes:

[0033] Determine at least one target difference data structure according to the first difference data substructure and the second difference data substructure corresponding to the difference unit;

[0034] A first target data structure verification result corresponding to the first difference data substructure is obtained based on each target difference data structure.

[0035] In some embodiments, the obtaining the first target data structure verification result according to the first difference data substructure and the second pointer sorting corresponding to the difference unit includes:

[0036] determining an addressing range of a target difference unit corresponding to the first difference data substructure;

[0037] Determine a second data substructure corresponding to a reference difference unit based on an addressing range of the target difference unit and the second pointer sorting;

[0038] Acquire a first data structure corresponding to at least one target difference unit and a second data structure corresponding to at least one reference difference unit;

[0039] At least one target difference data structure is determined according to the first data structure corresponding to each target difference unit and the second data structure corresponding to each reference difference unit, and a first target data structure verification result is obtained according to each target difference data structure.

[0040] In some embodiments, obtaining the inspection result corresponding to the map data inspection instruction based on the first data structure inspection result and the second data structure inspection result includes:

[0041] When both the first data structure inspection result and the second data structure inspection result are inspection passed, determining that the inspection result corresponding to the map data inspection instruction is inspection passed;

[0042] When the first data structure verification result and / or the second data structure verification result is a verification failure, at least one first difference data structure in the first data structure verification result and at least one second difference data structure in the second data structure verification result are obtained, and the verification result corresponding to the map data verification instruction is determined based on each first difference data structure and each second difference data structure.

[0043] Another aspect of the embodiments of this specification also provides an intelligent map data verification system, the system comprising:

[0044] An update instruction acquisition module, used to acquire an update instruction for updating target map data corresponding to a target area;

[0045] a map data verification instruction generating module, configured to generate a map data verification instruction corresponding to the target map data according to the update instruction;

[0046] A map data verification module, used for obtaining first data structure information and second data structure information corresponding to the target map data according to the map data verification instruction, wherein the first data structure information includes pointer information corresponding to at least one data unit to be verified in the target map data, and the second data structure information is a data structure table used to compare with the first data structure information to realize data verification; determining a first pointer sorting corresponding to the first data structure information according to the pointer information corresponding to the data unit to be verified; determining a first data substructure corresponding to at least one data unit to be verified based on the first pointer sorting; obtaining a first pointer addressing range corresponding to each data unit to be verified based on the first data substructure; and determining a verification result corresponding to the map data verification instruction according to the first pointer addressing range and the second data structure information.

[0047] In some embodiments, the system further includes an updating module, and the updating module is used to update the target map data corresponding to the target area according to the inspection result.

[0048] The beneficial effects that may be brought about by the intelligent map data verification system and map data updating method provided in the embodiments of this specification include at least:

[0049] (1) by obtaining the first data structure information and the second data structure information including the pointer information corresponding to the data unit to be checked in the target map data according to the map data check instruction generated according to the target map data, and then determining the corresponding data substructure and its corresponding pointer sequence according to the pointer information, the map data unit contained in the data substructure can have a corresponding position number. After obtaining each data substructure, the same data and the different data can be searched in the second data structure information according to the corresponding position number, and a preliminary judgment is made based on this, and the data substructure that meets the check requirement is compared with the entire data unit in the corresponding address range in the second data structure information, so as to directly compare the entire data unit composed of multiple data in the first data structure information with the second data structure information to realize rapid check of the map data, avoid the problem of low data check efficiency caused by comparing each data in the first data structure information and the second data structure information one by one, and at the same time reduce the computing resource usage in the map data check and update process;

[0050] (2) By determining the first data substructure corresponding to each data unit to be checked through pointer sorting, the first data substructure corresponding to each data unit to be checked can contain data in a range interval, and then the first data substructure corresponding to each data unit to be checked can be compared with the second data structure information to determine the inspection result, thereby achieving the effect of improving the efficiency of map data inspection;

[0051] (3) By confirming in the second data structure table whether the pointer check range outside the first pointer addressing range includes data related to the target map data, it is possible to ensure that the data check process does not miss the existing difference data related to the target map data while ensuring the data check efficiency.

[0052] Additional features will be described in part in the following description. They will become apparent to those skilled in the art by reviewing the following and accompanying drawings, or may be understood by the production or operation of the examples. The features of this specification may be implemented and obtained by practicing or using various aspects of the methods, tools, and combinations described in the following detailed examples. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] This specification will be further described in the form of exemplary embodiments, which will be described in detail by the accompanying drawings. These embodiments are not restrictive, and in these embodiments, the same number represents the same structure, wherein:

[0054] Figure 1 is an exemplary flow chart of a map data updating method according to some embodiments of this specification;

[0055] Figure 2 is a flowchart of exemplary sub-steps of a map data updating method according to some embodiments of this specification;

[0056] Figure 3 is a flowchart of exemplary sub-steps of a map data updating method according to other embodiments of this specification;

[0057] Figure 4 is a flowchart of exemplary sub-steps of a map data updating method according to other embodiments of this specification;

[0058] Figure 5 is an exemplary architecture diagram of an intelligent map data verification system according to some embodiments of this specification;

[0059] Figure 6 It is an exemplary module diagram of an intelligent map data verification system according to some embodiments of this specification. DETAILED DESCRIPTION

[0060] In order to more clearly illustrate the technical solutions of the embodiments of this specification, the following is a brief introduction to the drawings required for the description of the embodiments. Obviously, the drawings described below are only some examples or embodiments of this specification. For ordinary technicians in this field, this specification can also be applied to other similar scenarios based on these drawings without creative work. Unless it is obvious from the language environment or otherwise explained, the same reference numerals in the figures represent the same structure or operation.

[0061] It should be understood that the "system", "device", "unit" and / or "module" used in this specification is a method for distinguishing different components, elements, parts, parts or assemblies at different levels. However, if other words can achieve the same purpose, the words can be replaced by other expressions.

[0062] As shown in this specification and claims, unless the context clearly indicates an exception, the words "a", "an", "an" and / or "the" do not refer to the singular and may also include the plural. Generally speaking, the terms "comprise" and "include" only indicate the inclusion of the steps and elements that have been clearly identified, and these steps and elements do not constitute an exclusive list. The method or device may also include other steps or elements.

[0063] Flowcharts are used in this specification to illustrate the operations performed by the system according to the embodiments of this specification. It should be understood that the preceding or following operations are not necessarily performed precisely in order. Instead, the steps may be processed in reverse order or simultaneously. At the same time, other operations may also be added to these processes, or one or more operations may be removed from these processes.

[0064] The intelligent map data verification system and the map data updating method provided in the embodiments of this specification are described in detail below with reference to the accompanying drawings.

[0065] Figure 1 is an exemplary flow chart of a map data update method according to some embodiments of the present specification. In some embodiments, the map data update method may be executed by processing logic, which may include hardware (e.g., circuits, dedicated logic, programmable logic, microcode, etc.), software (instructions running on a processing device to perform hardware simulation), etc., or any combination thereof. In some embodiments, Figure 1 One or more operations in the flowchart of the map data updating method shown can be implemented by a server and / or an application terminal. For example, the map data updating method can be stored in a storage device in the form of a computer program or instruction and called and / or executed by a server and / or an application terminal.

[0066] Reference Figure 1 The map data updating method provided in the embodiment of the present application may include the following steps:

[0067] Step S110, obtaining an update instruction for updating the target map data corresponding to the target area. In some embodiments, step S110 may be executed by the update instruction obtaining module 210 described below.

[0068] In an embodiment of the present application, a user may choose to update the target map data corresponding to the target area through the application terminal. In an embodiment of the present application, the target area may refer to a province, city or district or county.

[0069] Furthermore, the application terminal may generate an update instruction for updating the target map data corresponding to the target area in response to the user's operation, and the server may obtain the update instruction and execute subsequent steps in response to the update instruction.

[0070] Step S120, generating a map data verification instruction corresponding to the target map data according to the update instruction. In some embodiments, step S120 may be executed by a map data verification instruction generating module 220 described below.

[0071] In the embodiment of the present application, after the server receives an update instruction for updating the target map data corresponding to the target area, a map data verification instruction corresponding to the target map data can be generated according to the update instruction. In the embodiment of the present application, through the map data verification instruction, a verification task (such as integrity verification, validity verification, etc.) for the target map data can be performed, thereby determining the data unit that needs to be updated (including the data unit that needs to be added or deleted), and executing subsequent map data update tasks based on this.

[0072] Step S130, obtaining first data structure information and second data structure information corresponding to the target map data according to the map data verification instruction. In some embodiments, step S130 may be executed by the map data verification module 230 described below.

[0073] In an embodiment of the present application, the server may respond to a map data verification instruction for the target map data and obtain first data structure information and second data structure information corresponding to the target map data, wherein the first data structure information may be understood as the data structure information of the target map data on the user end (e.g., application terminal), and the second data structure information may be understood as the data structure information of the target map data on the source end (e.g., server). It is understandable that since the data update at the user end usually lags behind the source end, there may be certain differences in the data structure information corresponding to the two. In an embodiment of the present application, the data that needs to be updated is determined by utilizing the difference between the first data structure information and the second data structure information.

[0074] Specifically, in an embodiment of the present application, the first data structure information may include pointer information of the data unit to be verified corresponding to the target map data, the second data structure information is similar to the first data structure information, and, in an embodiment of the present application, the second data structure information can be used to compare with the first data structure information to realize data verification.

[0075] In the embodiment of the present application, the first data structure information and the second data structure information may exist in the form of a data structure table or a data structure tree. When performing data verification, the first data structure table or the data structure tree may be parsed first to extract the pointer information of the data unit to be verified. Then, by comparing the pointer information with the corresponding information in the second data structure table or the data structure tree, it is possible to quickly identify which parts of the target map data are inconsistent between the user end and the source end, thereby determining the data units that need to be updated.

[0076] Step S140, determining the first pointer sequence corresponding to the first data structure information according to the pointer information corresponding to the data unit to be checked. In some embodiments, step S140 may be executed by the map data checking module 230 mentioned below.

[0077] In the embodiment of the present application, in order to verify the map data, the first data structure information and the second data structure information need to store the pointer information corresponding to each data unit to be verified so as to verify the map data through the divided data substructures in the subsequent process.

[0078] It can be understood that the pointer information corresponding to each data unit to be checked can reflect the positional relationship of each data unit to be checked in the data structure. In an embodiment of the present application, the pointers of each data unit to be checked can be sorted according to the positional relationship reflected by the pointer information, so as to obtain the first pointer sorting corresponding to the first data structure information.

[0079] Step S150: determining a first pointer corresponding to at least one to-be-checked data unit based on the first pointer sorting.

[0080] Data substructure In some embodiments, step S150 may be performed by the map data verification module 230 described below.

[0081] In the embodiment of the present application, the first data substructure corresponding to the data unit to be checked can be understood as a part of the aforementioned first data structure information. Specifically, the first data substructure corresponding to the data unit to be checked can be understood as a data structure table including a data structure corresponding to part of the data in the target map data. For example, there are 2000 data in the target map data, and the corresponding first data structure information is the overall data structure corresponding to the 2000 data. In the embodiment of the present application, the first data structure information including the 2000 data can be split into 50 first data substructures corresponding to the data units to be checked according to the pointer information of the 2000 data. Then, the first data substructure corresponding to each data unit to be checked includes 40 data. It should be noted that the above is only an exemplary description. In the embodiment of the present application, different data units to be checked may have the same or different numbers of data.

[0082] In an embodiment of the present application, determining the first data substructure corresponding to each data unit to be checked based on the pointer information of the data unit to be checked can be understood as determining the first data substructure corresponding to the data unit to be checked based on the position number corresponding to each data in the target map data, so that the pointer information corresponding to each data in the first data substructure corresponding to the above-mentioned data unit to be checked corresponds to the same position number. In an embodiment of the present application, the position number can be encoded according to a preset encoding rule. For example, the position number can be encoded as a sequence of integers, where each integer represents the position of a specific data point in the target map data. In this way, it can be ensured that the pointer information in the first data substructure of each data unit to be checked can accurately point to its corresponding data point, thereby achieving an efficient and accurate data verification process.

[0083] In some embodiments of the present specification, it is assumed that there are 2000 data in the target map data in response to the map data verification instruction, and the corresponding first data structure information includes pointer information of 2000 data, and the pointer information of each data corresponds to a separate position number. The 2000 data include position numbers from 1 to 2000, and each pointer information has a corresponding position number. Then, it can be split into 50 first data substructures corresponding to the data units to be verified according to the aforementioned pointer sorting, and the first data substructure corresponding to each data unit to be verified includes 40 data. Among them, the first data substructure corresponding to the first data unit to be verified includes position numbers 1-40, the first data substructure corresponding to the second data unit to be verified includes position numbers 41-80... The first data substructure corresponding to the 50th data unit to be verified includes position numbers 1961-2000.

[0084] It should be pointed out that in the embodiment of the present application, by determining the first data substructure corresponding to each data unit to be checked through pointer sorting, the first data substructure corresponding to each data unit to be checked can contain data in a range interval, and then the inspection result can be determined by comparing the first data substructure corresponding to each data unit to be checked with the second data structure information, thereby achieving the effect of improving the efficiency of map data inspection.

[0085] Specifically, in an embodiment of the present application, the first pointer sorting corresponding to the first data structure information can be determined based on the pointer information of the data unit to be checked, and then the first data substructure corresponding to at least one data unit to be checked can be generated based on the first pointer sorting. Among them, the first pointer sorting is a data table obtained by arranging the pointer information corresponding to each data in the first data structure information in order from small to large according to the position number based on the position number corresponding to each data in the pointer information of the data unit to be checked. In an embodiment of the present application, the method of generating the first data substructure corresponding to each data unit to be checked by the above-mentioned first pointer sorting can be to start from the smallest position number in the first pointer sorting and select the data structure corresponding to a certain number of data as the first data substructure.

[0086] Step S160, based on the first data substructure, obtain a first pointer addressing range corresponding to each to-be-checked data unit. In some embodiments, step S160 may be executed by the map data checking module 230 described below.

[0087] In an embodiment of the present application, the position numbers corresponding to the respective pointer information in the first data substructure corresponding to the respective data units to be checked determined based on the aforementioned first pointer sorting may be incremented. Therefore, in an embodiment of the present application, the corresponding first pointer addressing range may be determined by the lower limit of the address range (i.e., the starting address) and the upper limit of the address range (i.e., the final position) of the pointer information in each first data substructure. The first pointer addressing range may reflect which range interval of data is contained in the first data substructure corresponding to the data unit to be checked. Subsequent steps may be used to determine the first pointer addressing range corresponding to the first data substructure corresponding to each data unit to be checked, and compare the upper and lower limits of the address range of the first pointer addressing range with the second data structure information to determine the inspection result, thereby improving the efficiency of map data inspection.

[0088] Step S170, determining a check result corresponding to the map data check instruction according to the first pointer addressing range and the second data structure information. In some embodiments, step S170 may be executed by the map data check module 230 described below.

[0089] In the embodiment of the present application, the verification result can be used to reflect whether each data unit in the target map data needs to be updated. Specifically, in the embodiment of the present application, the verification result can reflect whether the data structure of each data unit in the target map data of the user end is different from that of the source end. If so, it needs to be updated, and if not, it does not need to be updated.

[0090] Specifically, in the embodiment of the present application, determining the inspection result through the first data substructure corresponding to each data unit to be inspected and the second data structure information of the target map data can be understood as determining whether the two data structure information corresponding to each data unit to be inspected in the target map data on the application terminal and the server side match, and then determining whether there are differences in the data structure information corresponding to the target map data, and which specific data units have differences in the data structures.

[0091] In an embodiment of the present application, determining the inspection result corresponding to the map data inspection instruction based on the first data substructure corresponding to each data unit to be inspected and the second data structure information may include: obtaining the first pointer addressing range corresponding to the first data substructure corresponding to each data unit to be inspected; and determining the inspection result corresponding to the map data inspection instruction based on the first pointer addressing range and the second data structure information.

[0092] In the embodiment of the present application, the first pointer addressing range can be understood as the address interval pointed to by the pointer information corresponding to each data unit to be checked in the first data substructure corresponding to each data unit to be checked.

[0093] It should be pointed out that in the embodiment of the present application, since the first data substructure corresponding to the data unit to be checked is determined by sequentially arranging based on the position relationship, and the position numbers corresponding to the various data in the target map data are sequentially increasing and unique, the position numbers corresponding to the pointer information corresponding to the various data are also sequentially increasing and unique. Based on this, in the subsequent process, the pointer addressing range corresponding to the first data substructure corresponding to each data unit to be checked can be determined, and the verification result can be determined based on the upper and lower limits of the address range of the pointer addressing range and the second data structure information, thereby improving the data verification efficiency before the map data is updated. In the embodiment of the present application, the second data structure information may also include the pointer information of the data unit to be checked corresponding to the target map data. Refer to Figure 2 In the process of determining the inspection result corresponding to the map data inspection instruction according to the first pointer addressing range and the second data structure information, the above step S170 may include the following sub-steps:

[0094] Sub-step S171, processing the second data structure information in sequence according to the pointer information of the data unit to be checked to obtain a second pointer sequence.

[0095] Sub-step S172, determining a first data structure verification result and a second data structure verification result according to the first pointer addressing range and the second pointer sorting.

[0096] Sub-step S173, obtaining a test result corresponding to the map data test instruction based on the first data structure test result and the second data structure test result.

[0097] It should be noted that, in the embodiment of the present application, the aforementioned first data structure verification result and the second data structure verification result can be understood as the verification results obtained by verifying the target map data in different ways. For example, the first data structure verification result can be understood as a verification performed on the matching of pointer information, while the second data structure verification result can be understood as a verification performed on the difference data.

[0098] In the embodiments of the present application, the second pointer sorting can be understood as a data structure table obtained by arranging the pointer information corresponding to each data in the second data structure information in the order of increasing position numbers based on the position numbers corresponding to each data in the pointer information of the data unit to be checked. In some embodiments of the present application, the first data structure verification result can reflect whether the pointer information stored in the first data structure information matches the pointer information stored in the second data structure information, and the second data structure verification result can reflect whether the pointer information stored in the second data structure information contains pointer information that is not stored in the first data structure information.

[0099] Reference Figure 3 In some embodiments of the present application, the first data structure verification result can be determined through the following steps S1 to S3:

[0100] S1, determine a first target data substructure corresponding to a target to-be-inspected data unit, and obtain a first target pointer addressing range corresponding to the first target data substructure.

[0101] S2, detecting whether there is a second data substructure matching the target to-be-checked data unit in the second pointer sorting within the first target pointer addressing range.

[0102] S3, if it exists, then based on the first target data substructure corresponding to the target data unit to be checked and the second data substructure corresponding to the target data unit to be checked, obtain the first target data structure verification result; if it does not exist, then determine the first target data substructure corresponding to the target data unit to be checked as the first difference data substructure corresponding to the difference unit, and sort according to the first difference data substructure corresponding to the difference unit and the second pointer to obtain the first target data structure verification result.

[0103] It should be noted that, in the present specification, the target data unit to be checked can be any data unit to be checked. The first target pointer addressing range is the first pointer addressing range corresponding to the first target data substructure corresponding to the target data unit to be checked, the second data substructure corresponding to the target data unit to be checked is a data structure table whose position number and pointer addressing range in the second data structure table of the data unit to be checked are the same as the position number and pointer addressing range in the first target data substructure corresponding to the target data unit to be checked, the first difference data substructure corresponding to the difference unit can be understood as the first target data substructure corresponding to the target data unit to be checked when there is no data structure table with the same position number and pointer addressing range in the second data structure table of the data unit to be checked, and the first target data structure inspection result is the inspection result corresponding to the first target data substructure corresponding to the target data unit to be checked. Specifically, in an embodiment of the present application, the first target data structure verification result can be understood as the verification result corresponding to a part of the data (which may include one or more data) in the first data structure table corresponding to the data unit to be verified. Only when the verification results of each part are passed, can it be confirmed that the first data structure verification result corresponding to the first data structure table of the entire data unit to be verified is passed. Otherwise, it is necessary to combine the difference data corresponding to each part to obtain the first data structure verification result corresponding to the entire data unit to be verified.

[0104] In the embodiment of the present application, by detecting whether there is a second data substructure matching the target data unit to be checked in the second pointer sorting within the first target pointer addressing range, it can be determined whether there is a data substructure in the second data structure information that is the same as the address range of the first target data substructure corresponding to the target data unit to be checked, so as to perform a preliminary detection on each data unit first. Specifically, if there is a data substructure with the same position number and pointer addressing range in the second data structure table corresponding to the data unit to be checked, then a separate comparison of a certain data in the entire pointer addressing range can be performed first, that is, another comparison is performed to determine whether the data in the entire address range matches. If there is no data substructure with the same position number and pointer addressing range in the second data structure table corresponding to the data unit to be checked, then it can be preliminarily determined that there is difference data in the first target data substructure corresponding to the target data unit to be checked, and then the data in the approximate address range in the second data structure table corresponding to the data unit to be checked is compared to further determine the difference data structure. It should be pointed out that this method can greatly improve the inspection efficiency of map data compared with directly comparing the data in the two data structure tables one by one.

[0105] Specifically, in an embodiment of the present application, the corresponding address range lower limit and address range upper limit can be determined based on the first target pointer addressing range; then, when the address range lower limit and address range upper limit corresponding to the first target pointer addressing range are included in the second pointer sorting, the address range whose address range lower limit and address range upper limit are consistent with the address range lower limit and address range upper limit corresponding to the first target pointer addressing range is determined as the second target pointer addressing range corresponding to the target data unit to be checked, and the second data substructure corresponding to the target data unit to be checked is determined according to the second target pointer addressing range corresponding to the target data unit to be checked; conversely, when the address range lower limit and address range upper limit corresponding to the first target pointer addressing range are not included in the second pointer sorting, it is determined that the first target pointer addressing range does not have a second data substructure matching the target data unit to be checked in the second pointer sorting.

[0106] It should be noted that, in the embodiment of the present application, the lower limit of the address range and the upper limit of the address range corresponding to the first target pointer addressing range are the minimum value and the maximum value of the address range in the first target pointer addressing range, and the second target pointer addressing range corresponding to the target data unit to be checked is the address range whose upper and lower limits of the address range in the second pointer sorting are the same as the minimum value and the maximum value in the first target pointer addressing range. In the embodiment of the present application, since the position numbers in the second pointer sorting are sequentially increased and unique, the storage address interval corresponding to the first target pointer addressing range can be confirmed through the upper and lower limits of the address range in the first target pointer addressing range, and it can also be further confirmed whether the second data substructure corresponding to the first target data substructure exists in the second data structure table corresponding to the data unit to be checked, thereby further improving the efficiency of map data verification.

[0107] More specifically, in an embodiment of the present application, first target data substructure comparison data corresponding to the first target data substructure and second target data substructure comparison data corresponding to the second data substructure can be obtained, wherein the first target data substructure comparison data includes at least one pointer parameter corresponding to each subunit in the first target data substructure corresponding to the target data unit to be checked, and the second target data substructure comparison data includes at least one pointer parameter corresponding to each subunit in the second data substructure corresponding to the target data unit to be checked; then, it is detected whether the first target data substructure comparison data is consistent with the second target data substructure comparison data; if they are consistent, it is determined that the first target data structure inspection result is inspection passed; if they are inconsistent, the first target data substructure corresponding to the target data unit to be checked is determined as the first difference data substructure corresponding to the difference unit, and the second data substructure corresponding to the target data unit to be checked is determined as the second difference data substructure corresponding to the difference unit, and then based on the first difference data substructure corresponding to the difference unit and the second difference data substructure corresponding to the difference unit, the first target data structure inspection result is obtained.

[0108] It should be noted that, in the embodiment of the present application, the first target data substructure comparison data can be understood as the data in the first target data substructure corresponding to the target data unit to be checked that is used to compare with the second target data substructure comparison data, and the second target data substructure comparison data is the same. The difference unit can refer to a data unit with a difference, and the second difference data substructure is the data structure corresponding to the difference data.

[0109] In an embodiment of the present application, by respectively confirming the first target data substructure comparison data in the first target data substructure corresponding to the target data unit to be checked and confirming the second target data substructure comparison data in the second data substructure corresponding to the target data unit to be checked, and comparing the two confirmed comparison data, it is confirmed whether there is difference data in the corresponding first data substructure and second data substructure. Specifically, when the comparison data corresponding to each of the two data substructures is the same, it can be considered that the above-mentioned two data substructures have consistent data, and the inspection result of the first data structure corresponding to the first target data substructure can be confirmed as passed. On the contrary, if the comparison data corresponding to each of the two data substructures is inconsistent, it is necessary to further compare the data in the two data substructures one by one to confirm the difference data.

[0110] Specifically, in some embodiments of the present application, a first data structure corresponding to at least one target difference unit in the first difference data substructure corresponding to the difference unit can be obtained, wherein the target difference unit can be any one of the aforementioned difference units; then, a second data structure of at least one target difference unit in the second difference data substructure corresponding to the difference unit is obtained; further, at least one target difference data structure can be determined based on the first difference data substructure and the second difference data substructure corresponding to the difference unit; finally, a first target data structure inspection result corresponding to the first difference data substructure corresponding to the difference unit can be obtained based on each target difference data structure.

[0111] In an embodiment of the present application, the first data structure corresponding to the target difference unit is a data structure in a first difference data substructure corresponding to the difference unit, the second data structure corresponding to the target difference unit is a data structure in a second difference data substructure corresponding to the difference unit, and the target difference data structure is a data structure that has not completed mutual matching.

[0112] In an embodiment of the present application, by determining the target difference data structure that has not completed the match based on the first data structure corresponding to multiple target difference units in the first data substructure corresponding to the target data unit to be checked and the second data structure corresponding to multiple target difference units in the second data substructure corresponding to the target data unit to be checked, it can be understood that after filtering out the pointer addressing range containing difference data in the two tables, the data in the addressing range is obtained for one-to-one comparison to confirm the data structure with differences and at the same time confirm the data with differences.

[0113] In the embodiment of the present application, the data structures corresponding to each data in the first target data substructure corresponding to the data unit to be checked with differences and the data structures corresponding to each data in the second data substructure corresponding to the data unit to be checked with differences can be screened out, and compared one by one, so as to identify the map data unit with differences. It can be understood that, since multiple screenings have been performed on a larger scale before the data structures corresponding to each map data unit are compared one by one, the efficiency of data verification can be greatly improved compared to directly comparing the data in the two data structure tables one by one.

[0114] In some embodiments of the present application, obtaining a first target data structure verification result based on a first difference data substructure corresponding to the difference unit and a second difference data substructure corresponding to the difference unit may include the following process: first, determining an addressing range of a target difference unit corresponding to the first difference data substructure; then, determining a second data substructure corresponding to a reference difference unit based on the addressing range of the target difference unit and the second pointer sorting; further, obtaining a first data structure corresponding to at least one target difference unit and a second data structure corresponding to at least one reference difference unit; finally, determining at least one target difference data structure according to the first data structure corresponding to each target difference unit and the second data structure corresponding to each reference difference unit, and obtaining a first target data structure verification result according to each target difference data structure.

[0115] In the embodiment of the present application, the addressing range of the target difference unit does not have a corresponding address interval in the second data structure table of the data unit to be checked, and the second data substructure corresponding to the reference difference unit is a data substructure corresponding to the address interval close to the addressing range of the target difference unit in the second data structure table of the data unit to be checked. Specifically, in the embodiment of the present application, determining the second data substructure corresponding to the reference difference unit based on the addressing range of the target difference unit and the second pointer sorting can be understood as first determining the second pointer addressing range of the reference difference unit corresponding to the addressing range of the target difference unit in the second pointer sorting, and then confirming that the data substructure corresponding to the second pointer addressing range of the reference difference unit is the second data substructure corresponding to the reference difference unit. In the embodiment of the present application, by determining the second data substructure corresponding to the reference difference unit corresponding to the addressing range of the target difference unit, and determining the inspection result of the address interval corresponding to the data substructure according to the first difference data substructure corresponding to the difference unit corresponding to the addressing range of the target difference unit and the second data substructure corresponding to the reference difference unit, it is possible to determine the address interval to be compared in the second data structure table of the data unit to be checked, and compare the data in the address interval one by one based on this. It can be understood that this method can improve the efficiency of map data verification compared to directly comparing the map data in the two data structure tables one by one. In some embodiments of the present application, determining at least one target difference data structure according to the first data structure corresponding to each target difference unit and the second data structure corresponding to each reference difference unit, and obtaining the first target data structure verification result according to each target difference data structure may include the following process:

[0116] First, obtain at least one first data structure corresponding to a target difference unit in the first difference data substructure corresponding to the difference unit and at least one second data structure corresponding to a reference difference unit in the second data substructure corresponding to the reference difference unit; then, determine at least one target difference data structure according to the first data structure corresponding to each target difference unit and the second data structure corresponding to each reference difference unit; finally, obtain the first target data structure verification result according to each target difference data structure. In the embodiment of the present application, the second data structure corresponding to the reference difference unit is a data structure in the second data substructure corresponding to the reference difference unit.

[0117] Reference Figure 4 In some embodiments of the present application, the second data structure verification result can be determined through steps S4 to S5:

[0118] S4, determining at least one pointer checking range according to the first pointer addressing range and the second pointer sorting.

[0119] S5, when there is no pointer mapping object in each pointer check range, determine that the second data structure check result is a pass; when there is a pointer mapping object in each pointer check range, determine a second difference data structure in the second data structure information based on each pointer check range, and determine the second data structure check result according to each second difference data structure.

[0120] In the embodiment of the present application, the pointer check range can be understood as other storage address intervals except the address interval corresponding to the first target data substructure corresponding to each data unit to be checked in the second pointer sort. The pointer mapping object can be understood as the pointer mapping data related to the target map data. The second difference data structure can be understood as a data structure that exists in the second data structure table corresponding to the data to be checked but does not exist in the first data structure table corresponding to the data to be checked. Specifically, since the data in each corresponding addressing range in the first data structure table of the data to be checked has been checked when determining the first data structure check result, that is, the first pointer addressing range used to determine the first data structure check result in the aforementioned process has included all data structures in the first data structure table of the data to be checked. Therefore, when determining whether there is data in the second data structure table of the data unit to be checked that is not available in the first data structure table of the data to be checked, it is only necessary to detect whether there is data related to the target map data outside the above-mentioned first pointer addressing range.

[0121] In an embodiment of the present application, by confirming in the second data structure table whether the pointer verification range outside the first pointer addressing range includes data related to the target map data, it is possible to ensure that the data verification process does not miss existing difference data related to the target map data while ensuring data verification efficiency.

[0122] After determining the first data structure verification result and the second data structure verification result through the above steps, the verification result corresponding to the map data verification instruction can be obtained based on the first data structure verification result and the second data structure verification result. Specifically, in some embodiments, the process may include the following contents:

[0123] When both the first data structure verification result and the second data structure verification result are passed, the verification result corresponding to the map data verification instruction is determined to be passed; when the first data structure verification result and / or the second data structure verification result are failed, at least one first difference data structure in the first data structure verification result and at least one second difference data structure in the second data structure verification result are obtained, and the verification result corresponding to the map data verification instruction is determined based on each first difference data structure and each second difference data structure.

[0124] In other words, in the embodiment of the present application, when both the first data structure test result and the second data structure test result are tested, the test result can be determined to be tested. Otherwise, the difference data tested in the above two test results is used as the test result.

[0125] Continue to refer to Figure 1 In the embodiment of the present application, after step S170, the following may also be included:

[0126] Step S180, updating the target map data corresponding to the target area according to the inspection result. In some embodiments, step S180 may be executed by the updating module 240 mentioned below.

[0127] In the embodiment of the present application, after the target map data is checked through the above steps, it can be determined whether each data unit exists at the other end. If it exists, the corresponding check result is a check pass, indicating that the data unit does not need to be updated. On the contrary, if it does not exist, the check result can reflect the difference data between the two, and the update module 240 can update the map data according to the difference data reflected by the check result.

[0128] Specifically, in an embodiment of the present application, the inspection result may include data that exists on the application terminal but not on the server, and data that exists on the server but not on the application terminal. Among them, the data that exists on the application terminal but not on the server can be deleted from the application terminal, and the data that exists on the server but not on the application terminal can be sent to the application terminal for updating.

[0129] It should be pointed out that in the embodiment of the present application, the first data structure information and the second data structure information containing the pointer information corresponding to the data unit to be checked in the target map data are obtained by the map data check instruction generated according to the target map data, and then the corresponding data substructure and its corresponding pointer sorting are determined by the pointer information, so that the map data unit contained in the data substructure has a corresponding position number. After obtaining each data substructure, the same data and the difference data can be searched in the second data structure information according to the corresponding position number, and a preliminary judgment is made based on this, and the data substructure that meets the inspection requirements is compared with the entire data unit in the corresponding address range in the second data structure information, so as to directly compare the entire data unit composed of multiple data in the first data structure information with the second data structure information to realize rapid inspection of the map data, avoid the problem of low data inspection efficiency caused by comparing each data in the first data structure information and the second data structure information one by one, and at the same time, it can also reduce the computing resource usage during the map data inspection and update process.

[0130] Figure 5 is an exemplary architecture diagram of an intelligent map data verification system according to some embodiments of this specification. Figure 5 The intelligent map data verification system provided in the embodiment of the present application may include a server 101 and an application terminal 102 , and the server 101 and the application terminal 102 may be connected via a network 103 .

[0131] The application terminal 102 may be used to generate an update instruction for updating the target map data corresponding to the target area in response to a user operation, and send the update instruction to the server 101 .

[0132] The server 101 can be used to receive an update instruction sent by the application terminal 102, and generate a map data verification instruction corresponding to the target map data according to the update instruction, and then obtain first data structure information and second data structure information corresponding to the target map data according to the map data verification instruction, wherein the first data structure information includes pointer information corresponding to at least one data unit to be verified in the target map data, and the second data structure information is a data structure table used to compare with the first data structure information to achieve data verification; then, determine the first pointer sorting corresponding to the first data structure information according to the pointer information corresponding to the data unit to be verified; determine the first data substructure corresponding to at least one data unit to be verified based on the first pointer sorting; obtain the first pointer addressing range corresponding to each data unit to be verified based on the first data substructure; and determine the inspection result corresponding to the map data verification instruction according to the first pointer addressing range and the second data structure information.

[0133] In some embodiments, the server 101 may also be used to update the target map data corresponding to the target area according to the inspection result. The application terminal 102 may be used to receive the update data sent by the server 101, and update the locally stored target map data through the update data.

[0134] In the embodiment of the present application, the server 101 may include a processor, a memory, a communication interface, and a map data verification device. The processor may be used to execute the system program and process the map data verification task; the memory may be used to store information such as the system program, map data, map data verification instructions, and verification results; the communication interface may be used to realize data transmission between the server 101 and the application terminal 102; and the map data verification device may be used to execute the map data verification steps described above to determine the verification results for the target map data.

[0135] In the embodiment of the present application, the application terminal 102 may include a mobile device 1021, a tablet computer 1022, a laptop computer 1023, etc. or any combination thereof. For example, the mobile device 1021 may include a mobile phone, a personal digital assistant (PDA), a dedicated mobile terminal, etc. or any combination thereof. In some embodiments, the application terminal 102 may include an input device (such as a keyboard, a touch screen), an output device (such as a display, a speaker), etc.

[0136] In an embodiment of the present application, the network 103 may include any suitable network that can facilitate information and / or data exchange. Exemplarily, in some embodiments, the network 103 may be any form of wired or wireless network, or any combination thereof. As an example only, the network 103 may include a cable network, a wired network, an optical fiber network, a telecommunications network, an intranet, the Internet, a local area network (LAN), a wide area network (WAN), a wireless local area network (WLAN), a metropolitan area network (MAN), a public switched telephone network (PSTN), a Bluetooth network, a ZigBee network, a near field communication (NFC) network, etc., or any combination thereof. In some embodiments, the network 103 may include at least one network access point, through which the server 101 and the application terminal 102 may be connected to the network 103 to exchange data and / or information.

[0137] Figure 6 is a schematic diagram of a module of an intelligent map data verification system according to some embodiments of this specification. In some embodiments, Figure 6 The intelligent map data verification system 200 shown can be applied to Figure 5 The application scenario shown, for example, can be configured in the form of software and / or hardware to the server 101 and / or the application terminal 102 to verify the target map data corresponding to the target area.

[0138] Reference Figure 6 In some embodiments, the intelligent map data verification system 200 may include an update instruction acquisition module 210, a map data verification instruction generation module 220, and a map data verification module 230. Among them:

[0139] The update instruction acquisition module 210 may be used to acquire an update instruction for updating target map data corresponding to a target area.

[0140] The map data verification instruction generation module 220 may be configured to generate a map data verification instruction corresponding to the target map data according to the update instruction.

[0141] The map data verification module 230 can be used to obtain first data structure information and second data structure information corresponding to the target map data according to the map data verification instruction, wherein the first data structure information includes pointer information corresponding to at least one data unit to be verified in the target map data, and the second data structure information is a data structure table used to compare with the first data structure information to realize data verification; determine the first pointer sorting corresponding to the first data structure information according to the pointer information corresponding to the data unit to be verified; determine the first data substructure corresponding to at least one data unit to be verified based on the first pointer sorting; obtain the first pointer addressing range corresponding to each data unit to be verified based on the first data substructure; and determine the inspection result corresponding to the map data verification instruction according to the first pointer addressing range and the second data structure information.

[0142] Continue to refer to Figure 6 In some embodiments of the present application, the intelligent map data verification system 200 may further include an updating module 240. The updating module 240 may be used to update the target map data corresponding to the target area according to the verification result.

[0143] For more details about each module in the above-mentioned intelligent map data verification system, please refer to other places in this specification (for example Figure 1 to Figure 4 part and its related description), which will not be repeated here.

[0144] It should be understood that Figure 6 The intelligent map data verification system 200 and its modules shown can be implemented in various ways. For example, in some embodiments, the system and its modules can be implemented by hardware, software, or a combination of software and hardware. Among them, the hardware part can be implemented using dedicated logic; the software part can be stored in a memory and executed by an appropriate instruction execution system, such as a microprocessor or a dedicated design hardware. It can be understood by those skilled in the art that the above methods and systems can be implemented using computer executable instructions and / or included in processor control codes, such as such codes provided on carrier media such as disks, CDs or DVD-ROMs, programmable memories such as read-only memories (firmware), or data carriers such as optical or electronic signal carriers. The system and its modules of this specification can be implemented not only by hardware circuits such as ultra-large-scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., but also by software implemented by, for example, various types of processors, and can also be implemented by a combination of the above hardware circuits and software (e.g., firmware).

[0145] It should be noted that the above description of the intelligent map data verification system 200 is provided for illustrative purposes only and is not intended to limit the scope of this specification. It is understandable that those skilled in the art can arbitrarily combine the modules according to the description of this specification without departing from this principle, or form a subsystem to connect with other modules. For example, Figure 6 The acquisition module 210, the map data verification instruction generation module 220, the map data verification module 230 and the update module 240 described above can be different modules in one system, or one module can realize the functions of two or more of the above modules. Such variations are all within the protection scope of this specification.

[0146] In summary, the beneficial effects that may be brought about by the embodiments of the present specification include but are not limited to: (1) In the intelligent map data verification system and map data updating method provided in some embodiments of the present specification, the first data structure information and the second data structure information containing the pointer information corresponding to the data unit to be verified in the target map data are obtained by generating a map data verification instruction according to the target map data, and then the corresponding data substructure and its corresponding pointer sorting are determined by the pointer information, so that the map data unit contained in the data substructure has a corresponding position number. After obtaining each data substructure, the same data and the different data can be searched in the second data structure information according to the corresponding position number, and a preliminary judgment is made based on this, and the data substructure that meets the verification requirements is compared with the entire data unit in the corresponding address range in the second data structure information, so as to directly compare the entire data unit composed of multiple data in the first data structure information with the second data structure information to realize rapid verification of the map data, thereby avoiding the error caused by the comparison between the first data structure information and the second data structure information. The problem of low data verification efficiency caused by comparing each data in the second data structure information one by one can also be solved, and at the same time, the computing resources occupied during the map data verification and update process can be reduced; (2) In the intelligent map data verification system and map data update method provided in some embodiments of the present specification, the first data substructure corresponding to each data unit to be verified is determined by pointer sorting, so that the first data substructure corresponding to each data unit to be verified can each contain data in a range interval, and then the first data substructure corresponding to each data unit to be verified can be compared with the second data structure information to determine the verification result, thereby achieving the effect of improving the map data verification efficiency; (3) In the intelligent map data verification system and map data update method provided in some embodiments of the present specification, by confirming in the second data structure table whether the pointer verification range outside the first pointer addressing range includes data related to the target map data, it can ensure that the data verification process will not miss the existing difference data related to the target map data while ensuring data verification efficiency.

[0147] It should be noted that different embodiments may produce different beneficial effects. In different embodiments, the beneficial effects that may be produced may be any one or a combination of the above, or may be any other beneficial effects that may be obtained.

[0148] The basic concepts have been described above. Obviously, for those skilled in the art, the above detailed disclosure is only for example and does not constitute a limitation of this specification. Although not explicitly stated here, those skilled in the art may make various modifications, improvements and corrections to this specification. Such modifications, improvements and corrections are suggested in this specification, so such modifications, improvements and corrections still belong to the spirit and scope of the exemplary embodiments of this specification.

[0149] At the same time, this specification uses specific words to describe the embodiments of this specification. For example, "one embodiment", "an embodiment", and / or "some embodiments" refer to a certain feature, structure or characteristic related to at least one embodiment of this specification. Therefore, it should be emphasized and noted that "one embodiment" or "an embodiment" or "an alternative embodiment" mentioned twice or more in different positions in this specification does not necessarily refer to the same embodiment. In addition, certain features, structures or characteristics in one or more embodiments of this specification can be appropriately combined.

[0150] In addition, it will be understood by those skilled in the art that various aspects of this specification may be illustrated and described by a number of patentable categories or situations, including any new and useful process, machine, product or combination of substances, or any new and useful improvements thereto. Accordingly, various aspects of this specification may be performed entirely by hardware, entirely by software (including firmware, resident software, microcode, etc.), or by a combination of hardware and software. The above hardware or software may be referred to as "data blocks", "modules", "engines", "units", "components" or "systems". In addition, various aspects of this specification may be represented as a computer product located in one or more computer-readable media, which includes computer-readable program code.

[0151] A computer storage medium may include a propagated data signal containing computer program code, for example, in baseband or as part of a carrier wave. The propagated signal may be in a variety of forms, including electromagnetic, optical, etc., or a suitable combination. A computer storage medium may be any computer-readable medium other than a computer-readable storage medium, which can be connected to an instruction execution system, device or apparatus to communicate, propagate or transmit the program for use. The program code on the computer storage medium may be transmitted via any suitable medium, including radio, cable, fiber optic cable, RF, or similar media, or any combination of the above media.

[0152] The computer program code required for the operation of each part of this specification can be written in any one or more programming languages, including object-oriented programming languages ​​such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C++, C#, VB.NET, Python, etc., conventional procedural programming languages ​​such as C language, Visual Basic, Fortran2003, Perl, COBOL2002, PHP, ABAP, dynamic programming languages ​​such as Python, Ruby and Groovy, or other programming languages, etc. The program code can be run entirely on the user's computer, or run on the user's computer as an independent software package, or run partially on the user's computer and partially on a remote computer, or run entirely on a remote computer or processing device. In the latter case, the remote computer can be connected to the user's computer through any network form, such as a local area network (LAN) or a wide area network (WAN), or connected to an external computer (e.g., via the Internet), or in a cloud computing environment, or used as a service such as software as a service (SaaS).

[0153] In addition, unless explicitly stated in the claims, the order of the processing elements and sequences described in this specification, the use of alphanumeric characters, or the use of other names are not intended to limit the order of the processes and methods of this specification. Although the above disclosure discusses some invention embodiments that are currently considered useful through various examples, it should be understood that such details are only for illustrative purposes, and the attached claims are not limited to the disclosed embodiments. On the contrary, the claims are intended to cover all modifications and equivalent combinations that are consistent with the essence and scope of the embodiments of this specification. For example, although the system components described above can be implemented by hardware devices, they can also be implemented only by software solutions, such as installing the described system on an existing processing device or mobile device.

[0154] Similarly, it should be noted that in order to simplify the description disclosed in this specification and thus help understand one or more embodiments of the invention, in the above description of the embodiments of this specification, multiple features are sometimes combined into one embodiment, figure or description thereof. However, this disclosure method does not mean that the features required by the subject matter of this specification are more than the features mentioned in the claims. In fact, the features of the embodiments are less than all the features of the single embodiment disclosed above.

[0155] In some embodiments, numbers describing the number of components and attributes are used. It should be understood that such numbers used in the description of the embodiments are modified by the modifiers "about", "approximately" or "substantially" in some examples. Unless otherwise specified, "about", "approximately" or "substantially" indicate that the numbers are allowed to vary by ±20%. Accordingly, in some embodiments, the numerical parameters used in the specification and claims are approximate values, which may change according to the required features of individual embodiments. In some embodiments, the numerical parameters should take into account the specified significant digits and adopt the general method of retaining digits. Although the numerical domains and parameters used to confirm the breadth of their range in some embodiments of this specification are approximate values, in specific embodiments, the setting of such numerical values ​​is as accurate as possible within the feasible range.

[0156] Each patent, patent application, patent application publication, and other materials, such as articles, books, specifications, publications, documents, etc., cited in this specification are hereby incorporated by reference in their entirety. Except for application history documents that are inconsistent with or conflicting with the contents of this specification, documents that limit the broadest scope of the claims of this specification (currently or later attached to this specification) are also excluded. It should be noted that if the descriptions, definitions, and / or use of terms in the materials attached to this specification are inconsistent or conflicting with the contents described in this specification, the descriptions, definitions, and / or use of terms in this specification shall prevail.

[0157] Finally, it should be understood that the embodiments described in this specification are only used to illustrate the principles of the embodiments of this specification. Other variations may also fall within the scope of this specification. Therefore, as an example and not a limitation, alternative configurations of the embodiments of this specification may be considered consistent with the teachings of this specification. Accordingly, the embodiments of this specification are not limited to the embodiments explicitly introduced and described in this specification.

Claims

1. A map data updating method, characterized in that: include: Obtaining an update instruction for updating target map data corresponding to the target area; generating a map data verification instruction corresponding to the target map data according to the update instruction; Acquire first data structure information and second data structure information corresponding to the target map data according to the map data verification instruction, wherein the first data structure information includes pointer information corresponding to at least one data unit to be verified in the target map data, and the second data structure information is a data structure table used to compare with the first data structure information to realize data verification; Determine a first pointer sequence corresponding to the first data structure information according to the pointer information corresponding to the data unit to be checked; Determine a first data substructure corresponding to at least one to-be-checked data unit based on the first pointer sorting; Acquire a first pointer addressing range corresponding to each to-be-checked data unit based on the first data substructure; Determine a test result corresponding to the map data test instruction according to the first pointer addressing range and the second data structure information; The target map data corresponding to the target area is updated according to the inspection result.

2. The map data updating method according to claim 1, characterized in that: The second data structure information includes pointer information of the to-be-checked data unit corresponding to the target map data, and the determining the check result corresponding to the map data check instruction according to the first pointer addressing range and the second data structure information includes: Processing the second data structure information in sequence according to the pointer information of the data unit to be checked to obtain a second pointer sequence; Determine a first data structure verification result and a second data structure verification result according to the first pointer addressing range and the second pointer sorting; Based on the first data structure verification result and the second data structure verification result, a verification result corresponding to the map data verification instruction is obtained.

3. The map data updating method according to claim 2, characterized in that: Determining the first data structure verification result and the second data structure verification result according to the first pointer addressing range and the second pointer sorting includes: determining the first data structure verification result through the following steps S1 to S3, and determining the second data structure verification result through the following steps S4 to S5: S1, determining a first target data substructure corresponding to a target to-be-inspected data unit, and obtaining a first target pointer addressing range corresponding to the first target data substructure; S2, detecting whether there is a second data substructure matching the target data unit to be checked in the second pointer sorting within the first target pointer addressing range; S3, if it exists, then based on the first target data substructure corresponding to the target data unit to be checked and the second data substructure corresponding to the target data unit to be checked, obtain the first target data structure verification result; if it does not exist, then determine the first target data substructure corresponding to the target data unit to be checked as the first difference data substructure corresponding to the difference unit, and sort according to the first difference data substructure corresponding to the difference unit and the second pointer to obtain the first target data structure verification result; S4, determining at least one pointer checking range according to the first pointer addressing range and the second pointer sorting; S5, when there is no pointer mapping object in each pointer check range, determine that the second data structure check result is a pass; when there is a pointer mapping object in each pointer check range, determine the second difference data structure in the second data structure information based on each pointer check range, and determine the second data structure check result according to each second difference data structure.

4. The map data updating method according to claim 3, characterized in that: The detecting whether there is a second data substructure matching the target to-be-checked data unit in the second pointer sorting within the first target pointer addressing range includes: Determine a corresponding lower limit and an upper limit of an address range according to the first target pointer addressing range; When the lower limit of the address range and the upper limit of the address range corresponding to the first target pointer addressing range are included in the second pointer sorting, an address range whose lower limit and the upper limit of the address range are consistent with the lower limit and the upper limit of the address range corresponding to the first target pointer addressing range is determined as a second target pointer addressing range corresponding to the target data unit to be checked, and a second data substructure corresponding to the target data unit to be checked is determined according to the second target pointer addressing range corresponding to the target data unit to be checked; When the lower limit of the address range and the upper limit of the address range corresponding to the first target pointer addressing range are not included in the second pointer sorting, it is determined that the first target pointer addressing range does not have a second data substructure matching the target data unit to be checked in the second pointer sorting.

5. The map data updating method according to claim 4, characterized in that: The obtaining a first target data structure verification result based on the first target data substructure corresponding to the target data unit to be verified and the second data substructure corresponding to the target data unit to be verified includes: Obtaining first target data substructure comparison data corresponding to the first target data substructure, and second target data substructure comparison data corresponding to the second data substructure, wherein the first target data substructure comparison data includes at least one pointer parameter corresponding to each subunit in the first target data substructure corresponding to the target data unit to be checked, and the second target data substructure comparison data includes at least one pointer parameter corresponding to each subunit in the second data substructure corresponding to the target data unit to be checked; Detecting whether the first target data substructure comparison data is consistent with the second target data substructure comparison data; If they are consistent, the inspection result of the first target data structure is determined to be passed; if they are inconsistent, the first target data substructure corresponding to the target data unit to be inspected is determined to be the first difference data substructure corresponding to the difference unit, and the second data substructure corresponding to the target data unit to be inspected is determined to be the second difference data substructure corresponding to the difference unit, and then based on the first difference data substructure corresponding to the difference unit and the second difference data substructure corresponding to the difference unit, the inspection result of the first target data structure is obtained.

6. The map data updating method according to claim 5, characterized in that: The obtaining of the first target data structure verification result based on the first difference data substructure corresponding to the difference unit and the second difference data substructure corresponding to the difference unit includes: Determine at least one target difference data structure according to the first difference data substructure and the second difference data substructure corresponding to the difference unit; A first target data structure verification result corresponding to the first difference data substructure is obtained based on each target difference data structure.

7. The map data updating method according to claim 3, characterized in that: The obtaining the first target data structure verification result according to the first difference data substructure corresponding to the difference unit and the second pointer sorting includes: determining an addressing range of a target difference unit corresponding to the first difference data substructure; Determine a second data substructure corresponding to a reference difference unit based on an addressing range of the target difference unit and the second pointer sorting; Acquire a first data structure corresponding to at least one target difference unit and a second data structure corresponding to at least one reference difference unit; At least one target difference data structure is determined according to the first data structure corresponding to each target difference unit and the second data structure corresponding to each reference difference unit, and a first target data structure verification result is obtained according to each target difference data structure.

8. The map data updating method according to claim 2, characterized in that: The obtaining, based on the first data structure verification result and the second data structure verification result, a verification result corresponding to the map data verification instruction includes: When both the first data structure inspection result and the second data structure inspection result are inspection passed, determining that the inspection result corresponding to the map data inspection instruction is inspection passed; When the first data structure verification result and / or the second data structure verification result is a verification failure, at least one first difference data structure in the first data structure verification result and at least one second difference data structure in the second data structure verification result are obtained, and the verification result corresponding to the map data verification instruction is determined based on each first difference data structure and each second difference data structure.

9. An intelligent map data verification system, characterized in that: include: An update instruction acquisition module, used to acquire an update instruction for updating target map data corresponding to a target area; a map data verification instruction generating module, configured to generate a map data verification instruction corresponding to the target map data according to the update instruction; A map data verification module, used for obtaining first data structure information and second data structure information corresponding to the target map data according to the map data verification instruction, wherein the first data structure information includes pointer information corresponding to at least one data unit to be verified in the target map data, and the second data structure information is a data structure table used to compare with the first data structure information to realize data verification; determining a first pointer sorting corresponding to the first data structure information according to the pointer information corresponding to the data unit to be verified; determining a first data substructure corresponding to at least one data unit to be verified based on the first pointer sorting; obtaining a first pointer addressing range corresponding to each data unit to be verified based on the first data substructure; and determining a verification result corresponding to the map data verification instruction according to the first pointer addressing range and the second data structure information.

10. The intelligent map data verification system according to claim 9, characterized in that: The system further comprises an updating module, and the updating module is used for updating the target map data corresponding to the target area according to the inspection result.

Images