CN113312369A - Multi-scale map database cascading updating method based on unique identification code - Google Patents

Multi-scale map database cascading updating method based on unique identification code Download PDF

Info

Publication number
CN113312369A
CN113312369A CN202110867342.3A CN202110867342A CN113312369A CN 113312369 A CN113312369 A CN 113312369A CN 202110867342 A CN202110867342 A CN 202110867342A CN 113312369 A CN113312369 A CN 113312369A
Authority
CN
China
Prior art keywords
scale
data
updating
elements
record
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110867342.3A
Other languages
Chinese (zh)
Inventor
罗浩
任东宇
周启
文学虎
李忠
梁磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Third Institute Of Geographic Information Cartography Ministry Of Natural Resources
Original Assignee
Third Institute Of Geographic Information Cartography Ministry Of Natural Resources
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Third Institute Of Geographic Information Cartography Ministry Of Natural Resources filed Critical Third Institute Of Geographic Information Cartography Ministry Of Natural Resources
Priority to CN202110867342.3A priority Critical patent/CN113312369A/en
Publication of CN113312369A publication Critical patent/CN113312369A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Remote Sensing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a multi-scale map database cascading updating method based on a unique identification code, provides a full-element incidence relation model between map databases with different scales and a dynamic maintenance mechanism thereof, and provides a set of complete cascading updating method and a matched software system thereof, thereby realizing systematization and process of updating a multi-scale map database, greatly improving the efficiency and reducing the workload. The homonymous object of each element in the series scale can be quickly extracted, and a foundation is laid for automatic updating; the invention builds a cascade update software system, systematizes and streamlines the update process, provides rich data editing tools, automatic semi-automatic update processing tools, association relationship maintenance tools, data quality inspection tools and data matching tools, meets the requirements of update operation, and is also suitable for cascade update of organized, same-standard and series vector map databases except a multi-scale map database.

Description

Multi-scale map database cascading updating method based on unique identification code
Technical Field
The invention relates to the field of map making and spatial data processing, in particular to a multiscale map database cascading updating method based on a unique identification code.
Background
The incremental cascade updating technology of the residential area adopts a real-time matching mode, one-time matching is needed when each scale data is updated, the workload of manual checking is greatly increased, and the incidence relation between the data and the adjacent scale data needs to be corrected manually after the corresponding scale data is updated, so that time and labor are wasted.
The existing method excessively depends on the accuracy of geometric similarity matching, semantic analysis and feature matching algorithms, however, a multi-scale map database has the characteristics of various geographic scenes, complex element relations, large figure dimension change and the like, so that the method only suitable for certain specific data and single element ideal scenes is poor in processing effect, cannot realize automatic maintenance of incidence relations among different scales, needs to invest more additional labor cost for screening and correcting mismatching and missed matching, and is difficult to apply to engineering practice.
Disclosure of Invention
The invention aims to solve the problems and provide a multi-scale map database cascading updating method based on a unique identification code.
The invention realizes the purpose through the following technical scheme:
the invention comprises the following steps:
s1, creating an association relationship model, wherein the association relationship describes the corresponding relationship between adjacent scale homonymous objects in the multi-scale map database, 5 kinds of corresponding relationships exist between the adjacent scale homonymous objects in the multi-scale map database, and the number of the corresponding relationships respectively is 0:1, 1:0, 1:1 and M:1, M is more than N is more than 1;
s2, designing a storage table according to the incidence relation model, wherein the table is stored in an incidence relation library and has uniqueness in the library, and the identification of the corresponding relation between adjacent scale space objects is completed by using a matching algorithm and combining manual check;
s3, dynamically maintaining the association relationship by monitoring the system data editing tool according to the processing logic;
s4, analyzing reference data, namely acquiring a vector updating data source as a starting point, firstly matching the updating data source with initial scale data, and extracting corresponding change information according to different types of objects with failed matching;
s5, updating the initial scale, namely, carrying out scale change on the change information to convert the change information into incremental information, and carrying out topological relation processing, conflict processing and attribute calculation on the basis of the incremental information so as to update the initial scale data;
s6, performing cross-scale cascade update, namely extracting change information for updating the data of the adjacent scale by using the increment information acquired in the update of the initial scale data and the incidence relation between the initial scale data and the data of the adjacent scale, and simultaneously converting new information and modification information in the change information from the increment information extracted by the update of the initial scale; because the scale of the change information is different from that of the data to be updated, the change information needs to be subjected to scale transformation to generate incremental information for direct updating, and then the updating of the adjacent scale data is completed. And by analogy, updating the map data with a smaller scale, and further realizing the synchronous updating of the series of scale data.
In step S3, the editing tool involved in the generation and extinction of elements in the system is analyzed, and the records corresponding to the upper association table (i.e., all records of elements with the same name in the upper association table) are changed by tracing back the change of the association relationship at this level. The following four cases are included:
a, a 'create element' tool can produce a brand-new element, a new record needs to be inserted into a relation table, and the type is set to be '1: 0';
b, deleting elements by using an element deleting tool, positioning the deleted elements in the relation table, directly clearing records if the deleted elements are in virtual association, and tracing upwards and clearing corresponding records; if the element is of type "1: 0" and the discard factor field is empty, the record is cleared; if the situation is other, the current level is unchanged, and the corresponding record is traced upwards and cleared;
c, deleting the merged element by a merging tool, transferring the association relation of the merged element to the merged element in an association table, adding a record newly if the merged element is of a type of 1:1, generating a type of 1: N, clearing the record of the merged element if the lower-level element pointed by the merged element is the same element, and generating a type of M: N except the two types; tracing upwards and transferring the association relation of the merged elements to the merged elements, wherein if the merged elements are of an M: N type, the corresponding record type is still of an M: N type, otherwise, the corresponding record is changed to be of an M:1 type;
d, generating a plurality of new elements inheriting the geometry of the original elements by the aid of a segmentation tool, a scattering tool and a line breaking tool, and inserting a new record into the relation table to inherit the original element association relation, wherein if the original element association relation is virtual association, the record is newly added, and the corresponding record is traced upwards; if the element is of a 1:0 type and the abandon factor is null, adding a record; the other elements except the segmentation elements are changed into M:1 types; and (4) inheriting the original element association relationship upwards, wherein the records with the type of 1:1 are changed into the type of 1: N, and the other records are changed into the type of M: N.
In step S6, the cross-scale cascade update includes the following steps:
s6.1, comparing the increment with the adjacent scale data to extract change information, namely matching elements corresponding to the increment in the adjacent scale library through an association relation table, and determining the addition, deletion and modification attributes of the change information according to the STACOD field and the association type of the increment;
s6.2, changing information scale to change production increment, namely modifying the change information according to related data standards to enable the change information to accord with the data standards due to scale difference between the change data and the database data, wherein the modification comprises operations of selection, smoothing, simplification, synthesis and the like;
s6.3, updating by using the increment, wherein the geometric updating needs to pay attention to conflict shift topology processing, the attribute updating needs to pay attention to self-defined field assignment, meanwhile, the GUID field needs to be maintained, and the newly added element needs to inherit the GUID from the increment but cannot produce a new GUID;
s6.4, maintaining the GUID relationship of the new adjacent database, namely checking whether the GUID in the small-scale database exists in the adjacent large-scale database, if not, finding the corresponding element to correct the GUID, and maintaining an association relationship table;
and S6.5, repeating the step S6.1 to the step S6.4, and updating the map data with smaller scale.
The invention has the beneficial effects that:
the invention relates to a multi-scale map database cascade updating method based on a unique identification code, which has the following technical effects compared with the prior art:
(1) the multi-scale map database cascading updating method based on the unique identification code has the functions of providing a full-element incidence relation model and a dynamic maintenance mechanism between map databases with different scales, providing a set of complete cascading updating method and a matched software system thereof, realizing systematization and process of updating the multi-scale map database, greatly improving efficiency and reducing workload.
(2) The method has the advantages that a full-element incidence relation model and a dynamic maintenance mechanism are established, so that one-time matching is used for the whole life, full-element matching operation is only carried out when the initial scale is updated and is not required to be executed in each scale, and the workload of manually correcting mismatching is greatly reduced under the condition that the automatic matching precision is generally limited; based on the full-element incidence relation model, the homonymous object of each element in the series scale can be rapidly extracted, and a foundation is laid for automatic updating; the updating method taking the incremental cascade updating mode as the core only updates the change part, thereby greatly reducing the workload; the invention builds a cascade update software system, systematizes and streamlines the update process, provides rich data editing tools, automatic semi-automatic update processing tools, association relationship maintenance tools, data quality inspection tools and data matching tools, meets the requirements of update operation, and is also suitable for cascade update of organized, same-standard and series vector map databases except a multi-scale map database.
(3) The method has the advantages that the method can better support the updating work of the multi-scale map database, creates an emergency drawing mode around the construction of a rapid map supply service system, and greatly improves the guarantee capability of emergency maps.
Drawings
FIG. 1 is a tree scale relationship model diagram of the present invention;
FIG. 2 is a dynamic maintenance flow of associations of the present invention;
FIG. 3 is a flow chart of the incremental cascade update mode of the present invention;
FIG. 4 is a cross-scale cascading data update flow diagram of the present invention.
Detailed Description
The invention will be further described with reference to the accompanying drawings in which:
the multi-scale map database is a spatial database constructed for the purpose of rapid map making, the data mainly comes from national basic mapping data, is formed by processing and processing such as data sorting, conflict processing, topology processing, classification and grading, map contraction and compilation (such as selection, simplification, smoothing, shifting, aggregation and abstraction), and generally comprises basic data scales (with slightly different scale types according to different application requirements) of 1:5 thousands, 1:10 thousands, 1:25 thousands, 1:50 thousands and 1:100 thousands. In order to keep the situation of the multi-scale map database, updating and maintaining multi-scale map data according to time is needed, and in order to solve the problem of cascade updating in updating and maintaining, the patent provides a multi-scale map database cascade updating method based on a unique identifier, which mainly comprises two parts of association relationship creation and dynamic maintenance.
As shown in FIG. 1: 1) Association creation and dynamic maintenance
(1) And the incidence relation model is used for describing the corresponding relation between adjacent scale homonymous objects of the multi-scale map database. In the multi-scale map database, 5 corresponding relations exist between adjacent scale homonymous objects, and if the number of the objects is described, the corresponding relations are 0:1, 1:0, 1:1, M:1 (M > 1) and M: N (M > N > 1). The multi-scale series map database belongs to a classification and coding frame, a tree structure is adopted to express the circulation of homonymous objects among data of all scales, a relation model is shown as figure 1, the model is a forest model consisting of series trees, when a large scale is contracted and coded to an adjacent small scale, two types of objects exist, one type is a abandoned object, and the objects are divided into a geometric factor abandoned object and an attribute factor abandoned object according to a selection and rejection reason; one type is an unrecessed object. The objects which are not discarded have 1:1, M:1 and M: N relations between the large scale and the adjacent small scale, tree structures are directly constructed to describe the relations, the discarded objects are associated to the nearest elements of the adjacent small scale to form virtual associations, and meanwhile, the discarded objects are marked to be discarded due to geometry or attributes.
(2) Incidence relation creation and storage, namely designing a storage table according to an incidence relation model, wherein the table is stored in an incidence relation library (the library independently exists) and has uniqueness in the library, and table fields are shown in table 1. And the identification of the corresponding relation between the adjacent scale space objects is completed by combining a matching algorithm with manual checking.
Table 1 associative table field design
Figure DEST_PATH_IMAGE001
(3) And (3) dynamic maintenance of the association relationship, namely, the method provides a service updating service of the whole process of the multi-scale map database cascade updating system, and dynamically maintains the association relationship according to processing logic by monitoring a system data editing tool.
As shown in fig. 2, the editing processing tool related to the generation and extinction of elements in the system is analyzed, and the records corresponding to the upper-level association table (i.e. all records of elements with the same name in the upper-level association table) are changed by tracing back the change of the association relationship at the current level. The following four cases are included:
a, a 'create element' tool can produce a brand-new element, a new record needs to be inserted into a relation table, and the type is set to be '1: 0';
b, deleting elements by using an element deleting tool, positioning the deleted elements in the relation table, directly clearing records if the deleted elements are in virtual association, and tracing upwards and clearing corresponding records; if the element is of type "1: 0" and the discard factor field is empty, the record is cleared; if the situation is other, the current level is unchanged, and the corresponding record is traced upwards and cleared;
c, deleting the merged element by a merging tool, transferring the association relation of the merged element to the merged element in an association table, adding a record newly if the merged element is of a type of 1:1, generating a type of 1: N, clearing the record of the merged element if the lower-level element pointed by the merged element is the same element, and generating a type of M: N except the two types; tracing upwards and transferring the association relation of the merged elements to the merged elements, wherein if the merged elements are of an M: N type, the corresponding record type is still of an M: N type, otherwise, the corresponding record is changed to be of an M:1 type;
d, generating a plurality of new elements inheriting the geometry of the original elements by the aid of a segmentation tool, a scattering tool and a line breaking tool, and inserting a new record into the relation table to inherit the original element association relation, wherein if the original element association relation is virtual association, the record is newly added, and the corresponding record is traced upwards; if the element is of a 1:0 type and the abandon factor is null, adding a record; the other elements except the segmentation elements are changed into M:1 types; and (4) inheriting the original element association relationship upwards, wherein the records with the type of 1:1 are changed into the type of 1: N, and the other records are changed into the type of M: N.
2) Multiscale cascade update
The multi-scale map data updating mode is an incremental cascade updating mode, as shown in fig. 3. Acquiring a vector updating data source as a starting point, firstly matching the updating data source with initial scale data, and extracting corresponding change information according to different types of matching failure objects; then, scale change is carried out on the change information to be converted into incremental information, and topological relation processing, conflict processing and attribute calculation are carried out on the basis, so that initial scale data are updated; secondly, extracting change information used for updating the data of the adjacent scale by using the increment information obtained in the initial scale data updating and through the incidence relation between the initial scale data and the adjacent scale data, and simultaneously converting new information and modification information in the change information from the increment information extracted by the initial scale updating; thirdly, since the scale of the change information is different from the scale of the data to be updated, the change information needs to be subjected to scale conversion to generate incremental information for direct updating, and then the updating of the adjacent scale data is completed. And by analogy, updating the map data with a smaller scale, and further realizing the synchronous updating of the series of scale data. As shown in FIG. 3, the following three parts are described from reference analysis, initial scale update and cross-scale cascade update.
(1) Reference data analysis
And comparing and analyzing the reference data and the initial scale data to confirm the feasibility of the reference data as an updating source. Specifically, the evaluation is carried out from four aspects of mathematical basis (spatial reference), spatial scale (entity expression detail degree), registration relation (position deviation degree) and data content (entity content coverage degree).
(2) Initial scale update
The primary work of data updating is to match an updated data source with initial scale data and extract corresponding change information (addition, deletion and modification), then perform scale transformation, topological relation processing, conflict processing and attribute calculation on the change information to form incremental information, perform quality inspection on the initial scale database before warehousing, finish final warehousing after quality inspection is qualified, and simultaneously record the incremental type, warehousing time and warehousing personnel during warehousing. And new GUID values are allocated to the newly added data, and when the operation of interruption or segmentation is performed, new GUID values are allocated to the data with smaller length or area in principle. The data updating sequence includes water system, traffic, residential area, vegetation, and boundary.
(3) Cross-scale cascading updates
The core of the cross-scale cascade updating is to accurately find out the related elements of the same increment in different scale data, because the different scale data are subjected to contraction editing synthesis, the geometric deformation is large, and the precision of a generally adopted geometric matching mode is unstable, a GUID field is designed in a multi-scale map library to uniquely identify each element, the GUID is used for realizing the step-by-step association of the elements, the elements are quickly searched for the influence elements of the upper and lower scales, and the elements are established and reused at one time through the dynamic maintenance of an association relation table.
Fig. 4 shows a cross-scale cascading data update process, which mainly comprises the following steps:
and step 1, comparing the increment with adjacent scale data to extract change information. And matching elements corresponding to the increment in the adjacent scale library through the association relation table, and determining the addition, deletion and modification attributes of the change information according to the STACOD field and the association type of the increment.
And 2, converting the scale of the change information to generate an increment. Because the scale difference exists between the change data and the database data, the change information is modified according to the related data standard to be in line with the data standard, wherein the modification comprises selection, smoothing, simplification and comprehensive operation; wherein: the data standard is: the residential area: the area above the figure is greater than 4mm 2; road: the road connectivity is ensured, and the distance between the road connectivity and a water system symbol is 0.28 mm; water system: ensure the connectivity of the water system and correct flow direction. Simplifying the smoothing index: the curve is 1mm on the sketch and is smooth by 100 m.
And 3, updating by using the increment. Geometry updates take care of collision shift topology handling, attribute updates take care of special meaning field assignments, and care of maintaining GUID fields, and newly added elements inherit GUIDs from deltas without producing new GUIDs.
And 4, maintaining the GUID relationship of the new adjacent database. And checking whether the GUID in the small-scale database exists in the adjacent large-scale database or not, if not, finding the corresponding element to correct the GUID, and maintaining an association relation table.
And 5, repeating the steps 1 to 4, and updating the map data with a smaller scale.
The foregoing shows and describes the general principles and features of the present invention, together with the advantages thereof. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (3)

1. A multi-scale map database cascading updating method based on a unique identification code is characterized by comprising the following steps:
s1: creating an incidence relation model: the incidence relation describes the corresponding relation between the adjacent scale homonymous objects in the multi-scale map database, 5 kinds of corresponding relations exist between the adjacent scale homonymous objects in the multi-scale map database, and the description by number is as follows: a 0:1 correspondence, a 1:0 correspondence, a 1:1 correspondence, an M:1 correspondence, and M > 1, an M: N correspondence, and M > N > 1;
s2: designing a storage table according to the incidence relation model, wherein the table is stored in an incidence relation library and has uniqueness in the library, and the identification of the corresponding relation between adjacent scale space objects is completed by combining a matching algorithm with manual check;
s3: and (3) dynamically maintaining the association relationship: dynamically maintaining the association relationship according to the processing logic by monitoring a system data editing tool;
s4: analyzing reference data: acquiring a vector updating data source as a starting point, firstly matching the updating data source with initial scale data, and extracting corresponding change information according to different types of matching failure objects;
s5: updating an initial scale: carrying out scale change on the change information to convert the change information into incremental information, and carrying out topological relation processing, conflict processing and attribute calculation on the basis of the incremental information so as to update initial scale data;
s6: and (3) cascading updating across scales: extracting change information used for updating the data of the adjacent scale by using the increment information acquired in the data updating of the initial scale and through the incidence relation between the data of the initial scale and the data of the adjacent scale, and simultaneously converting new information and modification information in the change information from the increment information extracted by the updating of the initial scale; because the scale of the change information is different from that of the data to be updated, the change information needs to be subjected to scale transformation to generate incremental information for direct updating, and then the updating of the adjacent scale data is completed; and by analogy, updating the map data with a smaller scale, and further realizing the synchronous updating of the series of scale data.
2. The multi-scale map database cascading updating method based on the unique identification code as claimed in claim 1, wherein: in step S3, the editing tool involved in the generation and extinction of elements in the system is analyzed, the current level of association relationship change is traced upwards, and the record corresponding to the upper level association table is changed, which includes the following four cases:
a, a 'create element' tool can produce a brand-new element, a new record needs to be inserted into a relation table, and the type is set to be '1: 0';
b, deleting elements by using an element deleting tool, positioning the deleted elements in the relation table, directly clearing records if the deleted elements are in virtual association, and tracing upwards and clearing corresponding records; if the element is of type "1: 0" and the discard factor field is empty, the record is cleared; if the situation is other, the current level is unchanged, and the corresponding record is traced upwards and cleared;
the merge tool deletes the merged element, transfers the associative relationship of the merged element to the merged element in the association table: if the merging elements are all of the type of 1:1, adding a record and generating the type of 1: N, if the lower-level elements pointed by the merging elements are the same element, clearing the record of the merged element, and generating the type of M: N except the two types; tracing back up transfers the association relationship of the merged elements to the merged elements: if the merging element is of the type M: N, the corresponding record type is still of the type M: N, otherwise, the corresponding record is changed to be of the type M: 1;
d, generating a plurality of new elements inheriting the geometry of the original elements by the aid of a segmentation tool, a scattering tool and a line breaking tool, and inserting a new record into the relation table to inherit the association relation of the original elements: if the virtual association exists, adding a new record, and tracing upwards to change the corresponding record; if the element is of a 1:0 type and the abandon factor is null, adding a record; the other elements except the segmentation elements are changed into M:1 types; inheriting the original element association relation upwards: the type of the record is changed to "1: N" except that the record of the type "1: 1" is changed to "1: N".
3. The multi-scale map database cascading updating method based on the unique identification code as claimed in claim 1, wherein: in step S6, the cross-scale cascade update includes the following steps:
s6.1: extracting change information by comparing the increment with adjacent scale data: matching elements corresponding to the increment in the adjacent scale library through the incidence relation table, and determining the addition, deletion and modification attributes of the change information according to the STACOD field and the incidence type of the increment;
s6.2: scaling production increments for change information: because the scale difference exists between the change data and the database data, the change information is modified according to the related data standard to be in line with the data standard, wherein the modification comprises one or more of selection, smoothing, simplification and comprehensive operation;
s6.3: update using deltas: geometry updating needs to pay attention to conflict shift topology processing, attribute updating needs to pay attention to self-defined field assignment, meanwhile, a GUID field needs to be maintained, newly added elements need to inherit GUID from increment, and new GUID cannot be produced;
s6.4: new neighbor database GUID relationship maintenance: checking whether the GUID in the small-scale database exists in an adjacent large-scale database or not, if not, finding a corresponding element to correct the GUID, and maintaining an association relation table;
s6.5: and repeating the step S6.1 to the step S6.4, and updating the map data with smaller scale.
CN202110867342.3A 2021-07-30 2021-07-30 Multi-scale map database cascading updating method based on unique identification code Pending CN113312369A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110867342.3A CN113312369A (en) 2021-07-30 2021-07-30 Multi-scale map database cascading updating method based on unique identification code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110867342.3A CN113312369A (en) 2021-07-30 2021-07-30 Multi-scale map database cascading updating method based on unique identification code

Publications (1)

Publication Number Publication Date
CN113312369A true CN113312369A (en) 2021-08-27

Family

ID=77382460

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110867342.3A Pending CN113312369A (en) 2021-07-30 2021-07-30 Multi-scale map database cascading updating method based on unique identification code

Country Status (1)

Country Link
CN (1) CN113312369A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113721969A (en) * 2021-09-08 2021-11-30 广州城市规划技术开发服务部有限公司 Multi-scale space vector data cascade updating method
CN114022779A (en) * 2021-10-25 2022-02-08 电子科技大学 SAR ship detection method based on scale network
CN114461841A (en) * 2022-04-14 2022-05-10 自然资源部第三地理信息制图院 Automatic compiling method for land utilization data
CN114880337A (en) * 2022-05-17 2022-08-09 北京百度网讯科技有限公司 Map data integrated updating method, device, equipment and storage medium
CN116882407A (en) * 2023-09-05 2023-10-13 航天宏图信息技术股份有限公司 Hierarchical connectivity construction method, device and equipment for multi-granularity geographic entities
CN116881272A (en) * 2023-09-06 2023-10-13 自然资源部第三地理信息制图院 Multi-scale map database synchronous updating method, system, equipment and medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103150398A (en) * 2013-03-27 2013-06-12 武汉大学 National fundamental geographic information data-based incremental map updating method
CN105302914A (en) * 2015-11-13 2016-02-03 国家基础地理信息中心 Fast topographic map charting database updating method based on increment and linkage
CN106372087A (en) * 2015-07-23 2017-02-01 北京大学 Information retrieval-oriented information map generation method and dynamic updating method
CN106874517A (en) * 2017-03-15 2017-06-20 广州城市信息研究所有限公司 The treating method and apparatus of map vector service
CN109145171A (en) * 2018-07-23 2019-01-04 广州市城市规划勘测设计研究院 A kind of multiple dimensioned map data updating method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103150398A (en) * 2013-03-27 2013-06-12 武汉大学 National fundamental geographic information data-based incremental map updating method
CN106372087A (en) * 2015-07-23 2017-02-01 北京大学 Information retrieval-oriented information map generation method and dynamic updating method
CN105302914A (en) * 2015-11-13 2016-02-03 国家基础地理信息中心 Fast topographic map charting database updating method based on increment and linkage
CN106874517A (en) * 2017-03-15 2017-06-20 广州城市信息研究所有限公司 The treating method and apparatus of map vector service
CN109145171A (en) * 2018-07-23 2019-01-04 广州市城市规划勘测设计研究院 A kind of multiple dimensioned map data updating method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
张寿选: "基于GUID的多尺度核心要素数据级联更新方法研究", 《测绘与空间地理信息》 *
肖计划等: "多尺度矢量地图数据关联自动更新研究", 《测绘工程》 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113721969A (en) * 2021-09-08 2021-11-30 广州城市规划技术开发服务部有限公司 Multi-scale space vector data cascade updating method
CN113721969B (en) * 2021-09-08 2024-02-06 广州城市规划技术开发服务部有限公司 Multi-scale space vector data cascade update method
CN114022779A (en) * 2021-10-25 2022-02-08 电子科技大学 SAR ship detection method based on scale network
CN114022779B (en) * 2021-10-25 2023-05-26 电子科技大学 SAR ship detection method based on scale network
CN114461841A (en) * 2022-04-14 2022-05-10 自然资源部第三地理信息制图院 Automatic compiling method for land utilization data
CN114880337A (en) * 2022-05-17 2022-08-09 北京百度网讯科技有限公司 Map data integrated updating method, device, equipment and storage medium
CN114880337B (en) * 2022-05-17 2023-11-24 北京百度网讯科技有限公司 Map data integrated updating method, device, equipment and storage medium
CN116882407A (en) * 2023-09-05 2023-10-13 航天宏图信息技术股份有限公司 Hierarchical connectivity construction method, device and equipment for multi-granularity geographic entities
CN116882407B (en) * 2023-09-05 2023-12-15 航天宏图信息技术股份有限公司 Hierarchical connectivity construction method, device and equipment for multi-granularity geographic entities
CN116881272A (en) * 2023-09-06 2023-10-13 自然资源部第三地理信息制图院 Multi-scale map database synchronous updating method, system, equipment and medium
CN116881272B (en) * 2023-09-06 2023-11-07 自然资源部第三地理信息制图院 Multi-scale map database synchronous updating method, system, equipment and medium

Similar Documents

Publication Publication Date Title
CN113312369A (en) Multi-scale map database cascading updating method based on unique identification code
CN101673410B (en) Vector building drawing based method for reconstructing three-dimensional model
CN112347222B (en) Method and system for converting non-standard address into standard address based on knowledge base reasoning
CN113434623B (en) Fusion method based on multi-source heterogeneous space planning data
CN111680025A (en) Method and system for intelligently assimilating space-time information of multi-source heterogeneous data oriented to natural resources
CN113157665B (en) Intelligent all-in-one geographic information system
CN109190094B (en) Building information model file segmentation method based on IFC standard
CN105468677A (en) Log clustering method based on graph structure
CN111144089B (en) Method and equipment for checking difference between part list and model file of design software
CN105302914A (en) Fast topographic map charting database updating method based on increment and linkage
CN110795835A (en) Three-dimensional process model reverse generation method based on automatic synchronous modeling
CN114840900A (en) Derivative BIM component automatic generation method based on i-GBDT technology
CN116244333A (en) Database query performance prediction method and system based on cost factor calibration
CN114996370A (en) Data conversion and migration method from relational database to semantic triple
CN106503811A (en) A kind of infrastructure full life cycle management method based on big data
CN113721969B (en) Multi-scale space vector data cascade update method
Nguyen et al. A multi-perspective approach to interpreting spatio-semantic changes of large 3D city models in CityGML using a graph database
CN107943929A (en) The automatic generating method of wrapper being abstracted based on dom tree
KR101063827B1 (en) Semi-automated Conjugated Point Pair Extraction Method for Transformation of Geometric Maps between Continuous and Digital Topographic Maps
CN116777671A (en) Large-scale energy storage resource management method and system based on automatic topology display generation
CN108170989B (en) Engineering construction model derivation method based on BIM technology
CN114612071A (en) Data management method based on knowledge graph
CN112287005A (en) Data processing method, device, server and medium
CN108170987B (en) BIM technology-based PBS structure automatic hanging method
CN117608545B (en) Standard operation program generation method based on knowledge graph

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination