KR101046410B1 - Partial update method for maintaining a reference value with neighboring leaves and system therefor - Google Patents

Abstract

According to an embodiment of the present invention, a first step of taking a relative value of a side by designating the number of nodes and an ordinal of a side for each side of a leaf and an adjacent leaf of a specific region in a server, and partially updating the relative leaf with reference to the relative value Wow; A second step of accessing the server from the navigation and comparing the version of the leaf information in the server with the version of the leaf information stored in the navigation; Receiving leaf information if the leaf information of the server is higher than the leaf information of the navigation; A partial updating method of maintaining a reference value with an adjacent leaf which comprises a fourth step of terminating the connection with the server and guiding a path according to the leaf information after the partial update is applied by applying the same version comparison algorithm of the server; A system therefor, wherein a small change in the machining process through the above loading method in the pretreatment process can reduce the overhead in the process of reprocessing the updated data on the terminal called post-processing. .

Leaf information, version, partial update, reference value

Description

System and method for partial updating keep reference data with adiacency map}

The present invention relates to a navigation system. More particularly, the present invention relates to a neighboring leaf which can reduce the overhead of data transmission / reception due to neighboring in partial data update by implementing an index self referencing method for referencing neighboring information in leaf information. A partial update method for maintaining a reference value of and a system therefor.

In general, navigation stores map data in a storage unit such as a memory and provides various services to a user of a predetermined moving object such as a vehicle using the stored map data. For example, the current position of the moving object is displayed on the display unit along with a map so that the user can accurately check the current position of the moving object, and also plan the driving route from the starting point to the destination of the moving object by using the map data. Various services are provided such as guiding a moving object to travel along a driving route.

In addition, the navigation system is generally mounted on various moving objects such as ships, aircrafts, vehicles, etc. to inform the driver of the current position of the moving object, calculate the optimal route to the desired destination, and guide the driver according to the route. In such a navigation system, a navigation terminal typically stores map data and guides an optimal route to a destination using the stored map data. That is, the navigation terminal stores information on actual roads, buildings, and facilities as numerical map data according to a predetermined format, and matches the location information received from the GPS to pre-stored map data to display the optimal route to the destination for the moving object. Guide through. However, actual roads, buildings, and facilities change from time to time. Therefore, the map data of the navigation terminal also needs to be updated with the reception to reflect the changing roads, buildings, and facilities.

That is, the conventional update method has to make a separate effort to visit the service center directly or to re-install the road information provided in the system for the road information update, there is a problem that a considerable cost is required to update the road information.

1A to 1B are explanatory diagrams of one temporary screen for partial updating in a conventional navigation system.

1A to 1B, in the case of storing vector data including nodes and links in map data of general navigation, parts such as a map leaf attribute part (header), node information part, link information part, node and link connection information part, etc. Divided into This is no different for DBMS and File Based DB. When expressed as above, the numbers 0 through 6 represent the node indices of adjacent leaves in E leaves. The left part before each number is assumed to be the node index in the adjacent map for that node.

 In this case, if the reason for the update occurs for the E leaf, and the update is performed, when the links (nodes) shown in FIG. 1B are added, a node N having an index of 3 may be generated. At this time, when looking at the node P, it is a node having an e-index in the F leaf, and its neighbor information will have a meaning of referring to the index 4 of the E leaf.

When the change from FIG. 1A to FIG. 1B occurs, when the adjacent reference value for P in the F leaf is confirmed, it is understood that N of the E leaf is referred.

Therefore, in addition to E, B, which has actually changed through displacement comparison with previous versions of the data, F, H, D, etc. may also require reorganization of the index. In addition, when a leaf unit update occurs, there may be an overhead in that leaf data such as F, H, and D must also be received at a time.

That is, when updating one leaf, there is a problem that adjacent leaf must also be received.

Accordingly, the present invention is to solve the above problems, in order to prevent the node index information for neighboring leaf information at the same time in the partial update method of the leaflet information to prevent the load of the data transmission for the adjacent leaf and The goal is to provide a way to update while maintaining a reference to.

The partial update system which maintains a reference value with neighboring leaves according to the present invention takes the relative value of the sides by designating the number of nodes and the ordinal of the sides for each side of the leaf and the adjacent leaf of a specific area, and when the change of the leaf occurs, A server for partially updating the relative updated value by referring to a relative value and transmitting the partially updated leaflet information to the navigation according to a request of the navigation;

Access the server and compare the version of the leaf information in the server with the version of the leaf information stored in the navigation. If the leaf information of the server is higher than the leaf information of the navigation, the leaf information is received, and the partial update is completed. It consists of a navigation to guide the route according to the map information.

In addition, the partial update method for maintaining a reference value with the neighboring leaf in accordance with the present invention, by specifying the number of nodes and the ordinal of the sides for each side of the leaf and the neighboring leaf of a specific area in the server to take the relative value of the side, and change the leaf A first step of partially updating with reference to the relative value when this occurs; A second step of accessing the server from the navigation and comparing the version of the leaf information in the server with the version of the leaf information stored in the navigation; Receiving leaf information if the leaf information of the server is higher than the leaf information of the navigation; Comprising a fourth step of terminating the connection with the server, and guides the path according to the leaf information, the partial update is completed by applying the same version comparison algorithm of the server.

In addition, the navigation according to the present invention includes a receiving unit for receiving the partially updated leaf information from the server; A storage unit for storing the leaf information and the leaf information received from the server; Comparing the leaf information of the server with the leaf information version of the storage, if the leaf information of the server is higher than the leaf information stored in the storage, the leaf information of the server is partially updated, and the leaf information is partially applied. A controller for guiding a route; And a display unit for displaying the partially updated leaf information.

The partial update method and the system for maintaining the reference value with the neighboring leaf according to the present invention, if the processing process is slightly changed through the loading method as described above in the pre-processing, the updated data on the terminal called the post-processing This can reduce the overhead in the reprocessing process.

The above-mentioned objects, features and advantages will become more apparent from the following detailed description in conjunction with the accompanying drawings. Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

2 is a block diagram of a navigation according to the present invention.

Referring to FIG. 2, the receiver 200 receives partially updated leaf information from a server.

The key input unit 210 includes a plurality of function keys as a user interface, and outputs key signals for the keys to the controller 250.

The storage unit 220 stores the leaf information and the existing leaf information received from the server.

Preferably, the leaf information includes pre-stored map data and the latest map data received from the server.

In addition, the storage unit 220 stores map data of a plurality of levels having different scales.

The sound output unit 230 includes a speaker provided in the navigation and outputs an audio signal stored in the storage unit 120 in an audible state under the control of the controller 150.

The display unit 240 displays partially updated leaf information.

The controller 250 compares the leaf information of the server (not shown) with the leaf information version of the storage unit, and if the leaf information of the server is higher than the leaf information stored in the storage unit, partially updated leaf information of the server. Receives, and guides the route by applying part of the map.

In addition, the control unit 250 applies the same version comparison algorithm of the server to take the relative value of the sides by specifying the number of nodes and the ordinal of the sides for each side of the leaf and neighboring leaf of a specific region, and the change of the leaf See relative value above.

In addition, the controller 250 determines an order of sides in a clockwise or counterclockwise direction by designating an arbitrary point of the adjacent leaf as a reference point.

In addition, when referring to the leaf in the adjacent leaf, the controller 250 obtains the node index number in the leaf by adding all the nodes of the previous side from the ordinal of the side.

In addition, the controller 250 determines whether the latest leaf information is the latest information by referring to a version given for each object.

3 is a flowchart illustrating a partial update method of maintaining a reference value with an adjacent map leaf according to the present invention.

Referring to FIG. 3, the server takes a relative value of a side by designating the number of nodes and an ordinal of a side for each side of a leaf and an adjacent leaf of a specific region, and partially updates the relative leaf with reference to the relative value. (S300).

Preferably, an arbitrary point of the adjacent leaf is designated as a reference point to order the sides clockwise or counterclockwise.

More preferably, when referring to the leaf in the neighboring leaf, the node index number in the leaf is obtained by adding all the nodes of previous sides in the ordinal of the side.

The navigation accesses the server and compares the version of the leaf information in the server with the version of the leaf information stored in the navigation (S310).

If the leaf information of the server is higher than the leaf information of the navigation, the leaf information is received (S320).

When the reception is completed, the connection with the server is terminated, and the path is guided according to the leaf information of which the partial update is completed by applying the same version comparison algorithm of the server (S330).

Preferably, the latest information on the leaf information is determined by referring to a version given for each object.

In addition, the leaf information uses any one or more units of a link, a node, or a mesh.

Preferably, the foliage is applied to any one or more of quadrilaterals or polymorphs.

The partial update method described so far will be described in more detail with reference to FIGS. 4A to 4C.

4A to 4C are exemplary views illustrating a partial update method for maintaining a reference value with an adjacent map leaf according to the present invention.

4A-4B, each adjacent node takes the relative value of the side instead of having a direct node index in the adjacent leaf. Then specify the number of nodes and the ordinal of each side. In this case, if there is abstract data as shown in FIG. 4A, the index of each node is shown in the figure. N: N is the index of the node. Black / Left means the node index number in the E leaf, and Red / Right means the sequence number on the side. In the present example, the order of the sides in the clockwise direction is defined based on the lower left vertex. In other words, adjacent node information is located in order according to the ordinal number of the sides, but the order within the same sides is irrelevant.

 When the P node is represented in the E leaf, it indicates (the neighboring node of the F leaf and the fourth node), and the reference value is expressed as 1 and the meaning is equal to (F, third side = 2,1). Preferably, the third side = 2 means the ordinal of the side, and the third side = 1 means a reference value.

In this case, when referring to the E leaf in the F leaf, to refer to the P node actual index of the E leaf, take the value of 1 known from the P node of the E leaf and add the number of nodes of the previous sides in the ordinal of the side. You can get the node index number at.

Idx = O (n) + r;

However, O (n) means the total number of nodes up to the n-1th side.

In one example, since the third left side of the E leaf is 2 (E-D) +1 (E-B) +1, it can be seen that it is the fourth node of the E leaf.

That is, since the number of indexes contacting the E leaf and the D leaf is 2, the number of indexes contacting the E leaf and the B leaf is 1 and the reference value 1 is 4, it can be seen that it is the fourth node of the E leaf. will be.

 In this case, assuming that the update occurs as shown in FIG. 4B, the new node information N is added as index 3 in the E leaf as shown in FIG. 4B, and the existing P node is described as changed to index 5. . In the F leaf, the reference value of P still has the same value as (F, third side = 2, 1), and it becomes 2 (E-D) +2 (E-B) +1, which is node 5.

The E and B maps are updated according to the direct requirement that N nodes are inserted, but in the present invention, since the relative values are taken only by the number of nodes for each side and the sequence number of nodes in the side, D, which is not related to D, In the case of F and H, the rearrangement of neighbor node indexes and the like is not necessary. Therefore, it can be seen that there is no problem in referencing adjacent values with E leaves even if the whole leaf unit data is not received again.

In addition, the same can be applied to the multi-layered leaf which is not tetramorphic as shown in FIG. 4B. That is, it is possible to express it without any problem by defining the law for determining the ordinal of the corresponding side even in the case of Fig. 5c having a 1: N edge not only in the shape of the leaf boundary having the same size as shown in Fig. 4c. There is no problem with the box.

In summary, since the ID of the neighbor node is in the form of an index on the neighboring edge of the leaf, the changed contents are included in the received content. Therefore, there is no need for a special index table called neighbor node table. This eliminates the need for reprocessing or downloading after updating. As a result, the present invention reduces the amount of comparison target range in the version comparison algorithm.

In addition, the server designates the number of nodes and the ordinal number of the sides for each side of the leaf and the adjacent leaf of the specific region, and when the change of the leaf occurs, the partial update is performed by referring to the relative value. Receives the leaf information after the partial update is completed, but since the version comparison algorithm of the server must be applied in the same way in order to partially apply the leaf information on which the partial update is completed in the navigation, the portion maintaining the reference value with the adjacent leaf of the present invention. The update method applies to both server and navigation.

The present invention described above is capable of various substitutions, modifications, and changes without departing from the spirit of the present invention for those skilled in the art to which the present invention pertains. It is not limited by the drawings.

1A to 1B are explanatory diagrams of one temporary screen for partial updating in a conventional navigation system.

2 is a block diagram of a navigation according to the present invention.

3 is a flowchart illustrating a partial update method of maintaining a reference value with an adjacent map leaf according to the present invention.

4A to 4C are exemplary views illustrating a partial update method for maintaining a reference value with an adjacent map leaf according to the present invention.

DESCRIPTION OF THE RELATED ART [0002]

200: receiving unit 210: key input unit

220: storage unit 230: sound output unit

240: display unit 250: control unit

Claims (15)

A first step of designating the number of nodes and the ordinal of the sides of each leaf of the leaf and the neighboring leaf of the specific region in the navigation to obtain a relative value of the side, and partially updating the relative leaf with reference to the relative value; A second step of connecting to the server from the navigation and comparing the version of the leaf information in the server with the version of the leaf information stored in the navigation; A third step of receiving the leaf information if the leaf information of the server is higher than the leaf information of the navigation; And Terminates the connection with the server, generates a relative value of the side as the number of nodes and the ordinal of the side for each side of the leaf and the adjacent leaf of the specific region, and if the change of the leaf occurs, partial update with reference to the relative value And maintaining a reference value with a neighboring leaf in a fourth step of guiding a path according to the leaf information on which the partial update is completed. The method of claim 1, And specifying a point of the adjacent leaf as a reference point to determine the order of sides in a clockwise or counterclockwise direction. The method of claim 1, And referring to the leaf in the neighboring leaf, the node index number in the leaf is obtained by adding all the nodes of previous sides from the ordinal of the side. The method of claim 1, And whether the latest information of the leaf information is determined by comparing the leaf information of the server and the version of the leaf information of the navigation, respectively. The method of claim 1, And the leaf information uses a unit, at least one of a link, a node, and a mesh. The method of claim 1, Wherein said leaf is applied to at least one of quadrilateral and polymorph. The number of nodes and the ordinal number of the sides are specified for each side of the leaf and the adjacent leaf of a specific region to take the relative value of the side, and when the change of the leaf occurs, the partial update is made by referring to the relative value and the partial update is performed according to the request of the navigation. A server for transmitting the leaf information to the navigation device; Access the server and compare the version of the leaf information in the server with the version of the leaf information stored in the navigation. If the leaf information of the server is higher than the leaf information of the navigation, the leaf information is received. A partial update system that maintains a reference value with adjacent leaflets including navigation that guides the path according to left leaflet information. The method of claim 7, wherein The navigation is Receiving unit for receiving the partially updated leaf information from the server; A storage unit for storing the leaf information received from the server and the existing leaf information; Comparing the leaf information of the server with the leaf information version of the storage, if the leaf information of the server is higher than the leaf information stored in the storage, the leaf information of the server is partially updated, and the leaf information is partially applied. A controller for guiding a route; And a display unit for displaying the partially updated leaflet information. The method of claim 8, The controller applies the same version comparison algorithm of the server to take the relative value of the side by specifying the number of nodes and the ordinal number of the side of each leaf of the leaf and the adjacent leaf of a specific area, and if the change of the leaf occurs, the relative value A partial update system for maintaining a reference value with an adjacent map leaf, characterized in that the partial update with reference to. The method of claim 8, And the storage unit stores a reference value with neighboring maps, wherein the storage unit stores a plurality of levels of map data having different scales. The method of claim 9, The control unit maintains a reference value with the neighboring leaf, characterized in that the order of the sides in the clockwise or counterclockwise direction by designating any point of the neighboring leaf as a reference point. The method of claim 9, And the control unit obtains a node index number in the leaf by adding all the nodes of previous sides from the ordinal of the side when the leaf is referenced in the neighboring leaf. The method of claim 8, And whether the latest information of the leaf information is determined by comparing the leaf information of the server and the version of the leaf information of the navigation, respectively. The method of claim 8, The leaflet information is a partial update system for maintaining a reference value with the neighboring leaf, characterized in that using any one or more units of a link, node or mesh. The method of claim 8, And the leaflet is applied to any one or more of a quadrilateral or a polymorphism.

Images