JP3470993B2 - Data processing system - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data processing system, and more specifically, it utilizes map data or character information data in a specific format to search for a route such as a shortest distance or a shortest time, or a character. The present invention relates to a data processing system using software for performing optimum display processing of.

[0002]

2. Description of the Related Art Formats of map data and the like used in in-vehicle navigation systems and the like have been standardized in consideration of convenience of software creators. But,
Although the data format is specified, its contents are not specified. Therefore, the map data creation company is free to decide which road should be adopted for which hierarchy and what kind of road network should be constructed in the map for route calculation that automatically obtains the route from the origin to the destination. it can. For this reason, the data content varies greatly depending on the data creation company.

Here, as a conventional general route calculation method using these map data, for example, "Japanese Unexamined Patent Publication No. Hei 2
There is an invention described in "-56591" publication. The invention described in this publication uses a method of using map data divided into a plurality of layers, and using a map of a plurality of layers as the distance between two points for route calculation is longer. Is going. The route calculation method described in this publication will be described below with reference to FIG.

FIG. 12 is a diagram showing conventional general map data having two hierarchies. In FIG. 12, layer 1
Reference numeral 201 denotes a map hierarchy connecting main points (for example, intersections) 1 to 8 on a main road such as a national road (hereinafter, referred to as an upper hierarchy 1201).
The layer 1202 is a layer of a map in which all points 1 to 12 are connected on all other roads including the national road (hereinafter referred to as the lower layer 1202). The same numbers in the upper layer 1201 and the lower layer 1202 indicate the same points.

For example, a case of obtaining a route from points 9 to 12 will be described. When the route calculation range in one layer is set narrow (for example, 2 points),
First, in the lower layer 1202, 9 →
Widen from 1, 9 to 2, and at the destination side, 12 → 5, 12 → 8
And spread. Point 1 or 2 and point 5 or 8
And the route is calculated by the upper layer 1201 between 9 and 2 → 4
→ 5 → 12 is obtained as the shortest route. On the other hand, the route calculation range in one layer is wide (for example,
When 12 points are set), the route is obtained only in the lower layer 1202, and 9 → 1 → 10 → 3 → 5 → 12 is obtained as the shortest route. In this case, the latter is the shortest route, but it takes a lot of calculation time because many points on the dense road network have to be searched and calculated. The former is a slightly detour route, but the calculation time is short because the route calculation range is narrowed and the calculation is done in small portions. The route calculation range in this one layer is
It is determined by a constant set by a company that develops software that uses the map data (for example, a map data package medium such as a CD).

As described above, the structure of map data can be freely set by each map data creation company, and the software constants for processing map data can be freely set by each software development company. Therefore, depending on how this constant is set, it may happen that appropriate processing can be performed on certain map data, but appropriate processing cannot be performed on other certain map data.
For this reason, each software development company can obtain all the map data distributed in the market and calculate a reasonable route to some extent by using any map data (it is difficult to calculate a detour route). , It was adjusted to a constant that is a route calculation range with a margin.

On the other hand, in-vehicle navigation systems, etc.
Not only the above map data, but also textual information data regarding tourist information can be used. The data composition of this character information can be freely decided by the data creation company regardless of the display screen size of the vehicle-mounted navigation system or the like which is the recipient of the information. Therefore, when these character information is received as a character database, the information is
A list of characters is displayed in the display screen size (Fig. 6 (a)).
See).

[0008]

However, as described above, in the route calculation software, the software development company provides a route calculation range with a margin so that the route does not easily become a detour in any map data. Adjust the "constant". For this reason, there is a problem that it is difficult for the user to obtain a high-speed route calculation function (that is, extra calculation time is required) with the map data in the standard format distributed in the market. Especially when the user uses the map data that appears on the market after commercializing the route calculation software, the detours are calculated in the route calculation because the constants corresponding to the map data have not been adjusted. There is a problem that it may end up.

[0009] In addition, character data such as tourist information is converted into C
When the package information such as D is obtained and displayed on the screen, the character information must be displayed in the character display area of the system used. However, as mentioned above,
Since the data structure of the character information is entrusted to the data creation company, the character information data does not always match the system. For this reason, the system uses a method of changing the display screen size or using a table format in order to display the characters in a more legible manner. However, this method cannot be said to be an efficient improvement of the legibility because the imbalance between an item with conspicuous blank spaces and an item with many characters and a line break appears remarkably. Therefore, to prepare for the diversification of system display screens, in order to support any screen display size, it is not created as character information data that matches a specific screen, but a "character database that does not depend on the settings on the system side. It is necessary to provide text information as ". However, in the case of being supplied as a database in this way, it was not easy to display characters easily.

Therefore, the object of the present invention does not depend on the data structure of any map data, can always perform the optimum route search calculation, and also depends on the data structure of any character information data. First, it is to provide a data processing system using software capable of always performing optimum character display.

[0011]

[Means for Solving the Problems and Effects of the Invention A first invention is a data processing system for processing data, comprising: input means for inputting map data for route computation, pre
Prepared in advance for one or more specified routes
Map data is used by selectively using a plurality of provisional constants
The calculated route is used and the value obtained from the route calculation
Evaluation by comparing or calculating with a predetermined reference value
And evaluation means asking you to valence result, based on the evaluation result by the evaluation means, and a constant deriving means for deriving the optimum final constant process of the map data from a plurality of provisional constants, the route calculation based on the final constant And processing means for performing the processing.

As described above, the first invention is for route calculation.
The processing of the data is performed using a constant derived based on the evaluation result obtained by evaluating the map data.
In other words, the evaluation means uses a plurality of routes in a predetermined route.
The route is calculated using a temporary constant and the evaluation result is obtained.
Then, the constant derivation means uses a map based on the evaluation result.
Ideal for processing data (detour calculation in the above path
The final constant is derived because it does not result and is fast in processing.
It By performing automatic evaluation in this way, which map data
Even if you use the map data to the maximum, route quality
Routes with high
It is possible to take out.

[0013] The second aspect based on the first aspect, the map <br/> data, is accompanied unique identification code, stores the final constant as a set together with the identification code you accompanying map data You
Further comprising a storage means , the processing means inputs to the input means
Been if the identification code associated with the map data stored in the storage unit, performs a route calculation using the final constants stored as a set together with those identification code, input <br/> force to the input means When the identification code associated with the generated map data is not stored in the storage means, the evaluation means and the constant derivation means use the same.
It is characterized in that the route is calculated using the final constant obtained by the above.

As described above, the second aspect of the present invention further comprises storage means for storing the optimum constant together with the identification code unique to the data as a set. As a result, when the input data has the same identification code as the identification code that has already been stored after performing automatic evaluation in the past, the optimum constant stored as a set together with the identification code Can be used to process the data. Therefore, once the automatic evaluation is performed, it is possible to perform optimum data processing and shorten the processing time from the next time.

A third invention is characterized in that the input means in the first and second inventions reads and inputs map data from a package medium.

A fourth invention is characterized in that the input means in the first and second inventions receives and inputs map data by communication.

As described above, the third and fourth inventions are as follows.
The input means in the first or second aspect of the invention is an input means capable of handling package media such as a CD and data transmitted by communication. The effects of the third and fourth inventions are the same as the effects of the first or second invention.

[0018]

[0019]

[0020]

[0021]

[0022]

[0023]

[0024]

[0025]

[0026]

A ninth aspect of the present invention is a data processing system for performing route calculation using map data accompanied by a unique identification code, which uses input means for inputting map data and the input map data. Then, route calculation is performed by selectively using a plurality of provisional constants prepared in advance for one or more predetermined routes, and the value obtained from the route calculation is compared with a predetermined reference value. Or, an evaluation means for obtaining an evaluation result by calculation, a constant derivation means for deriving a final constant optimum for processing map data from a plurality of provisional constants based on the evaluation result, and a final constant attached to the map data. Storage means for storing as a set together with the identification code
The evaluation means and the constant derivation means perform the evaluation operation and the final constant derivation operation on condition that the identification code associated with the map data is not stored in the storage means. If the identification code associated with the map data is stored in the storage means, the processing means performs route calculation using the final constants already stored as a set together with the identification code, and the processing means associates with the map data. If the identification code is not stored in the storage means, the route calculation is performed using the final constant newly derived by the constant deriving means.

As described above, in the ninth aspect of the invention, the evaluation means calculates the route of the map data input to the input means by using a plurality of provisional constants in a predetermined route, and obtains the evaluation result of the map data. Ask. Then, the constant derivation means derives a final constant most suitable for the processing of the map data (the processing is fast because it does not become a detour calculation result in the above route) based on the evaluation result. This final constant is stored as a set together with an identification code unique to the map data.
Accordingly, in the ninth aspect , when the identification code associated with the input map data is stored in the storage means, the route is calculated by using the final constant already stored as a set together with the identification code. The calculation is performed, and if it is not stored, the route calculation is performed using the final constant newly derived by the constant deriving means. That is,
The ninth invention uses the past evaluation results to use the most appropriate constant for the map data input again,
It is possible to perform high-speed and high-quality route calculation.

[0029]

[0030]

[0031]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings. (First Embodiment) FIG. 1 is a block diagram showing the arrangement of a data processing system according to the first embodiment of the present invention. In FIG. 1, the data processing system according to the first exemplary embodiment of the present invention includes an input unit 101 and an evaluation unit 102.
A constant derivation means 103, a storage means 104, and a processing means 105. The first embodiment realizes a data processing system based on the configuration shown in FIG. 1, which always enables optimum route calculation for all map data for route calculation.

Map data created in a standard format and having a unique identification code (hereinafter referred to as an ID) is input to the input means 101 from a package medium such as a CD. The input unit 101 detects the ID of the input map data and determines whether the ID is the ID of the data processing system to determine whether the map data has been used before. to decide. When the evaluation unit 102 determines that the map data input to the input unit 101 is new, the evaluation unit 102 performs automatic evaluation by the method described below. The constant derivation means 103 derives an optimum constant for route calculation based on the result of the automatic evaluation by the evaluation means 102. When the input map data is new, the storage unit 104 stores the constant derived by the constant deriving unit 103 together with the ID unique to the map data as a set, and outputs it to the processing unit 105. . on the other hand,
When the storage unit 104 determines that the map data has been used before, the storage unit 104 outputs the constant previously stored as a set together with the ID to the processing unit 105.
The processing unit 105 performs a route calculation process using the constant given from the storage unit 104.

FIG. 2 is a diagram showing a flowchart of processing executed by the data processing system according to the first embodiment of the present invention. Hereinafter, the processing contents of the system will be described in more detail with reference to FIG. The system starts data processing by inserting the package medium into the input unit 101. When data processing is started, it is first determined whether or not there is a route search processing request from the user (step S201). On the other hand, if there is a processing request from the user, it is determined whether the ID unique to the package medium is stored in the storage unit 104 of the system without performing the automatic evaluation (step S20).
2). Here, when the ID is stored in the storage unit 104, the constant stored as a set together with the ID is set as a constant for route search (step S20).
5). On the other hand, when the ID is not stored in the storage unit 104 (for example, when the package medium used for the first time is inserted), the storage unit 104 does not store the ID unique to the package medium. Therefore, in this case, the constant is set to the initial value for the time being, that is, the safe side value (a value that increases the search time although a detour route is rarely calculated) (step S203). The processing unit 105 processes the map data of the package medium according to the set constant (step S204). After that, step S201
Return to the processing judgment of.

On the other hand, if there is no request for the route search processing from the user (including the case where there is a request but then there is no request), the process proceeds to step S206 (step S2).
01). In this case, in step S206, it is determined whether or not the ID unique to the package medium is stored in the storage unit 104 of the system. If it is stored, the process returns to step S201 without doing anything. If not stored, the system automatically evaluates the map data existing in the package medium and determines a constant for route search (step S207). Then, the constant obtained by this automatic evaluation is paired with the ID unique to the package medium and stored in the storage means 104 (step S20).
8). The stored constant is used again in the next processing request for the package medium (step S205). Even if the automatic data evaluation process is in progress (step S207), if a user's processing request occurs, the process may return to step S201 to perform the process requested by the user.

By the above processing, the data processing system according to the first embodiment automatically evaluates the map data of the package medium by utilizing the time when there is no processing request from the user and there is a margin in system processing. Then, the constants obtained by this automatic evaluation are stored as a set together with the ID unique to the package medium as a constant dedicated to the package medium. As a result, when a route search is performed using the package medium next time, the stored route-specific constant for the package medium can be used to perform the route calculation process quickly and efficiently. Note that when a package medium having a new ID is loaded, and at the same time when there is a processing request from the user at the same time when it is loaded, processing may initially be performed with a constant safe side value, as described above. . However, after that, when there is no more processing request, the automatic evaluation process is automatically performed and the constant is obtained, so that when the route search process is requested again or the same ID
When the package media having the above is re-introduced, it is possible to meet the user's request with a high-speed and efficient constant.

In the above description, the package medium is described as having one constant, but when a plurality of types of data are stored in one package medium, the plurality of types of data are stored. It is also possible to provide a constant for each. Further, in the storage means 104, constants obtained by automatic evaluation are stored in combination with an ID,
It has been explained that the constant is taken out when there is a processing request. However, the evaluation result in the automatic evaluation before obtaining the constant may be stored as a pair with the ID, and when there is a processing request, the evaluation result may be extracted to obtain the constant. Further, the data processing system according to the first embodiment has been described as performing the evaluation automatically by utilizing the system processing time that is not requested by the user and has a margin in the system processing. ), The evaluation may be performed.

The above is the processing flow of the data processing system according to the first embodiment of the present invention. The content of the automatic evaluation process used in the description will be described below with reference to FIG. FIG. 3 is a flowchart showing the flow of automatic evaluation processing.

First, as a premise for performing this automatic evaluation, the evaluation means 102 sets in advance several paths for performing automatic evaluation (hereinafter referred to as evaluation paths). In addition, the evaluation means 102 sets the evaluation standard of the evaluation value for each evaluation route. Here, the evaluation value refers to the total length of the route, the total travel time of the route, and the like. Further, the evaluation means 102 sets some constants for the route search processing when performing the automatic evaluation calculation. This constant is a number representing the range for route search, for example, the upper limit of the number of intersections for route search in one layer, or a number indicating the number of upper layers when moving the layer for route search to a higher level (usually Since the layers are raised one by one, the number for distinguishing how many layers to skip and move can be considered.

When the automatic evaluation process starts, the first evaluation (that is, route search calculation) starts. In performing the first evaluation, first, "1" is input to the variable N indicating the number of the evaluation to initialize it (step S30).
1). Based on this variable N, a "constant" for evaluation is selected (step S302). Next, "1" indicating the first evaluation route is input to the variable C indicating the evaluation route for which the route search calculation is performed (step S303). Based on this variable C, the "departure point" and the "destination" for which the route search calculation is to be performed are selected (step S304). After setting these variables, the route search calculation of the evaluation route is performed (step S305).

After the route search calculation of the first evaluation route is completed, it is determined whether or not the evaluation value obtained from the route search calculation satisfies the reference evaluation value (step S).
306). Here, when the evaluation value satisfies the reference evaluation value, “1” is further added to the variable C (step S30
7) The procedure returns to step S304, and the process proceeds to the route search calculation of the next second evaluation route. Such processing is repeated several times, all route search calculations of the preset evaluation route are performed (step S309), and when all of these evaluation values satisfy the respective reference evaluation values, It is determined that the constants used for automatic evaluation are suitable for map data processing of the package media. Then, the constant at this time is determined as a constant dedicated to the map data of the package medium (step S310). On the other hand, when there is an evaluation route whose evaluation value does not satisfy the reference evaluation value, it is determined that the constant used in the current automatic evaluation is not suitable for the map data processing of the package media. In this case, the evaluation with the current constant is ended, and “1” is further added to the variable N in order to perform the second evaluation using the next constant (step S308), and the process returns to step S302. Then, the evaluation is started again from the first evaluation path using the new constant.

A more specific description will be given below with reference to FIG. FIG. 4 is a table showing an example of processing contents of the automatic evaluation performed in the data processing system so that the contents can be visually easily understood.

In FIG. 4, the above-mentioned preset evaluation route means that "departure place" of course number "1" is "Tokyo", "destination" is "Osaka", and the like. In FIG. 4, 12 courses are set for automatic evaluation. Further, in FIG. 4, the reference evaluation value for the evaluation route is set in the form of “reference distance”. For example, the reference evaluation value for the evaluation route of course number “1” is 550 km. It is set for each evaluation route.
Then, in FIG. 4, two constants are set as constants for automatic evaluation calculation. "Constant 1" is a constant that indicates how many levels of map data to skip. "Constant 2"
Is a constant that indicates how many intersections the route search range should be. As described above, the constant may be set as a combination of a plurality of numbers or may be one. In FIG.
The combination of "constant 1" and "constant 2" is set so that a maximum of 6 evaluations can be performed. It should be noted that the arrangement of this combination is preferably set so that the route search range is widened as the number of automatic evaluations increases. Further, in this combination, it is necessary to include a combination in which the detour route is hard to be calculated later.

In performing the first evaluation, first, "1" is input to the variable N indicating the number of the evaluation (step S301). Based on this variable N = 1, “variable 1” = 1 and “variable 2” = 50 for the first evaluation.
0 is selected (step S302). Next, "1" is input to the variable C indicating the evaluation route (step S30).
3). Based on this variable C = 1, “departure point” = Tokyo and “destination” = Osaka of the evaluation route are selected (step S304).

After selecting the constant and the evaluation route, the route search calculation of the evaluation route is performed (step S30).
5). The route search calculation performed here is a method as shown in FIG. FIG. 5 is a diagram showing the data structure of certain map data. In the map data of FIG. 5, there are layers 1 to N. In each of the layers 501 to 50N, the lower layer 501 is the layer with the highest map data (comprised of data about all roads), and the higher the layer, the sparser the map data is. Limited roads,
(For example, it consists of data only for information such as national roads)
Are arranged side by side to form a hierarchy. Tier 501
Is a hierarchy serving as a reference for starting the search. In the route search calculation, first, in the hierarchy 501, the ranges 501a and 501b with the number of intersections being “constant 2” = 500 are searched around the departure point A and the destination B, respectively. As a result of the search in this hierarchy 501, both ranges 501a and 501b
In the case where there is no connection (no overlap), in general, the search target is one higher hierarchy 502 through the intersection common to the layers 501 and 502 (hereinafter referred to as a common intersection).
Similarly, the range of 502a, 50 with the number of intersections of "500" centered on the common intersection on the side of the starting point A and the side of the destination B similarly.
2b is searched. However, since it takes a long time to carry out the route search calculation by moving for each layer in this way, in the route search processing, the "constant 1" is used so that the layer can be skipped at once. . That is, as a result of the search in the layer 501, when the two ranges 501a and 501b are not connected, since "constant 1" = 1 in FIG. 4, the layer to be searched next is the layer 503 instead of the layer 502. . Here again, the range 503a with the number of intersections of “500” is centered on the common intersection between the floors 501 and 503,
Search for 503b. When the search ranges are first connected to each other by following such a procedure, the distance of the route is calculated. In the example shown in FIG. 4, a value of 540 km is obtained.

When the value of 540 km is obtained, it is next determined whether the obtained value is larger or smaller than the reference evaluation value (step S306). In this determination, that is, it is determined whether or not the circuitous route has been calculated by comparison with the reference evaluation value. In the example shown in FIG. 4, the reference evaluation value is 550 km, whereas the calculated distance is 540 km, so the evaluation is judged as “◯”.
Becomes This completes the evaluation for the course number "1". Then, next, by adding "1" to the variable C to set the variable C = 2, the process proceeds to the evaluation of the route between Tokyo and Nagoya of the course number "2".

By repeating such processing, in the example of FIG. 4, the evaluation value does not satisfy the reference evaluation value for the first time in the evaluation between Osaka and Sendai of the course number '6'.
In this case, the route search calculation means that a detour route is calculated, and the evaluation judgment is “x”. That is, the constants (“constant 1” = 1, “constant 2” = 500) used in the current route search calculation are not appropriate values in the route search calculation of this map data. Therefore, in this case, in order to recalculate with the next constant, the route search calculation with the constant is finished at this point (step S306). Then, "1" is further added to the variable N (step S30
8) As the variable N = 2, the second time "constant 1" = 1 and "constant 2" = 600 are reset (step S30).
2) Evaluate again from Tokyo-Osaka of course number '1'.

As described above, when the processing is advanced and the evaluation values satisfy the reference evaluation values in the evaluation of all the courses (numbers 1 to 12) (the fourth evaluation in FIG. 4), It is judged that the constant is suitable for the route search calculation of this map data. Then, the constant (“constant 1” =
0, "constant 2" = 500) is the ID unique to this map data
It is determined as a constant to be recorded together with (step S310).

As described above, the data processing system according to the first embodiment of the present invention compares the evaluation value obtained by the automatic evaluation with the preset reference evaluation value.
Then, the evaluation is performed so that the comparison result is equal to or less than the reference evaluation value assumed for each evaluation route, and is a constant that speeds up the route search calculation (narrows the route calculation range). As a result, it is possible to determine the optimum constant that enables the fastest route search calculation in the range where the detour route does not appear. Therefore, by storing the constant obtained by this automatic evaluation together with the ID unique to the package medium, a route search calculation can be performed using the constant while the same package medium is being loaded. Then, even if the package medium is replaced with another package medium, if the package medium has been used before or the package medium supplied from the same map data creation company, the stored ID is checked and the corresponding ID is checked. By using the constants stored as a pair, a high-speed route search calculation process can be obtained.

In the first embodiment, "distance" is used as the reference evaluation value, and the evaluation is judged by comparing with the calculated distance. Alternatively, the evaluation may be performed by comparing the calculated number with the intersection number sequence of the calculated route. Further, in step S306 of FIG. 3, when the evaluation of a certain course is “x”, the evaluation of the subsequent courses is not performed by this constant and the evaluation is performed by the next constant, but the evaluation of “x” is performed. However, all courses may be evaluated using the current constant. At this time, in the evaluation of all the courses of the first time, the courses with the evaluation of “x” are stored, and in the evaluations of the second and subsequent times, only the courses with the evaluation of “x” are stored. It is also possible to evaluate. Further, when the evaluation of a certain course becomes "x", the evaluation by the next constant is performed from the course number "1", but the evaluation by the next constant may be started from the course having the "x" evaluation. .

Further, in the data processing system according to the first embodiment of the present invention, the case where the map data is input to the input means 101 by the package medium has been described.
However, the data processing system is also possible when map data is supplied by communication or broadcasting. That is, this is the case where the map data for route search calculation is provided by communication or the like together with the ID unique to the map data. In this case, the data receiving side (terminal side) stores the received map data and the unique ID, and in the same procedure as in the case of being supplied by the package medium described above,
It is possible to find a constant. In the data processing system, the constant obtained by performing the automatic evaluation once is stored as a set together with the corresponding ID, and is continuously stored in the storage unit 104 (unless there is an instruction to delete). For this reason,
Even after deleting the map data itself from the terminal,
When the map data that has been automatically evaluated in the past is received again, the optimum route search calculation can be performed using the constants stored as a set together with the ID.

(Second Embodiment) Next, a second embodiment which can be realized by using the configuration of the data processing system according to the first embodiment of the present invention will be described. The block diagram of the configuration of the data processing system according to the second embodiment and the flowchart of the processing of the system are the same as those in FIGS. 1 and 2 in the first embodiment. Hereinafter, the same block or step will be denoted by the same reference numeral, and the description thereof will be omitted. Second
The embodiment is different from the first embodiment in that the evaluation means 1
02 is the processing method. While the evaluation means 102 in the first embodiment performs automatic evaluation to obtain a constant related to route search calculation of map data, the evaluation means 102 in the second embodiment obtains a constant related to a display format of character information. Perform automatic evaluation.

Character information can be obtained from package media, etc.
Data of arbitrary character information is supplied in a unit (hereinafter referred to as a character information set). FIG. 6 is a diagram showing an example of a display of the character information when the character information set related to the restaurant information is supplied. Here, when the character information set is supplied in the character database format that does not depend on the display screen size, if the supplied character information is displayed as it is, it will be displayed as shown in FIG. In this case, it is a list of characters and it is very difficult to see.
However, if these items are organized and arranged according to each item (business hours, telephone number, etc.), they are organized as shown in FIG.

Normally, the screen design for character display on the side of the data processing system assumes the number of characters of each item of the character information set to be input to some extent, and determines the number of characters in the width of each item so that the characters are most visible. decide. But,
In the case of the character database format, even if the data format that represents the delimiter for each item is standardized, the content of the character information set differs depending on the type of information, and although there is a tendency depending on the genre or information provider company, It cannot be decided in advance.

Therefore, in the second embodiment, the supplied character information set is automatically evaluated to derive a constant relating to the character display and further stored, so that the character information set having the same ID can be stored next time. When supplied, the stored constants are used for display, so that the character information can be displayed instantly and easily.

Hereinafter, referring to FIGS. 7, 8 and 9,
The processing content of the evaluation means 102 in the second exemplary embodiment will be described more specifically. It should be noted that I already stored
When the character information set having D is input, it is the same as in the case of the above-described first embodiment, so here, the automatic evaluation when the character information set having a new ID is input is described. I will explain.

FIG. 7 is a diagram showing an example of a flowchart of automatic evaluation of a character information set. In the flowchart shown in FIG. 7, the maximum number of characters for each item in the data is calculated for all character information data in the character information set. When the character information set is input to the input means 101, the process shown in FIG. 7 is started. First, "1" is input to the variable I indicating the number of the item to be processed to initialize it (step S701). The evaluation means 102 uses this variable I
Based on the above, only the number of characters of the item “1” of the character information set is checked, and the maximum number of characters is stored as Mx (1) (step S702). Next, "1" is added to the variable I to change the item to be processed to "2" (step S70).
3). This maximum number of characters is surveyed for all items. Then, when the survey is completed for all the items, the processing is finished (step S704).

FIG. 8 is a diagram showing an example of a flow chart for determining a constant for displaying characters. The flowchart shown in FIG. 8 shows a method of determining the display position of each item as an example of determining the constant. As a premise, each item indicates a display line position L (I) indicating which line on the screen the character is displayed, and in which column on the screen (the character position from the beginning of the line) the character is displayed. The display column position T (I) and the flag F (I) indicating whether or not the display position is determined are included. I and Mx
(I) is the above-mentioned variables and numerical values. Where F
When (I) = 0, the display position of the item “I” has not been determined, and when F (I) = 1, the display position of the item “I” has been determined. In addition, L (I) = 1 means that the character exists in the first row, and T (I) = 1 means that the character starts from the first column (first character). LP is a variable indicating a row pointer, and TP is a variable indicating a column pointer.

First, in order to determine the display position of the character of the item "1", "1" is input to the variable I and "1" is input to LP and TP (step S80).
1). Further, F (I) is set to "0" to initialize the flags of all items (step S801). Regarding the character of the item "1", since it is displayed in the first row and the first column without any problem, the value of LP is input to L (1) and the value of TP is input to T (1), and F (1) = The display position is determined as 1 (step S802). Furthermore, to move to the processing of the next item, TP
Is replaced with “TP + Mx (1) +1” (that is, a value indicating the column point after the maximum number of characters of item “1”) (step S802). Then, the value can be displayed within the value obtained by subtracting TP from the maximum number of screen display columns (maximum display character in one line) of the system, that is, within the number of characters remaining up to the end of the line after displaying the maximum number of characters of item "1". Whether or not a certain item “K” exists is checked from among the items whose display positions have not been determined (step S803). Here, if the corresponding item "K" exists, "K" is substituted for the variable I (steps S804 and S805), and the process of step S802 is performed to determine the display position of the item "K". Accordingly, after the item "1" is displayed on the first line, the item "K" can be continuously displayed. After the position of this item “K” is determined, the process of searching for another item that can be displayed within the remaining number of characters is repeated until it is possible. On the other hand, when the item “K” does not exist (is no longer present), the item to be processed next is displayed on the second line, so LP = LP + 1 (= 2) and TP = 3 are substituted ( Step S806). The column pointer of the second row is set to T
The reason for setting P = 3 is that a blank is provided at the head position in order to make the screen display easy to see. Then, an item for which the next processing is to be performed is searched for from among the items whose display positions have not been determined yet (step S807), and if there is one, the process returns to step S802 and the above processing is repeated (step S808). When the processing for all items is completed in this way, the processing is completed (step S808). In step S807, an item whose display position has not been determined is searched from all items. If there are a plurality of corresponding items, the item with the smallest item number or the one with the largest maximum number of characters is displayed. The item to be processed next may be determined.

FIG. 9 is a diagram showing an example of a flowchart for displaying characters on the screen. FIG. 9 shows a method of displaying characters using the constants determined by the processing in FIG. As a premise, the character data D
Indicates a number attached to one unit of character information data to be displayed. The data display row position DL indicates the data display row position of the character data D being processed. The data display row position RDL is a variable representing the top data display row position of the character data D. Note that, in general, since the information amount of the character information set is supplied in an amount that does not fit on the display screen at one time, it is usually necessary to perform processing such as information scrolling, but in the following description, mainly In order to explain how to use the constant, the character data is described as data that fits in one screen.

Before displaying characters, the current screen display is first initialized. Initialization is performed by inputting "0" to the data display row position DL and "1" to the character data D (step S901). Further, the data display column position RDL is set to D
L (because it is the first character data, the top data display line position is at the top of the screen), and '1' is input to the variable I to specify the item "1" to be displayed (step S902). ). After that, in order to display the character string of the item "1" in the character data "1" at the data display line position DL,
Data display row position DL = RDL + L (I) and T (I)
And is displayed based on (step S903). This process is performed for all items in the character data "1" (steps S904 and S905). Next, "1" is added to the character data D to set the character data number to "2" (step S906), and the same processing is performed. Since the data display line position DL of the first line of the character data “2” is the line next to the last line of the character data “1”, the last display line position DL of the previous data is set to the data display top line position in step S902. The processing is performed by substituting it into RDL and adding the data display top row position RDL in step S903. When these processes are performed for all character data, the display of all character data ends (step S907).

As described above, in the evaluation means 102,
The number of characters in each item of character data is counted and evaluated, and in consideration of the display screen size, the order in which items are arranged and constants indicating the line feed position are determined so that no line feed occurs in the middle of the item. Accordingly, it is possible to always display the character information in the form of the character information that matches the display screen size.

In the data processing system according to the second embodiment of the present invention, the character information set is input by the input means 101.
I explained about the case of inputting in package media. However, the data processing system is also possible when the character information set is supplied by communication or broadcasting. That is, this is a case where the character information set is provided by communication or the like together with an ID unique to the character information set. In this case, the information receiving side (terminal side) can store the received character information set and ID and obtain the constant in the same procedure as in the case of being supplied by the package medium described above. In the data processing system, the constant obtained by performing the automatic evaluation once is stored as a set together with the corresponding ID, and is continuously stored in the storage unit 104 (unless there is an instruction to delete). Therefore, even after the character information set itself is deleted from the terminal, when the character information set that has been automatically evaluated in the past is received again, the optimum screen is displayed by the constants stored as a set together with the ID. Can be displayed.

(Third Embodiment) FIG. 10 is a view showing the arrangement of a data processing system according to the third embodiment of the present invention. The data processing system according to the third exemplary embodiment of the present invention determines the constant in the first exemplary embodiment on the package media providing side (that is, the media creation company side).
This is different from the configuration of the first embodiment in that the reproducing means 1001 is further provided. Below, Figure 1
Constituent parts similar to those of the first embodiment shown in are attached with the same reference numerals, and the description thereof will be omitted.

In the data processing system according to the third embodiment of the present invention, the input means 101, the evaluation means 102, the constant derivation means 103 and the storage means 104 are configured on the package media providing side. The reproduction unit 1001 and the processing unit 105 are configured on the package medium acquisition side (that is, the device side that uses the package medium). When creating the package media, the package media provider side inputs the map data with the input means 101,
The evaluation means 102 automatically evaluates the data as described in the first embodiment. Then, the constant deriving unit 103 derives a constant based on the evaluation result, and the storage unit 104 stores the constant together with the map data in the package medium. The package media acquisition side is the reproduction means 100.
At 1, the map data and constants of the package media are reproduced. Then, the processing means 105 processes the map data based on this constant.

That is, in the case of the route search calculation, the package media providing side performs the steep road search calculation of the evaluation route for the combination of the starting point and the destination, and determines, for example, the range of the route search calculation in the lower hierarchy. A constant of the search range is calculated to determine whether a route that is not a circuitous route can be calculated by increasing the.
This constant is stored in the package medium together with the map data. On the package media acquisition side, a route search calculation is performed in response to a user's processing request using a constant stored in this package media. For this reason, it is possible to calculate an appropriate route that is not a circuitous route with a minimum execution time without performing automatic evaluation on the package media acquisition side.

Further, the data processing system according to the third embodiment of the present invention can also use the input map data as a character information set. In this case, as described in the second embodiment, the constant relating to the character display is stored in advance in the package medium on the package medium providing side. As a result, the package media acquisition side can easily obtain an easy-to-see character display screen without performing automatic evaluation by itself.

(Fourth Embodiment) FIG. 11 is a diagram showing the configuration of a data processing system according to the fourth embodiment of the present invention. The data processing system according to the fourth embodiment of the present invention provides the map data in the third embodiment,
It shows a configuration in the case of communication or broadcasting. The configuration of the fourth embodiment is different from the configuration of the third embodiment in that a transmitting unit 1101 and a receiving unit 1102 are further provided. Hereinafter, the same components as those in the third embodiment shown in FIG. 10 are designated by the same reference numerals, and the description thereof will be omitted.

In the data processing system according to the fourth embodiment of the present invention, the input means 101, the evaluation means 102, the constant derivation means 103, and the transmission means 1101 are configured on the base station side (transmitting information). The receiving means 1102, the storage means 104, and the processing means 105 (receive information)
It is configured on the terminal side. On the side of the base station, after inputting the map data by the input means 101, the evaluation means 102 automatically evaluates the map data as described in the first embodiment. Then, the constant derivation means 103 derives a constant based on the evaluation result, and the constant is sent together with the map data by the transmission means 110.
From 1 to any transmission method. On the terminal side, the receiving means 1102 receives the transmitted map data and the constant, and the storage means 1 sets the map data and the constant as a set.
Store in 04. Then, in response to the user's processing request, the processing unit 105 processes the map data based on the constants stored in the storage unit 104.

As described above, even when the map data is supplied by communication or broadcasting, the constant is derived in advance by the automatic evaluation, and the constant is transmitted together with the map data. Similar to the form, it is possible to calculate a valid route that is not a circuitous route with a minimum execution time without performing automatic evaluation on the terminal side.

Further, the data processing system according to the fourth embodiment of the present invention can use map data supplied by communication or broadcasting as a character information set.
In this case, as described in the second embodiment,
A constant relating to character display is determined in advance on the base station side, and is transmitted together with the character information set when transmitting. As a result, the terminal side can easily obtain an easy-to-see character display screen without performing automatic evaluation by itself.

[Brief description of drawings]

FIG. 1 is a diagram showing a configuration of a data processing system according to first and second embodiments of the present invention.

FIG. 2 is a diagram showing a flowchart of processing executed by the data processing system according to the first and second embodiments of the present invention.

FIG. 3 is a flowchart showing a flow of automatic evaluation processing in the evaluation means.

FIG. 4 is a table showing an example of processing contents of automatic evaluation in an evaluation means.

FIG. 5 is a diagram showing an arbitrary map data structure.

FIG. 6 is a diagram showing an example of display of the character information when a character information set related to restaurant information is supplied.

FIG. 7 is a diagram showing an example of a flowchart of automatic evaluation of a character information set.

FIG. 8 is a diagram showing an example of a flowchart for determining a constant for displaying characters.

FIG. 9 is a diagram showing an example of a flowchart for displaying characters on a screen.

FIG. 10 is a diagram showing a configuration of a data processing system according to a third embodiment of the present invention.

FIG. 11 is a diagram showing a configuration of a data processing system according to a fourth embodiment of the present invention.

FIG. 12 is a diagram showing conventional general map data having two layers.

[Explanation of symbols]

101 ... Input means 102 ... Evaluation means 103 ... Constant derivation means 104 ... Storage means 105 ... Processing means 501 to 50N, 1201, 1202 ... Hierarchy 501a-50Na, 501b-50Nb ... Search range 1001 ... Reproducing means 1101 ... Transmission means 1102 ... Receiving means

─────────────────────────────────────────────────── ─── Continuation of the front page (58) Fields surveyed (Int.Cl. ⁷ , DB name) G01C 21/00 G09B 29/00

Claims (5)

(57) [Claims] 1. A data processing system for processing data, comprising: input means for inputting map data for route calculation; and a plurality of provisional provisions prepared for one or more predetermined routes. Evaluating means for selectively using a constant, performing a route calculation using the map data, and obtaining an evaluation result by comparing or computing a value obtained from the route calculation with a predetermined reference value, Based on the evaluation result by the evaluation means, a constant deriving means for deriving a final constant optimum for the processing of the map data from the plurality of temporary constants, and a processing means for calculating a route based on the final constant. , Data processing system. 2. The map data is associated with a unique identification code, further comprising a storage means for storing the final constant together with the identification code associated with the map data as a set, the processing means, When the identification code associated with the map data input to the input means is stored in the storage means, route calculation is performed using the final constant stored as a set together with the identification code, When the identification code associated with the map data input to the input means is not stored in the storage means,
A route calculation is performed using the final constant obtained by the evaluation means and the constant derivation means,
The data processing system according to claim 1. 3. The data processing system according to claim 1, wherein the input unit reads the map data from a package medium and inputs the map data. 4. The data processing system according to claim 1, wherein the input unit receives and inputs the map data by communication. 5. A data processing system for performing route calculation using map data accompanied by a unique identification code, wherein the input means for inputting the map data and the input map data are used, Route calculation is performed by selectively using a plurality of provisional constants prepared in advance for one or more predetermined routes, and the value obtained from the route calculation is compared or calculated with a predetermined reference value. An evaluating means for obtaining an evaluation result by doing, a constant deriving means for deriving an optimum final constant for processing the map data from the plurality of temporary constants based on the evaluation result, and the final constant to the map Storage means for storing as a set together with the identification code associated with the data, and processing means for performing the route calculation using the final constant, the evaluation means and the constant derivation means, The evaluation operation and the final constant derivation operation are performed on condition that the identification code associated with the map data is not stored in the storage unit, and the processing unit stores the identification code associated with the map data. If stored in the means, the route calculation is performed by using the final constant already stored as a set together with the identification code, and the identification code accompanying the map data is not stored in the storage means. In this case, the data processing system is characterized in that the route calculation is performed using the final constant newly derived by the constant deriving means.