KR102305129B1 - Method for managing travel route database based on location and server for the method - Google Patents

Abstract

The present invention relates to a method for managing a location-based route database. The method according to the present invention includes the steps of: searching for first candidate data corresponding to a starting point on a search path from among unit data storing compressed data obtained by compressing collected path data according to a unit area; extracting second candidate data toward a target point on the search path within a predetermined range based on one node constituting the path within the extracted first candidate data; and extracting target data constituting the search path by checking whether the extracted second candidate data includes the target point. According to the present invention, since path data is compressed to a usable level and the compressed data is divided and stored, the amount of stored data can be reduced and data retrieval efficiency can be increased.

Description

{Method for managing travel route database based on location and server for the method}

The present invention relates to a method for managing a location-based route database, and more particularly, to a method for efficiently storing and retrieving route data.

This patent is a research conducted with the support of the Information and Communication Planning and Evaluation Institute with funding from the government (Ministry of Science and ICT) in 2019 (No. 2019-0-01401, Multi-signal pattern in GPS shadow area to improve positioning quality for emergency rescue development of learning-based 3D precision positioning technology).

In the case of route data, which is generally collected vehicle driving information, processing is more difficult than independent single data. The location information in the route data has a continuous relationship, and therefore, in order to analyze the route data, it is required to analyze the relationship between them.

That is, in order to extract specific information through analysis of path data, it is necessary to analyze not only the content of the data but also the relationship between the data.

In addition, since the format of information in the path data mainly exists as continuous vector information, the amount of information included in one data set may be tens of times or more thousands of times than that of general character and numeric data.

Therefore, path data requires more time and memory for indexing because of the relationship between data and the characteristics of the information contained in the data.

When these route data are simply summed and stored in a general manner, there is a problem in that all stored route data must be searched and sequential relationships of the data must be identified in order to derive additional information.

Therefore, in order to search for route data more efficiently, there is a need to reduce the amount of data that needs to be searched by default, and to devise a method for dividing and storing data according to the required data level.

An object of the present invention is to propose a method for efficiently storing path data by compressing it in order to solve the above technical problem.

Another object of the present invention is to propose an indexing method capable of retrieving compressed and stored path data.

An object of the present invention is to propose a method of compressing compressed route data to a desired degree of refinement according to the purpose and storing the compressed route data independently of the administrative notation of the map.

The method for managing a location-based route database according to the present invention for solving the above technical problem includes: searching for first candidate data corresponding to a starting point on a search route among unit data storing collected route data according to a unit area; extracting second candidate data toward a target point on the search path within a predetermined range based on one node constituting the path within the extracted first candidate data; and extracting target data constituting the search path by checking whether the extracted second candidate data includes the target point.

It is preferable to repeatedly extract new second candidate data based on one node in the second candidate data according to the confirmation result.

Preferably, the path data is compressed data generated by omitting some nodes according to a relative positional relationship of a plurality of nodes constituting the path data.

The unit data may include location information of a node on the compressed data included in the corresponding unit area and information on a movement direction from the node on a path.

Preferably, the compressed data is compressed according to a compression ratio defined as a difference between a path length of the path data and a compression path length of the compressed data.

Preferably, the compressed data is stored as unit data indexed based on a unit area determined according to a resolution defining the size of the unit area.

It is preferable that the unit area continuously divides map data including location information corresponding to a path in the same shape and size.

Preferably, the target data includes a plurality of unit data related to the search route, and calculating travel information of the search route using the target data.

A location-based route database management server according to the present invention for solving the above technical problem includes: a route data collection unit for collecting route data; a unit data indexing unit indexing and storing the path data according to a unit area; a search route receiver configured to receive a search route including information on a starting point and a destination point of a route to be searched; and searching for first candidate data corresponding to a starting point on the search path among the unit data, and selecting a destination point on the search path within a predetermined range based on one node constituting the path in the extracted first candidate data. and a target data extraction unit for extracting target data constituting the search path by extracting the second candidate data directed thereto.

It is preferable to check whether the extracted second candidate data includes the target point, and to repeatedly extract new second candidate data based on a node in the second candidate data according to the verification result.

Preferably, the apparatus further includes a compressed data generator configured to generate the compressed data by omitting some nodes according to a relative positional relationship of a plurality of nodes constituting the path data.

Preferably, the unit data index unit stores location information of a node on the compressed data included in the unit area and information on a direction of movement on a path from the node as unit data.

Preferably, the compressed data is stored as unit data indexed based on a unit area determined according to a resolution defining the size of the unit area.

The target data includes a plurality of unit data related to the search route, and further includes a travel information generator configured to calculate travel information of the search route by using the target data.

A location-based route database management method according to the present invention for solving the above technical problem includes collecting route data; generating compressed data for generating compressed data in which a path is simplified by omitting some nodes according to a relative positional relationship of a plurality of nodes constituting the collected path data; and location information of a node on the compressed data included in the unit area based on the unit area and information on a direction of movement on a path from the node as unit data.

A location-based route database management server according to the present invention for solving the above technical problem includes: a route data collection unit for collecting route data; a compressed data generation unit generating compressed data in which a path is simplified by omitting some nodes according to a relative positional relationship of a plurality of nodes constituting the collected path data; and a data indexing unit configured to store, as unit data, location information of a node on the compressed data included in the unit area based on the unit area and information on a movement direction from the node on a path.

According to the present invention, the amount of data to be stored can be reduced because the path data is compressed to a usable level and the compressed data is divided and stored.

In addition, since compressed data is classified and stored using absolute locations, it can be used as permanent information regardless of changes in administrative districts.

In addition, since each of the divided data has meaningful information according to the compressed path as such, it can be utilized in response to a wider range of search paths.

In addition, it is possible to increase the search efficiency of the entire data by dividing a lot of route data into unit areas and quickly searching only the data for a specific section.

Therefore, even with a small amount of resources, it is possible to extract traffic volume and other traffic condition-related information in a desired area or section from massive route data and provide it to users.

1 is a diagram illustrating a configuration example of a system for providing a location-based route database management service according to an embodiment of the present invention.
2 is a diagram illustrating an example of compressed data according to an embodiment of the present invention.
3 is a diagram illustrating an example of unit data according to an embodiment of the present invention.
4 is a diagram illustrating a process of a route data management method according to an embodiment of the present invention.
5A and 5B are diagrams illustrating examples according to resolution of unit data according to an embodiment of the present invention.
6 is a diagram showing the configuration of a location-based path database management server according to an embodiment of the present invention.

The following is merely illustrative of the principles of the invention. Therefore, those skilled in the art can devise various devices that, although not explicitly described or shown herein, embody the principles of the invention and are included in the spirit and scope of the invention. In addition, it should be understood that all conditional terms and examples listed herein are, in principle, expressly intended only for the purpose of understanding the inventive concept and are not limited to the specifically enumerated embodiments and states as such. .

The above-described objects, features and advantages will become more apparent through the following detailed description in relation to the accompanying drawings, and accordingly, those of ordinary skill in the art to which the invention pertains will be able to easily practice the technical idea of the invention. .

In addition, in the description of the invention, if it is determined that a detailed description of a known technology related to the invention may unnecessarily obscure the gist of the invention, the detailed description thereof will be omitted. Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating a configuration example of a system for providing a location-based route database management service according to an embodiment of the present invention.

With the development of vehicle communication network technology, vehicle-to-vehicle communication network (V2V (Vehicle to Vehicle) communication network), vehicle-to-infrastructure communication network (V2I (Vehicle to Infrastructure) communication network), etc. The same route data may be collected.

Accordingly, the route data management server 1000 (hereinafter referred to as a service server) that provides the route data management service may collect data from various objects in conjunction with a communication infrastructure.

For example, the service server 1000 may receive travel information for each section of various vehicles by interworking with the communication network 230 between the vehicle and the infrastructure.

It is also possible to collect driving information directly from various user terminals 220 . Alternatively, it is also possible to collect driving record information directly collected from the vehicle 210 .

The service server 1000 may store and manage the various information collected in the above manner as route data.

The service server 1000 may calculate a traffic volume using the stored route data or generate traffic-related traffic information, and may provide the generated traffic information to a user or other service subjects 10 .

As described above, the collected path data has a large amount of information unlike general text data according to the characteristics of the data, and it is necessary to refer to the interrelationship between the data, so storage and management are difficult.

For example, if route data from Seoul to Daejeon are stored, tens of thousands of coordinate information may be included in route data from Seoul to Daejeon.

Therefore, in order to store such coordinate information in correspondence with administrative districts one by one, and to utilize the stored data, an index for the coordinates of the stored data must be separately configured.

However, if the path data is compressed based on an important point, and the compressed data is divided and stored, each of the divided data itself can have meaningful information.

Hereinafter, an efficient storage and management method of route data according to the present embodiment will be described with reference to the drawings.

First, a method of simplifying the collected route data will be described with reference to FIG. 2 .

For example, the user's route data as in step (a) may be collected. The path data may be composed of a set of coordinates of points constituting the path, or may be composed of a node defining a specific point according to a data format and a link connecting the nodes.

That is, according to the general method, the route traveled by the user is collected as route data in the same form as in step (a), and each node is stored in correspondence with the administrative district.

However, actual route data may be composed of numerous nodes and links. If stored separately for each node, the number of data increases, and many resources are required for search. In addition, depending on the subject that collects the route data, the criteria of the node may be different, and there may be problems in indexing the route data.

Therefore, in this embodiment, path data can be compressed.

Hereinafter, a method of compressing path data according to step (a) will be described.

First, referring to step (b), a straight line a passing through the node 21 of the starting point and the node 22 of the destination point of the path according to step (a) and the path having the farthest distance from it are b Node (c, 23) can be determined.

At this time, if the distance b is within the allowable error level (eg, 10 meters), the nodes located between the two nodes 21 and 22 are ignored, and the compression process is finished leaving only both nodes.

If the distance b is greater than the allowable error level, the path is divided based on the node 23 on the path and the compression process is performed recursively for each path.

For example, for a first path between the first starting node 21 and the first ending node 23 and a second path between the second starting node 23 and the second ending node 22, Recursively repeat the process of deriving the node located at the maximum distance among intermediate nodes and comparing the distance between the derived node and the tolerance level.

Therefore, referring to step (c), a path is divided based on the node 23 determined in step (b), a straight line passing through the determined node 23 and the node 22 of the destination point is determined, and a position between the node 23 is determined. It is possible to determine the farthest node 24 for all nodes on the path. At this time, the distance of the node 24 and the tolerance level are compared.

The above method is repeatedly performed, and as in step (e), there is no more node between the node 25 determined in step (d) and the node 22 of the destination point, or even if there is, the distance to the intermediate node is If it is within the tolerance level (for example, 10 meters), the compression process is terminated leaving only both nodes 25 and 22 .

The route data may omit the nodes 28 in the intermediate process through the above process, the node 21 of the starting point, the node 22 of the destination point, and the nodes 23, 24, 25 determined as the intermediate point and these It can be reconfigured as a connecting link.

That is, the path data collected in the same state as in step (a) may be generated as compressed data as in (e) through the simplified process of the path.

Also, the compressed data may have a different path length from the original path data by omitting some nodes.

In this case, the difference between the path length of the path data and the compression path length of the compressed data may be defined as a compression ratio.

The higher the compression ratio, the simpler the path, while the number of omitted nodes increases, so the accuracy of prediction using data may decrease. Therefore, the compression ratio can be determined according to the purpose of data utilization, and the number of omitted nodes can be reduced or increased according to the compression ratio.

Next, the service server 1000 may divide and store the compressed data.

Specifically, each node constituting compressed data may be clustered based on a unit area, and indexed for each unit data unit area and stored.

Compressed data is configured in a state where some nodes are omitted for the original path data. In this embodiment, a plurality of compressed data is not stored for each path, but is reconfigured into nodes located within the region based on the unit region. can be saved.

In this case, the unit area may have the same size and may be determined as a shape that most efficiently divides the earth's surface.

For example, the unit area may have a hexagonal shape, and the ground surface may be divided into continuous hexagonal unit areas.

Specifically, referring to FIG. 3 , a plurality of compressed data may be located on a unit area. In this case, two nodes located in the unit area A are indexed into the unit area A and may be stored in one unit data.

The unit data has information on nodes located in the unit area, and in addition, direction and size information on the next path of the nodes may be stored as vector information.

Accordingly, compressed data of a path starting from the A unit area and traveling to the B unit area may be divided and stored into unit data for each unit area corresponding to the location of a node in the middle.

That is, the compressed data may be divided for each unit area according to the location information of the node, and the unit data may store and manage information of all nodes included in the unit area corresponding to each.

Hereinafter, a service providing method of the service server 1000 according to the present embodiment will be described with reference to FIG. 4 .

4 is a flowchart of a service providing method according to an embodiment of the present invention.

First, the service server 1000 may receive the search path and search the stored unit data through it (S100).

The search path is information defining a section for generating additional information by using stored unit data, and may include source and destination information.

For example, in order to obtain traffic volume information for commute time between Seoul and Pangyo, a search route may be received with a starting point in Hannam-dong, Yongsan-gu, Seoul as a search route and a destination point in Pangyo-dong, Bundang-gu, Seongnam-si, as a search route.

That is, the search path is used as a search condition for searching the unit data, and the service server 1000 may search unit data corresponding to the starting point among the search paths as the first candidate data (S100).

In the present embodiment, a point may have a coordinate value or be mapped to a node on the route data or compressed data as main location (city, county, etc.) information on an administrative district in a map that is a reference for route search.

The service server 1000 extracts the unit data of the unit area including the starting point on the search path as the first candidate data (S100).

As described above, since the unit data stores all nodes existing with respect to the corresponding unit area and movement directions on paths for each node as vector information, the second candidate data is calculated in consideration of the directions of all nodes in the first candidate data. Extract (S200).

The second candidate data may be sequentially searched along a path on the compressed data of unit data determined to proceed in the direction of the destination point using vector information of one node in the first candidate data.

For example, the second candidate data may be extracted by determining whether it is directed to a destination point on a search path in consideration of movement directions and sizes of all nodes in the first candidate data.

Specifically, it may be determined whether the direction in the vector information is opposite to the destination point or is within a predetermined angle range from the destination direction.

For example, when a search path from Seoul to Pangyo is received, the next movement direction of a specific node in the first candidate data is to the northwest, for example, Ilsan. can be excluded from extraction.

Specifically, unit data corresponding to the next node on the path of the compressed data determined to be directed to the destination point in consideration of the movement direction and size of each node may be extracted as the second candidate data (S200).

Next, when the second candidate data is extracted, it may be determined whether the unit area of the second candidate data includes the target point of the search path (S300).

For example, when Pangyo-dong is included in the unit area of the second candidate data, the service server 1000 may end the search.

If not included, the second candidate data extracted in the current search step is used as a new reference, and vector information of all nodes in the unit region of the second candidate data is used to determine whether the target is directed to the target point, and a new second candidate is determined. Data can be extracted (S250).

That is, the above process may be repeated until the unit area of the second candidate data includes the target point. It is checked whether the target point is included in the data area of the second candidate data, and when the extracted unit area of the second candidate data includes the target point, the search is terminated.

According to the above method, since the search is performed based on the unit data, the overall direction is similar to the route data having a route that matches the search route, and various route data traveled including the search route can be searched. efficiency can be increased.

When the search is finished, target data constituting the search path is extracted (S400).

Specifically, the target data may be configured as a sequential unit data list corresponding to the search path.

For example, the unit data includes the number of nodes included in each area, and the amount of traffic present in the search path may be calculated using the unit data list.

In addition, as an additional condition, it is also possible to calculate the amount of traffic of vehicles traveling on a search route using a unit data list corresponding to a specific time period using time information.

Accordingly, the service server 1000 may calculate information such as traffic volume and generate traffic information through statistical processing of target data extracted in response to a search route.

The generated travel information can be provided to users or various traffic-related infrastructures, and through this, real-time arrival time prediction and optimal routes are provided to users, or, in the case of traffic-related infrastructure, it can be utilized for infrastructure maintenance and repair.

Furthermore, in the present embodiment, since compressed data is divided and stored according to the size of the unit area, the amount of target data used to calculate the travel information may be determined according to the size of the unit area.

That is, the size of the unit area, which is a standard for generating unit data, may be determined according to the purpose of use.

For example, since the service server 1000 generates additional information such as travel information by utilizing unit data, the larger the size of the unit area, the smaller the number of unit data to be searched and the faster the information of a wider area can be extracted. have.

Conversely, if the size of the unit area decreases, the number of unit data to be searched increases, but more accurate information may be provided.

Referring to FIGS. 5A and 5B , even if the starting point and the destination point are the same in the same search path, the contents of the extracted target data may vary according to the size of the unit area.

FIG. 5A is the unit data for the unit area 60a having a relatively small size in FIG. 5B. According to the vector information 62a of the nodes, the target data calculated up to the unit data 64a corresponding to the target point is schematically shown. More unit data may be included.

Accordingly, unit data not included in FIG. 5B may be included in the target data, and more accurate travel information may be generated.

Conversely, in the case of FIG. 5B , the unit data for the unit area 60b having a relatively larger size than that of 5A is the target data up to the unit data 64b corresponding to the target point according to the vector information 62b corresponding to the search path. can be extracted. The number of data used for statistical analysis is reduced compared to 5a, and faster additional information can be calculated.

That is, the service server 1000 may index and store the compressed data on the basis of the unit area determined according to the resolution defining the size of the unit area.

In this case, it is also possible to level the resolution, store and manage the compressed data according to the level, and provide it according to the purpose.

For example, it is possible to determine the size of the unit area according to the scale on the map, and to generate travel information using unit data with a resolution optimized for the scale.

Furthermore, the resolution may be determined using geographic feature information. For example, in a densely populated city, the resolution is increased by reducing the size of the unit area because passage in various directions is possible. It is also possible to decide

Accordingly, the compressed data may be divided and indexed into a unit area having a size determined according to the purpose and stored as unit data.

In addition, in some cases, it is possible to divide and store compressed data into unit areas of a leveled size according to the accumulation on the map, and to selectively search for unit data of an appropriate level according to the purpose of use.

Hereinafter, the configuration of the service server 1000 according to the present embodiment will be described with reference to FIG. 6 .

In this embodiment, the service server 1000 includes a path data collection unit 1100 , a compressed data generation unit 1200 , a unit data index unit 1300 , a search path reception unit 1400 , a target data extraction unit 1500 , and It may include a travel information generator 1600 .

The route data collection unit 1100 collects route data. The route data is information including a driving record collected through a user or infrastructure, and may include information such as a driving time and a driving route.

The collected route data may be composed of information on all points located while moving by the user, or may consist of nodes corresponding to major specific points and links connecting nodes and nodes.

The compressed data generating unit 1200 generates compressed data obtained by compressing the collected path data.

Even if the route data is composed of nodes and links, the size of the data may be huge, and in the case of a node, it may only have a location coordinate value and may not correspond to a name on an administrative area used for an actual route search.

Accordingly, in order to more efficiently store the path data, the compressed data generator 1200 simplifies the path within the path data.

Next, the unit data indexing unit 1300 indexes and stores the compressed data according to the unit area.

Since the unit area divides the ground surface into areas of the same size and shape, nodes in the compressed data may each correspond to the unit area.

Specifically, the unit data indexing unit 1300 may store and manage coordinate information of each node of the compressed data corresponding to the unit area and movement information on the next node on the compressed data path as vector information.

Therefore, the path to be searched is searched for unit data, and the search can be more efficient.

The search route receiving unit 1400 receives a search route including information on a starting point and a destination point of a route to be searched.

For example, a search route for calculating the amount of traffic between the starting point and the destination point may be received.

The target data extraction unit 1500 searches for first candidate data corresponding to a starting point on a search path among unit data. Then, it is determined whether the target point is directed based on all nodes in the unit area corresponding to the searched first candidate data.

Specifically, unit data corresponding to the next node in the compressed data path of the node having vector information within a predetermined range in the direction of the destination point according to the vector information is extracted as the second candidate data.

At this time, the target data extraction unit 1500 checks whether the extracted second candidate data includes the target point, and repeatedly extracts new second candidate data based on a point in the second candidate data according to the check result. .

Through the above process, if the unit area corresponding to the second candidate data includes the target point, target data constituting the search path is extracted. The target data may be composed of a plurality of unit data related to the search path.

Accordingly, the service server 1000 may provide target data to generate various additional information using the target data.

In addition, it is also possible for the travel information generating unit 1600 to directly calculate and provide the travel information of the search route by using the target data.

According to the present invention as described above, since the path data is compressed to a usable level and the compressed data is divided and stored, the amount of stored data can be reduced and data retrieval efficiency can be increased.

In addition, since compressed data is classified and stored using absolute locations, it can be used as permanent information regardless of changes in administrative districts.

In addition, since each of the divided data has direction and destination information according to the compressed path, it can be utilized to correspond to a wider range of search paths.

On the other hand, in the specification and claims, terms such as "first", "second", "third" and "fourth" are used to distinguish between similar elements, if any, and this is not necessarily the case. Used to describe a specific sequence or sequence of occurrences. It will be understood that the terms so used are interchangeable under appropriate circumstances to enable the embodiments of the invention described herein to operate, for example, in sequences other than those shown or described herein. Likewise, where methods are described herein as comprising a series of steps, the order of those steps presented herein is not necessarily the order in which those steps may be executed, and any described steps may be omitted and/or Any other steps not described may be added to the method.

Above, various embodiments described herein may be implemented in a computer or similar device-readable recording medium using, for example, software, hardware, or a combination thereof.

According to the hardware implementation, the embodiments described herein are ASICs (application specific integrated circuits), DSPs (digital signal processors), DSPDs (digital signal processing devices), PLDs (programmable logic devices), FPGAs (field programmable gate arrays, It may be implemented using at least one of processors, controllers, micro-controllers, microprocessors, and other electrical units for performing functions. The described embodiments may be implemented in the control module itself.

According to the software implementation, embodiments such as the procedures and functions described in this specification may be implemented as separate software modules. Each of the software modules may perform one or more functions and operations described herein. The software code may be implemented as a software application written in a suitable programming language. The software code may be stored in the memory module and executed by the control module.

The above description is merely illustrative of the technical idea of the present invention, and those of ordinary skill in the art to which the present invention pertains may make various modifications, changes and substitutions within the scope without departing from the essential characteristics of the present invention. will be.

Accordingly, the embodiments disclosed in the present invention and the accompanying drawings are intended to explain, not to limit the technical spirit of the present invention, and the scope of the technical spirit of the present invention is not limited by these embodiments and the accompanying drawings. . The protection scope of the present invention should be construed by the following claims, and all technical ideas within the scope equivalent thereto should be construed as being included in the scope of the present invention.

Claims (18)

location-based path database management server,
searching for first candidate data corresponding to a starting point on a search path from among unit data storing path data according to a unit area;
extracting second candidate data toward a target point on the search path within a predetermined range based on one node constituting the path within the searched first candidate data; and
and extracting target data constituting the search path by checking whether the extracted second candidate data includes the target point,
The path data is compressed and generated by omitting some nodes according to the relative positional relationship of a plurality of nodes constituting the path data, and is indexed based on a unit area having a size determined according to a resolution defining the size of the unit area. Location-based path database management method, characterized in that stored as. The method of claim 1,
Location-based path database management method, characterized in that iteratively extracts new second candidate data based on one node in the second candidate data according to the confirmation result. delete The method of claim 1,
The location-based route database management method, wherein the unit data includes location information of a node on the route data included in the corresponding unit area and information on a movement direction on a route from the node. The method of claim 1,
The path data is compressed data generated by omitting some nodes according to the relative positional relationship of a plurality of nodes constituting the path data,
The compressed data is compressed according to a compression ratio defined as a difference between the path length of the path data and the compressed path length of the compressed data. delete The method of claim 1,
The unit area is a location-based route database management method, characterized in that the map data including location information corresponding to the route is successively divided into the same shape and size. The method of claim 1,
The target data is composed of a plurality of unit data related to the search path,
The location-based route database management method, characterized in that calculating the travel information of the search route by using the target data. a route data collection unit for collecting route data;
a unit data indexing unit indexing and storing the path data according to a unit area;
a search route receiver configured to receive a search route including information on a starting point and a destination point of a route to be searched; and
The first candidate data corresponding to the starting point on the search path is searched among the unit data, and the first candidate data is directed toward the destination point on the search path within a predetermined range based on one node constituting the path in the searched first candidate data. 2 by extracting the candidate data, comprising a target data extraction unit for extracting the target data constituting the search path,
The path data is compressed and generated by omitting some nodes according to the relative positional relationship of a plurality of nodes constituting the path data, and is indexed based on a unit area having a size determined according to a resolution defining the size of the unit area. Location-based path database management server, characterized in that stored as. 10. The method of claim 9,
A location-based path, characterized in that it is confirmed whether the extracted second candidate data includes the destination point, and the new second candidate data is repeatedly extracted based on a node in the second candidate data according to the check result database management server. delete 10. The method of claim 9,
The location-based route database management server, wherein the unit data index unit stores location information of a node on the route data included in the unit area and information on a movement direction on a route from the node as unit data. delete 10. The method of claim 9,
The target data is composed of a plurality of unit data related to the search path,
Location-based route database management server, characterized in that it further comprises a travel information generator for calculating the travel information of the search route by using the target data. location-based path database management server,
collecting route data;
generating compressed data for generating compressed data in which a path is simplified by omitting some nodes according to a relative positional relationship of a plurality of nodes constituting the collected path data; and
Storing, as unit data, location information of a node and movement direction information on a path from the node in the compressed data included in the unit area based on the unit area,
The path data is compressed and generated by omitting some nodes according to the relative positional relationship of a plurality of nodes constituting the path data, and is indexed based on a unit area having a size determined according to a resolution defining the size of the unit area. Location-based path database management method, characterized in that stored as. a route data collection unit for collecting route data;
a compressed data generation unit generating compressed data in which a path is simplified by omitting some nodes according to a relative positional relationship of a plurality of nodes constituting the collected path data; and
A data indexing unit for storing position information of a node on the compressed data included in the unit region based on the unit region and information on a movement direction on a path from the node as unit data,
The path data is compressed and generated by omitting some nodes according to the relative positional relationship of a plurality of nodes constituting the path data, and is indexed based on a unit area having a size determined according to a resolution defining the size of the unit area. Location-based path database management server, characterized in that stored as. A computer-readable recording medium storing a program for performing the location-based route database management method according to any one of claims 1 to 2, 4 to 5, 7 to 8, and 15 . A program stored in a computer-readable recording medium for performing the location-based route database management method according to any one of claims 1 to 2, 4 to 5, 7 to 8, and 15. .

Images