CN105698804B - Complete packet update method and system for solving data collision during navigation data incremental update - Google Patents
Complete packet update method and system for solving data collision during navigation data incremental update Download PDFInfo
- Publication number
- CN105698804B CN105698804B CN201610027595.9A CN201610027595A CN105698804B CN 105698804 B CN105698804 B CN 105698804B CN 201610027595 A CN201610027595 A CN 201610027595A CN 105698804 B CN105698804 B CN 105698804B
- Authority
- CN
- China
- Prior art keywords
- data
- link
- mesh
- complete packet
- navigation data
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
- G01C21/30—Map- or contour-matching
- G01C21/32—Structuring or formatting of map data
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Instructional Devices (AREA)
- Traffic Control Systems (AREA)
Abstract
A kind of complete packet update method and system for solving data collision in navigation data of the present invention, based on its distinguishes data between new and old edition, by analyzing the connection relation between distinguishes data, using relevant MESH as a complete packet, to ensure that the logical relation of entire data after updating will not be destroyed.Now compared with the prior art, reduce newer data volume, has saved newer cost, time, solved data collision, maintained data integrity, be conducive to user experience.
Description
Technical field
The present invention relates to for solving the complete packet update method of data collision during navigation data incremental update and being
System belongs to the crossing domain of navigation, electronic map and data storage.
Background technology
With the extensive use of satellite positioning tech, development of Mobile Internet technology, to navigation, location-based service and some other
The fast development of the related industries such as value-added service.Navigation software just develops towards the direction of intelligence, facilitation, personalization, and
This everything is all based in the navigation map data of bottom, therefore whether the information of navigation map is accurate in time
Really, the experience of navigation results and user will be directly affected.And popular most of navigation softwares currently on the market, both limited by ground
The renewal frequency for scheming manufacturer, affects user experience.
In order to solve map limitation, the benign perception of user is promoted, the development of entire navigation industry, partial navigation software are promoted
Developer has started the research and development to cartography incremental updating." cartography incremental updating " i.e. user is needed by itself, selects oneself to think
Newer map area is wanted, and carries out the update of the information such as map POI and road by cloud server, to ensure region
The newest property of map.It is a kind of huge progress from traditional complete update to " incremental update ", its Heterosis is updating
Quantity amount is less, and speed is faster.But " incremental update " encounters unavoidable problem, navigation data has its special
Storage mode usually stores according to certain regular piecemeal, subregion, has mutual logical relation between block and block, therefore "
" a unavoidable problem is how to determine newer range (i.e. which MESH) all do not have in industry at present to incremental update
It is to expand newer range to have a kind of solution of maturation, the more method of use, and such a process increases newer
Data volume can not also ensure the logical relation of the adjacent data block of newer data boundary, when the data quilt of boundary
Error in data can be caused when use.
Invention content
In view of this, the present invention provides a kind of method that can solve data collision during navigation data incremental update,
Ensure the complete packet update method that the logical relation of entire data after updating will not be destroyed.
A kind of complete packet update method for solving data collision during navigation data incremental update, it is described for solving
Certainly the complete packet update method of data collision includes the following steps during navigation data incremental update：
S1, the navigation data for reacquiring presetting update area, will newly obtain navigation data and existing navigation data
It is compared, and the distinguishes data in new acquisition navigation data is stored according to MESH storages in set A；
S2, any one MESH data in set A are taken out successively, be defined as set B, while will move in set B
MESH data are deleted from set A；
S3, judge in the MESH data of set A with the presence or absence of the boundary LINK with the connecting of the MESH data of set B, if
In the presence of, then whole LINK in the MESH where the LINK of the boundary are deposited in set B, and they are deleted from set A,
Until each LINK of MESH data judges to finish in set B, set B is loaded as a complete packet；
S4, judge in set A whether each MESH data is moved and judge to finish in set B, if it is determined that finishing, then
The complete packet loaded according to set B is updated the presetting corresponding complete packet of update area.
A kind of complete packet system for solving data collision during navigation data incremental update, it is described for solving to lead
The complete packet system of data collision includes following functions module in data increment renewal process of navigating：
Data acquisition module, the navigation data for reacquiring presetting update area, will newly obtain navigation data
It is compared with existing navigation data, and the distinguishes data in new acquisition navigation data is stored in set A according to MESH storages
In；
Independent acquisition module is used to take out any one MESH data in set A successively, is defined as set B, while will move
The MESH data entered in set B are deleted from set A；
It is connected with the presence or absence of with the MESH data of set B in correlation judgment module, the MESH data for judging set A
Boundary LINK, if it is present whole LINK in the MESH where the LINK of the boundary are deposited in set B, and by it
Deleted from set A, until each LINK of MESH data judges to finish in set B, by set B be loaded as one it is complete
Standby packet；
Complete packet update module has judged for judging in set A whether each MESH data is moved in set B
Finish, if it is determined that finishing, then the complete packet loaded according to set B, to the presetting corresponding complete packet of update area
It is updated.
It is of the present invention for solve during navigation data incremental update the complete packet update method of data collision and its
System, will be relevant by analyzing the connection relation between distinguishes data based on the distinguishes data between new and old edition
MESH is as a complete packet, to ensure that the logical relation of entire data after updating will not be destroyed.Now compared with the prior art,
Reduce newer data volume, saved newer cost, time, solved data collision, maintains data integrity, favorably
In user experience.
Description of the drawings
Fig. 1 is the complete packet update method of the present invention for solving data collision during navigation data incremental update
Flow diagram；
Fig. 2 is the flow diagram of step S1 in Fig. 1；
Fig. 3 is the flow diagram of step S3 in Fig. 1；
Fig. 4 is the flow diagram of step S31 in Fig. 3；
Fig. 5 is the schematic diagram of distinguishes data set A of the present invention；
Fig. 6 is the complete packet update method of the present invention for solving data collision during navigation data incremental update
Step flow diagram；
Fig. 7 is the complete packet more new system of the present invention for solving data collision during navigation data incremental update
Module frame chart；
Fig. 8 is the unit block diagram of data acquisition module of the present invention；
Fig. 9 is the unit block diagram of correlation judgment module of the present invention；
Figure 10 is the subelement block diagram of LINK judging units in boundary of the present invention.
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated, it should be understood that and the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
As shown in Figure 1, the embodiment of the present invention provides one kind for solving data collision during navigation data incremental update
Complete packet update method, the complete packet update method packet for solving data collision during navigation data incremental update
Include following steps：
S1, the navigation data for reacquiring presetting update area, will newly obtain navigation data and existing navigation data
It is compared, and the distinguishes data in new acquisition navigation data is stored according to MESH storages in set A；
S2, any one MESH data in set A are taken out successively, be defined as set B, while will move in set B
MESH data are deleted from set A；
S3, judge in the MESH data of set A with the presence or absence of the boundary LINK with the connecting of the MESH data of set B, if
In the presence of, then whole LINK in the MESH where the LINK are deposited in B, and they are deleted from A, until set B in
Each LINK of MESH data judges to finish, and set B is loaded as a complete packet；
S4, judge in set A whether each MESH data is moved and judge to finish in set B, if it is determined that finishing, then
The complete packet loaded according to set B is updated the presetting corresponding complete packet of update area.
Wherein, as shown in Fig. 2, the step S1 include it is following step by step；
S11, one update area of setting, reacquire the navigation data of the update area；
S12, the difference that the new navigation data that obtains is compared with existing navigation data, and will newly obtained in navigation data
Data are stored in set A；
S13, the distinguishes data in set A is subjected to tissue by unit region of MESH.
S14, MESH be unit region on the basis of, by the distinguishes data of set A according to NODE succession relation carry out
Tissue.
Wherein, as shown in figure 3, the step S3 include it is following step by step；
S31, a LINK is arbitrarily taken out from the MESH data of set B, is denoted as LINK A, judges whether LINK A are side
Boundary LINK；
S32, if it is, in set A search there are the LINK of succession relation with LINK A, if it is present will collect
There are the boundary LINK of succession relation to be denoted as LINK B with LINK A in conjunction A, and the MESH data where LINK B are denoted as MESH
B, and the MESH B datas where LINK B are all deposited into set B, while MESH B datas being deleted from set A；
S33, if it is not, then continue to select another LINK, until LINK all in the MESH data of set B sentences
It is disconnected to finish；
S34, all data in set B are loaded as a complete packet, empty set B, and received in next set A
MESH data.
Wherein, as shown in figure 4, the step S31 include it is following step by step；
S311, judge whether two NODE that LINK A include fall into the different regions MESH, if it is, judging LINK
A is boundary LINK；
S312, if it is not, then further judge whether one of LINK A NODE fall on boundary line, if
It is then to judge LINK A for boundary LINK；
S313, if it is not, then judging LINK A for non-boundary LINK.
Can include one or more MESH data in the set B.
Specifically, as shown in figure 5, set A includes MESH A, MESH B, MESH C, MESH D, MESH E, MESH F,
9 MESH of MESH G, MESH H, MESH I；
Complete packet of the present invention for solving data collision during navigation data incremental update according to figure 6
The step flow diagram of update method is put into set B it is found that taking out a untreated data MESH A from set A
In, data MESH A are deleted from set A, are only left MESH B, MESH C, MESH D, MESH E in set A at this time,
8 MESH of MESH F, MESH G, MESH H, MESH I；
From the data MESH A of set B take out a LINK, be denoted as LINK A, as in Fig. 5 using LINK Lb as LINK
A；
As shown in Figure 5, the connecting LINK Lc that LINK Lb are found in set A, LINK B are denoted as by LINK Lc,
Total data in MESH B where LINK Lc is added in set B, and from the whole deleted in set A in MESH B
Data, the MESH for including in set A at this time become MESH C, MESH D, MESH E, MESH F, MESH G, MESH H, MESH
7 MESH of I, and in set B include two MESH of MESH A and MESH B.
All LINK in processing set B include in set B after LINK all in set B is disposed successively
MESH be MESH A, MESH B, MESH C, MESH D, MESH H, and the MESH for including in set A be MESH E, MESH F,
MESH G, MESH I.
By all data in set B as a complete packet, the complete packet for emptying this set B in set B, Fig. 5 includes
MESH A, MESH B, MESH C, MESH D, MESH H.
Judge in set A whether each MESH data is moved to judge to finish in set B, in Fig. 5, when in set A
Each MESH data judges to finish, and set B loads to obtain 4 complete packets, complete packet 1：MESH A, MESH B, MESH C,
MESH D, MESH H.Complete packet 2：MESH E.Complete packet 3:MESH F,MESH G.Complete packet 4:MESH I.
The complete packet loaded according to set B is updated the presetting corresponding complete packet of update area.Such as
If necessary to the two pieces of regions update MESH E, MESH F in shown in Fig. 5, then need to update complete packet 2 and complete packet 3, i.e. MESH
E, MESH F, MESH G.
The present invention also provides a kind of complete packet systems for solving data collision during navigation data incremental update, such as
Shown in Fig. 7, the complete packet system for solving data collision during navigation data incremental update includes following functions mould
Block：
Data acquisition module, the navigation data for reacquiring presetting update area, will newly obtain navigation data
It is compared with existing navigation data, and the distinguishes data in new acquisition navigation data is stored in set A according to MESH storages
In；
Independent acquisition module is used to take out any one MESH data in set A successively, is defined as set B, while will move
The MESH data entered in set B are deleted from set A；
It is connected with the presence or absence of with the MESH data of set B in correlation judgment module, the MESH data for judging set A
Boundary LINK, if it is present whole LINK in the MESH where the LINK are deposited in B, and they are deleted from A
It removes, until each LINK of MESH data judges to finish in set B, set B is loaded as a complete packet；
Complete packet update module has judged for judging in set A whether each MESH data is moved in set B
Finish, if it is determined that finishing, then the complete packet loaded according to set B, to the presetting corresponding complete packet of update area
It is updated.
Wherein, as shown in figure 8, the data acquisition module includes following functions unit；
Region query unit is used to that a update area to be arranged, and reacquires the navigation data of the update area；
Distinguishes data integral unit is compared with existing navigation data for will newly obtain navigation data, and will newly obtain
The distinguishes data in navigation data is taken to be stored in set A；
MESH data organization units, for the distinguishes data in set A to be carried out tissue by unit region of MESH；
NODE data organization units, for MESH be unit region on the basis of, by the distinguishes data of set A according to
The succession relation of NODE carries out tissue.
Wherein, as shown in figure 9, the correlation judgment module includes following functions unit；
A LINK is arbitrarily taken out in boundary LINK judging units, the MESH data for oneself set B, is denoted as LINK A,
Judge whether LINK A are boundary LINK；
Succession relation searching unit, in set A search there are the LINK of succession relation with LINK A, if deposited
Then by there are the boundary LINK of succession relation to be denoted as LINK B with LINK A in set A, by the MESH data where LINK B
MESH B are denoted as, and the MESH B datas where LINK B are all deposited into set B, while MESH B datas being gathered certainly
It is deleted in A, if it is not, then continuing to select another LINK, until LINK all in the MESH data of set B has judged
Finish；
Complete packet loading unit, for all data a complete packet will to be loaded as in set B, empty set B, and receive
MESH data in next set A.
Wherein, as shown in Figure 10, the boundary LINK judging units include following functions subelement；
2 judgment sub-units, for judging whether two NODE that LINK A include fall into the different regions MESH, such as
Fruit is then to judge LINK A for boundary LINK；
When some judgment sub-units, two NODE for including as LINK A are not fallen in the different regions MESH, into
One step judges whether one of LINK A NODE fall on boundary line, if it is, judging LINK A for boundary LINK；
Non- boundary LINK judgment sub-units, two NODE for including as LINK A are fallen into the identical regions MESH, then
Judge LINK A for non-boundary LINK.
It is of the present invention for solve during navigation data incremental update the complete packet update method of data collision and its
System, will be relevant by analyzing the connection relation between distinguishes data based on the distinguishes data between new and old edition
MESH is as a complete packet, to ensure that the logical relation of entire data after updating will not be destroyed.Now compared with the prior art,
Reduce newer data volume, saved newer cost, time, solved data collision, maintains data integrity, favorably
In user experience.
Related terms of the present invention are explained：
1. incremental update
Incremental update refers to navigation data when new legacy data is updated operation, only updates the place changed, does not weigh
Multiple update.
2. complete packet
A kind of newer least unit of navigation data updates data in complete packet not shadow including one and the above MESH
Ring the logic and integrality of overall data.
3.MESH
Navigation system manages for convenience and inquiry map datum, certain geographic coordinate range is usually pressed, by map number
It is stored according to framing.Such a geographic coordinate range is known as a MESH, each geographical locations MESH and range size, distribution
One unique mark, referred to as MESH ID (MESH numbers).
4.NODE
For indicating path connected network in navigation map, the node object come is fictionalized.It can approximately be interpreted as existing
One crossing of real road.
5.LINK
Shaped form object in navigation map for indicating access between NODE and NODE, by two NODE --- starting point
NODE and terminating point NODE and several shape points composition.One section that real road connects two crossings can be approximately interpreted as
Road.
6. boundary LINK
The case where boundary across MESH is not present in LINK, and all LINK can be cut into two LINK on the boundaries MESH, for
One end falls the LINK on the boundaries MESH and is known as boundary LINK.
Apparatus above embodiment is one-to-one, the simple place of device embodiment with embodiment of the method, referring to method reality
Apply example.
Each embodiment is described by the way of progressive in this specification, the highlights of each of the examples are with other
The difference of embodiment, just to refer each other for identical similar portion between each embodiment.
Professional further appreciates that, unit described in conjunction with the examples disclosed in the embodiments of the present disclosure
And algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software generally describes each exemplary composition and step according to functionality in the above description.This
A little functions are implemented in hardware or software actually, depend on the specific application and design constraint of technical solution.Specially
Industry technical staff can use different methods to achieve the described function each specific application, but this realization is not
It should be more than the scope of the present invention.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory, memory, read-only memory,
Electrically programmable ROM, electricity can sassafras except in programming ROM, register, hard disk, moveable magnetic disc, CD-ROM or technical field institute it is public
In the storage medium for the arbitrary other forms known.
The embodiment of the present invention is described with above attached drawing, but the invention is not limited in above-mentioned specific
Embodiment, the above mentioned embodiment is only schematical, rather than restrictive, those skilled in the art
Under the inspiration of the present invention, without breaking away from the scope protected by the purposes and claims of the present invention, it can also make very much
Form, all of these belong to the protection of the present invention.
Claims (10)
1. a kind of complete packet update method for solving data collision in navigation data, which is characterized in that described for solving
The complete packet update method of data collision includes the following steps in navigation data：
S1, the navigation data for reacquiring presetting update area will newly obtain navigation data and be carried out with existing navigation data
Compare, and the distinguishes data in new acquisition navigation data is stored according to MESH storages in set A；
S2, any one MESH data in set A are taken out successively, be defined as set B, while the MESH numbers that will be moved in set B
It is deleted according to from set A；
S3, judge in the MESH data of set A with the presence or absence of the boundary LINK with the connecting of the MESH data of set B, if it does,
Then whole LINK in the MESH where the LINK of the boundary are deposited in set B, and they are deleted from set A, until
Each LINK of MESH data judges to finish in set B, and set B is loaded as a complete packet；
S4, judge in set A whether each MESH data is moved and judge to finish in set B, if it is determined that finish, then basis
The complete packet that set B is loaded is updated the presetting corresponding complete packet of update area.
2. being used to solve the complete packet update method of data collision in navigation data according to claim 1, which is characterized in that
The step S1 include it is following step by step:
S11, one update area of setting, reacquire the navigation data of the update area；
S12, the distinguishes data that the new navigation data that obtains is compared with existing navigation data, and will newly obtained in navigation data
It is stored in set A；
S13, the distinguishes data in set A is subjected to tissue by unit region of MESH；
S14, MESH be unit region on the basis of, the distinguishes data of set A is subjected to tissue according to the succession relation of NODE.
3. being used to solve the complete packet update method of data collision in navigation data according to claim 1, which is characterized in that
The step S3 include it is following step by step；
S31, a LINK is arbitrarily taken out from the MESH data of set B, is denoted as LINK A, judges whether LINK A are boundary
LINK；
S32, if it is, in set A search there are the LINK of succession relation with LINK A, if it is present by set A
There are the boundary LINK of succession relation to be denoted as LINK B with LINK A, and the MESH data where LINK B are denoted as MESH B, and
MESH B datas where LINK B are all deposited into set B, while MESH B datas being deleted from set A；
S33, if it is not, then continue to select another LINK, until LINK all in the MESH data of set B has judged
Finish；
S34, all data in set B are loaded as a complete packet, empty set B, and receive the MESH in next set A
Data.
4. being used to solve the complete packet update method of data collision in navigation data according to claim 3, which is characterized in that
The step S31 include it is following step by step；
S311, judge whether two NODE that LINK A include fall into the different regions MESH, if it is, judging that LINK A are
Boundary LINK；
S312, if it is not, then further judge whether one of LINK A NODE fall on boundary line, if it is,
Judge LINK A for boundary LINK；
S313, if it is not, then judging LINK A for non-boundary LINK.
5. being used to solve the complete packet update method of data collision in navigation data according to claim 1, which is characterized in that
Can include one or more MESH data in set B.
6. a kind of complete packet system for solving data collision during navigation data incremental update, which is characterized in that described
Complete packet system for solving data collision during navigation data incremental update includes following functions module：
Data acquisition module：Navigation data for reacquiring presetting update area, will newly obtain navigation data with
There is navigation data to be compared, and the distinguishes data in new acquisition navigation data is stored according to MESH storages in set A；
Independent acquisition module：For taking out any one MESH data in set A successively, it is defined as set B, while will move into collection
The MESH data closed in B are deleted from set A；
Correlation judgment module：With the presence or absence of the side connected with the MESH data of set B in MESH data for judging set A
Boundary LINK, if it is present whole LINK in the MESH where the LINK of the boundary are deposited in set B, and by they from
Deleted in set A, until each LINK of MESH data judges to finish in set B, by set B be loaded as one it is complete
Packet；
Complete packet update module：Judge to finish in set B for judging in set A whether each MESH data is moved, such as
Fruit judges to finish, then the complete packet loaded according to set B, is carried out more to the presetting corresponding complete packet of update area
Newly.
7. it is used to solve the complete packet system of data collision during navigation data incremental update according to claim 6,
It is characterized in that, the data acquisition module includes following functions unit；
Region query unit：For a update area to be arranged, the navigation data of the update area is reacquired；
Distinguishes data integral unit：For the new navigation data that obtains to be compared with existing navigation data, and new acquisition is led
Distinguishes data in boat data is stored in set A；
MESH data organization units：For the distinguishes data in set A to be carried out tissue by unit region of MESH；
MESH data organization units：For MESH be unit region on the basis of, by the distinguishes data of set A according to NODE's
Succession relation carries out tissue.
8. it is used to solve the complete packet system of data collision during navigation data incremental update according to claim 6,
It is characterized in that, the correlation judgment module includes following functions unit；
Boundary LINK judging units：For arbitrarily taking out a LINK from the MESH data of set B, LINK A are denoted as, are judged
Whether LINK A are boundary LINK；
Succession relation searching unit：For in set A search there are the LINK of succession relation with LINK A, if it is present
By there are the boundary LINK of succession relation to be denoted as LINK B with LINK A in set A, the MESH data where LINK B are denoted as
MESH B, and the MESH B datas where LINK B are all deposited into set B, while by MESH B datas from set A
It deletes, if it is not, then continuing to select another LINK, until LINK all in the MESH data of set B judges to finish；
Complete packet loading unit：For all data a complete packet will to be loaded as in set B, set B is emptied, and receive next
MESH data in a set A.
9. it is used to solve the complete packet system of data collision during navigation data incremental update according to claim 8,
It is characterized in that, the boundary LINK judging units include following functions subelement；
2 judgment sub-units：For judging whether two NODE that LINK A include fall into the different regions MESH, if so,
Then judge LINK A for boundary LINK；
Some judgment sub-units：When two NODE for including as LINK A are not fallen in the different regions MESH, further
Judge whether one of LINK A NODE fall on boundary line, if it is, judging LINK A for boundary LINK；
Non- boundary LINK judgment sub-units：Two NODE for including as LINK A are fallen into the identical regions MESH, then are judged
LINK A are non-boundary LINK.
10. it is used to solve the complete packet system of data collision during navigation data incremental update according to claim 6,
It is characterized in that, the set B can include one or more MESH data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610027595.9A CN105698804B (en) | 2016-01-15 | 2016-01-15 | Complete packet update method and system for solving data collision during navigation data incremental update |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610027595.9A CN105698804B (en) | 2016-01-15 | 2016-01-15 | Complete packet update method and system for solving data collision during navigation data incremental update |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105698804A CN105698804A (en) | 2016-06-22 |
| CN105698804B true CN105698804B (en) | 2018-09-28 |
Family
ID=56227376
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610027595.9A Active CN105698804B (en) | 2016-01-15 | 2016-01-15 | Complete packet update method and system for solving data collision during navigation data incremental update |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105698804B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108332766B (en) * | 2018-01-28 | 2020-09-15 | 武汉光庭信息技术股份有限公司 | Dynamic fusion planning method and system for multi-source road network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100858157B1 (en) * | 2006-12-28 | 2008-09-10 | 에스케이에너지 주식회사 | System and merhod for map uapdate, storage medium recording that method program, user termianl |
| JP2010266640A (en) * | 2009-05-14 | 2010-11-25 | Alpine Electronics Inc | Device and method for updating of map data |
| CN102597700A (en) * | 2009-10-21 | 2012-07-18 | 三菱电机株式会社 | Map information processor |
| CN103090876A (en) * | 2011-11-07 | 2013-05-08 | 伊莱比特汽车公司 | Technique for structuring navigation data |
| CN103473293A (en) * | 2013-09-03 | 2013-12-25 | 沈阳美行科技有限公司 | Navigation data partitioning method |
-
2016
- 2016-01-15 CN CN201610027595.9A patent/CN105698804B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100858157B1 (en) * | 2006-12-28 | 2008-09-10 | 에스케이에너지 주식회사 | System and merhod for map uapdate, storage medium recording that method program, user termianl |
| JP2010266640A (en) * | 2009-05-14 | 2010-11-25 | Alpine Electronics Inc | Device and method for updating of map data |
| CN102597700A (en) * | 2009-10-21 | 2012-07-18 | 三菱电机株式会社 | Map information processor |
| CN103090876A (en) * | 2011-11-07 | 2013-05-08 | 伊莱比特汽车公司 | Technique for structuring navigation data |
| CN103473293A (en) * | 2013-09-03 | 2013-12-25 | 沈阳美行科技有限公司 | Navigation data partitioning method |
Non-Patent Citations (2)
| Title |
|---|
| 导航电子地图中道路网增量信息的多尺度探测;王艳慧等;《西南交通大学学报》;20150831;第50卷(第4期);590-596 * |
| 道路数据缩编更新的自动综合方法研究;陈军等;《武汉大学学报信息科学版》;20071130;第32卷(第11期);1022-1027 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105698804A (en) | 2016-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108763538B (en) | A kind of method and device in the geographical location determining point of interest POI | |
| CN107122410A (en) | A kind of buffering updating method and device | |
| US9817835B2 (en) | Efficient data synchronization for storage containers | |
| CN104395904B (en) | Efficient data object storage and retrieval | |
| CN104135715B (en) | The implementation method of location-based service, a device, and system | |
| CN104123238A (en) | Data storage method and device | |
| CN107885758A (en) | The data migration method and dummy node of a kind of dummy node | |
| CN108694188B (en) | Index data updating method and related device | |
| CN110245129B (en) | Distributed global data deduplication method and device | |
| CN108629053A (en) | A kind of data-updating method, apparatus and system | |
| CN105426375A (en) | Relationship network calculation method and apparatus | |
| CN103514222B (en) | Storage method, management method, memory management unit and the system of virtual machine image | |
| CN104657164B (en) | Software upgrading treating method and apparatus | |
| CN108881461A (en) | A kind of data transmission method, apparatus and system | |
| CN103986779A (en) | Application data transmission method, device and terminal equipment | |
| CN105493080B (en) | The method and apparatus of data de-duplication based on context-aware | |
| CN109032958A (en) | Method and apparatus for reading data during controlling simultaneously operating | |
| CN105045536B (en) | A kind of method, apparatus and system of data storage | |
| CN110008197A (en) | A kind of data processing method, system and electronic equipment and storage medium | |
| CN110019989A (en) | A kind of data processing method and device | |
| CN105698804B (en) | Complete packet update method and system for solving data collision during navigation data incremental update | |
| CN105229641B (en) | Method and apparatus for real-time management call data | |
| CN109213447A (en) | A kind of SAN storage volume carry, discharging method and system | |
| CN103870571B (en) | Cube reconstructing method and device in Multi-dimension on-line analytical process system | |
| CN109982250A (en) | A kind of position data acquisition method, equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20161125 Address after: 430073 Hubei province East Lake New Technology Development Zone Software Park, No. 4 Optics Valley Software Park, No. six, building 2, room 7, room 01 Applicant after: Wuhan Zhonghai Data Technology Co., Ltd. Address before: 430079 Optics Valley, Hubei, East Lake Development Zone, a Software Park West, South Lake South Road, Optics Valley Software Park, No. six, No. 8, layer 2, No. 208 Applicant before: WUHAN KOTEI INFORMATICS CO., LTD. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Complete package update method and system for solving data conflict in incremental update of navigation data Effective date of registration: 20210909 Granted publication date: 20180928 Pledgee: Wuhan Jiangxia sub branch of Bank of Communications Co., Ltd Pledgor: WUHHAN KOTEL BIG DATE Corp. Registration number: Y2021980009115 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |