1460948128-b8d88c67-64bb-49c1-8f24-8dc58d4cbb95

What is claimed is:

1. A lane guidance display method for guiding, on a screen, a vehicle which lane to take to go through an intersection, said method comprising the steps of:
searching for a guidance route from a departure point to a destination or a stopover based on map data including lane data, which is regarding the number of lanes and lane control of roads to be connected to the intersection;
specifying an intersection for guidance (hereinafter, refers to as a target intersection) located on said guidance route;
determining, based on said guidance route and said lane data, the recommended enter lane for entering said target intersection and the recommended exit lane for exiting therefrom; and
guiding the vehicle by displaying said recommended enter and exit lanes on the screen.
2. The lane guidance display method according to claim 1, wherein said guiding step comprises the steps of:
generating an intersection image of said target intersection for lane guidance based on said lane data;
generating a running path for said target intersection which passes through both said recommended enter lane and said recommended exit lane; and
displaying, on the screen, a lane guidance intersection image which is a combination of said intersection image and said running path.
3. The lane guidance display method according to claim 2, wherein,
when said target intersection is plurally in proximity in a row, said intersection image generated in said intersection image generating step is a combination of the target intersections in proximity, and
said running path generated in said running path generating step passes through said target intersections in proximity.
4. The lane guidance display method according to claim 2, wherein,
specified as said target intersection in said specifying step are all of the intersections found on said guidance route; and
displayed plurally and collectively in said displaying step is said lane guidance intersection image in order of said target intersections on said guidance route.
5. The lane guidance display method according to claim 2, wherein
said running path generated in said running path generating step is represented by one or more successive arrows directing from said recommended enter lane to said recommended exit lane.
6. The lane guidance display method according to claim 2, wherein,
in said determining step, additionally calculated for each exit lane is a lane level of recommendation, which is represented by discrete or successive numbers, and
said running path generated in said running path generating step is represented, in various manners depending on said lane level of recommendation, by one or more successive arrows directed from said recommended enter lane to said recommended exit lane.
7. The lane guidance display method according to claim 5, wherein,
in said determining step, a ground for said recommended enter and exit lanes is additionally found, and
in said displaying step, an image based on said ground is displayed together with said lane guidance intersection image.
8. The lane guidance display method according to claim 6, wherein,
in said determining step, a ground for said recommended enter and exit lanes is additionally found, and
in said displaying step, an image based on said ground is displayed together with said lane guidance intersection image.
9. A navigation device for guiding a vehicle on a screen from a departure point to a destination or a stopover, said device comprising:
a map data storage part for storing map data including lane data, which is regarding the number of lanes and lane control of roads to be connected to an intersection;
a route search part for searching for, based on said map data, a guidance route from the departure point to the destination or the stopover;
a vehicle position detection part for detecting a vehicle position on said map data;
a target intersection operation part for searching for and specifying, based on said guidance route and said map data, an intersection for guidance on said guidance route (hereinafter, refers to as a target intersection);
the recommended lane operation part for determining, based on said guidance route, said lane data, and said target intersection, the recommended enter lane and the recommended exit lane for said target intersection;
a guidance part for generating, based on said recommended enter and exit lanes and said lane data, lane guidance data required for display on the screen; and
an output part for displaying guidance on the screen according to said lane guidance data.
10. The navigation device according to claim 9, wherein, as said lane guidance data, said guidance part
generates an intersection image for lane guidance based on said lane data for said target intersection,
generates a running path which passes through said recommended enter lane and said recommended exit lane for said target intersection, and
generates a lane guidance intersection image which is a combination of said intersection image and said running path.
11. The navigation device according to claim 10, wherein,
when said target intersection is plurally in proximity in a row, said intersection image generated by said guidance part is a combination of the target intersections in proximity, and said running path generated thereby passes through said target intersections in proximity.
12. The navigation device according to claim 10, wherein
said target intersection operation part specifies all of the intersections found on said guidance route as said target intersection, and
said guidance part outputs said lane guidance data to said output part to plurally and collectively display said lane guidance intersection image in order of said target intersections on said guidance route.
13. The navigation device according to claim 10, wherein
said running path generated by said guidance part is represented by one or more successive arrows directing from said recommended enter lane to said recommended exit lane.
14. The navigation device according to claim 10, wherein
additionally calculated by said recommended lane operation part is a lane level of recommendation for each exit lane represented by discrete or successive numbers, and
said running path generated by said guidance part is represented, in various manners depending on said lane level of recommendation, by one or more successive arrows directed from said recommended enter lane to said recommended exit lane.
15. The navigation device according to claim 13, wherein
said recommended lane operation part additionally finds a ground for said recommended enter and exit lanes, and
said guidance part outputs said lane guidance data to said output part to display an image based on said ground together with said lane guidance intersection image.
16. The navigation device according to claim 14, wherein
said recommended lane operation part additionally finds a ground for said recommended enter and exit lanes, and
said guidance part outputs said lane guidance data to said output part to display an image based on said ground together with said lane guidance intersection image.
17. A recording medium on which a lane guidance display method for guiding, on a screen, a vehicle which lane to take to go through an intersection is recorded as a program executable on a computer, said program at least carries out the steps of:
searching for a guidance route from a departure point to a destination or a stopover based on map data including lane data, which is regarding the number of lanes and lane control of roads to be connected to the intersection;
specifying an intersection for guidance (hereinafter, refers to as a target intersection) located on said guidance route;
determining, based on said guidance route and said lane data, the recommended enter lane for entering said target intersection and the recommended exit lane for exiting therefrom;
generating an intersection image of said target intersection for lane guidance based on said lane data;
generating a running path for said target intersection which passes through both said recommended enter lane and said recommended exit lane; and
displaying, on the screen, a lane guidance intersection image which is a combination of said intersection image and said running path.
18. The recording medium according to claim 17, wherein
said running path generated in said running path generating step is represented by one or more successive arrows directing from said recommended enter lane to said recommended exit lane.
19. The recording medium according to claim 17, wherein,
in said determining step, additionally calculated for each exit lane is a lane level of recommendation, which is represented by discrete or successive numbers, and
said running path generated in said running path generating step is represented, in various manners depending on said lane level of recommendation, by one or more successive arrows directed from said recommended enter lane to said recommended exit lane.
20. The recording medium according to claim 18, wherein,
in said determining step, a ground for said recommended enter and exit lanes is additionally found, and
in said displaying step, an image based on said ground is displayed together with said lane guidance intersection image.
21. The recording medium according to claim 19, wherein,
in said determining step, a ground for said recommended enter and exit lanes is additionally found, and
in said displaying step, an image based on said ground is displayed together with said lane guidance intersection image.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A data interaction system comprising:
a computer processor for executing the following software components;
a mapping component that generates an instance-level mapping between a first model expressed in a first metamodel and a second model expressed in a second metamodel based, at least in part, upon a translation of the first model to the second model, the mapping component translates the first model into constructs of a universal metamodel, then executes transformations that eliminate from the first model all modeling constructs that are absent from the second model, and then translates remaining constructs into the second model;
wherein the universal metamodel includes main modeling constructs found in conventional metamodels and is extensible, such that the universal metamodel can be extended to include these additional constructs, and within the universal metamodel patterns are defined, each pattern represents a construct that may or may not appear in a given metamodel and is expressed as a conjunctive query, patterns are used to describe a metamodel and to annotate transformation rules to indicate their inputs and outputs;
an abstraction component that employs the instance-level mapping to bi-directionally translate a data interaction operation of the first model into a data interaction operation of the second model, wherein the second model is updated incrementally, and wherein a graphical layout of the second model is preserved during editing of the first model; and
a storage component that stores the instance-level mapping to a computer-readable medium;
wherein the instance-level mapping is expressed in an algebraic data transformation language, the instance-level mapping incrementally modified by the mapping component based, at least in part, upon interaction from a user of the system; wherein the mapping component also includes functions that map unique identifiers of first model elements into unique identifiers of second model elements to generate Skolem functions; and
an inheritance mapping data store that stores information regarding a target relation for each direct or inherited attribute of each type of a type hierarchy, the mapping component stores information in the inheritance mapping data store based, upon at least in part, information received from a user regarding a quantity of relations used for representing the type hierarchy, wherein the inheritance mapping data store provides a mechanism that subsumes all known inheritance mapping strategies and provides complete coverage of all possible mapping options.
2. The system of claim 1, the first metamodel being based upon at least one of a SQL metamodel, an XML metamodel, an Entity Relationship metamodel, a C# interface metamodel, a UML metamodel, a UDL metamodel and an object-oriented metamodel.
3. The system of claim 1, the mapping component caches generated elements to avoid regeneration of elements of the mapping that are unaffected by the incremental modification.
4. A data interaction system comprising:
a computer processor for executing the following software components;
an inheritance mapping data store that stores information regarding a target relation for each direct or inherited attribute of each type of a type hierarchy, wherein the inheritance mapping data store provides a mechanism that subsumes all known inheritance mapping strategies and provides complete coverage of all possible mapping options; and,
a mapping component that stores information in the inheritance mapping data store based, at least in part, upon information received from a user regarding a quantity of relations used for representing the type hierarchy;
wherein the information stored in the inheritance mapping data store employed to provide lossless, bi-directional data interaction between a first model expressed in a first metamodel and a second model expressed in a second metamodel; and
wherein the mapping component translates the first model into constructs of a universal metamodel and then translates the constructs into the second model, and wherein the universal metamodel includes main modeling constructs found in conventional metamodels and is extensible, such that the universal metamodel can be extended to include these additional constructs, and within the universal metamodel patterns are defined, each pattern represents a construct that may or may not appear in a given metamodel and is expressed as a conjunctive query, patterns are used to describe a metamodel and to annotate transformation rules to indicate their inputs and outputs.
5. The system of claim 4, a type of the type hierarchy annotated to use a particular inheritance strategy with respect to an inherited attribute.
6. The system of claim 5, the inherited attribute is stored in a relation associated with an ancestor type that defines the inherited attribute.
7. The system of claim 5, a direct instance of the type is stored in one relation which contains the inherited attribute.
8. The system of claim 5, no target relation is created and the inherited attribute is stored with a parent type.
9. A method that facilitates data interaction comprising:
generating an instance-level mapping between a first model expressed in a first metamodel and a second model expressed in a second metamodel, wherein the instance-level mapping expressed in an algebraic data transformation language;
translating the first model into constructs of a universal metamodel and then translating the constructs into the second model;
defining patterns within the universal metamodel, each pattern represents a construct that may or may not appear in a given metamodel and is expressed as a conjunctive query, patterns are used to describe a metamodel and to annotate transformation rules to indicate their inputs and outputs;
employing the instance-level mapping to translate a data interaction operation of the first model into a data interaction operation of the second model;
executing by a processor storing information regarding a target relation for each direct or inherited attribute of each type of a type hierarchy;
storing information in an inheritance mapping data store based, upon at least in part, information received from a user regarding a quantity of relations used for representing the type hierarchy; and
providing a mechanism that subsumes all known inheritance mapping strategies and provides complete coverage of all possible mapping options.
10. The method of claim 9, incrementally modifying the instance-level mapping based, at least in part, upon interaction from a user of the system.
11. The method of claim 9, further comprising storing information regarding a target relation for each direct or inherited attribute of each type of a type hierarchy.
12. The method of claim 11, storing information regarding the target relation is based, at least in part, upon information received from a user regarding a quantity of relations used for representing the type hierarchy.