CA2118358A1 - Method for mapping between object-oriented models and relational models, or between two object models - Google Patents
Method for mapping between object-oriented models and relational models, or between two object modelsInfo
- Publication number
- CA2118358A1 CA2118358A1 CA 2118358 CA2118358A CA2118358A1 CA 2118358 A1 CA2118358 A1 CA 2118358A1 CA 2118358 CA2118358 CA 2118358 CA 2118358 A CA2118358 A CA 2118358A CA 2118358 A1 CA2118358 A1 CA 2118358A1
- Authority
- CA
- Canada
- Prior art keywords
- node
- model
- mapping
- nodes
- relational
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Stored Programmes (AREA)
Abstract
ABSTRACT OF THE DISCLOSURE
A mapping is produced from an object model to a relational model including specifying the search area by preparing subgraphs to specify a semantic query, applying the specifying step by using subgraph isomorphism to determine a set of matches of a set of nodes between the subgraph and the object model, and mapping particular information of the matched nodes (typically stored in the form of data) to the relational model. A reporting is produced to describe the relations between the nodes in the object model which is translated to the relational model along with the specific data contained therein. Using the results of the reporting as well as the specific data, the information contained in the relational model may be mapped into a second object model with the relations between the nodes created by the reporting.
A mapping is produced from an object model to a relational model including specifying the search area by preparing subgraphs to specify a semantic query, applying the specifying step by using subgraph isomorphism to determine a set of matches of a set of nodes between the subgraph and the object model, and mapping particular information of the matched nodes (typically stored in the form of data) to the relational model. A reporting is produced to describe the relations between the nodes in the object model which is translated to the relational model along with the specific data contained therein. Using the results of the reporting as well as the specific data, the information contained in the relational model may be mapped into a second object model with the relations between the nodes created by the reporting.
Claims (20)
1. A method for mapping information from a first object model to a relational model including the steps of:
specifying the search area by preparing subgraphs to specify a semantic query;
applying the results of the specifying step by using subgraph isomorphism to determine one or more matched node between the subgraph and the object model; and mapping desired data of the matched nodes to the relational model.
specifying the search area by preparing subgraphs to specify a semantic query;
applying the results of the specifying step by using subgraph isomorphism to determine one or more matched node between the subgraph and the object model; and mapping desired data of the matched nodes to the relational model.
2. The method as described in claim 1, further including the step of:
reporting locations of said desired data.
reporting locations of said desired data.
3. The method as described in claim 2, further including the steps of:
mapping said desired data from the relational model to a second object model; and creating relations between nodes in the second object model based upon said data.
mapping said desired data from the relational model to a second object model; and creating relations between nodes in the second object model based upon said data.
4. The method as described in claim 1, wherein a first node matched in the subgraph isomorphism process is matched utilizing an efficient process.
5. The method as described in claim 4, wherein the first node matched in the subgraph isomorphism process is the node of the highest degree.
6. The method as described in claim 4, wherein the first node matched in the subgraph isomorphism process is the node which has the rarest occurrence in the first object model.
7. The method as described in claim 1, wherein said mapping of data relates to transferring said data to different databases.
8. A method for mapping information from an object-oriented computer model to a relational oriented computer model including the steps of:
applying one or more semantic queries based upon subgraph isomorphism which are applicable to an object model to identify nodes with attributes, or groups of nodes sharing desired attributes; and mapping all of the nodes or groups of nodes sharing an attribute in said object-oriented computer model onto a particular format applicable to said relational oriented computer model based upon said attributes.
applying one or more semantic queries based upon subgraph isomorphism which are applicable to an object model to identify nodes with attributes, or groups of nodes sharing desired attributes; and mapping all of the nodes or groups of nodes sharing an attribute in said object-oriented computer model onto a particular format applicable to said relational oriented computer model based upon said attributes.
9. The method as described in claim 8, further including the steps of:
reporting all of the nodes or groups of nodes contained within at least one key grouping.
reporting all of the nodes or groups of nodes contained within at least one key grouping.
10. A method as described in claim 9, further including mapping from a relational oriented computer model to a second object-oriented computer model also including the steps of:
defining one or more keys resulting from the mapping from the first object model to the relational model based upon attributes of said node or group of nodes; and mapping all of the nodes or groups of nodes sharing one of said keys in said relational oriented computer model to an attribute in said second object model based upon said first object model.
defining one or more keys resulting from the mapping from the first object model to the relational model based upon attributes of said node or group of nodes; and mapping all of the nodes or groups of nodes sharing one of said keys in said relational oriented computer model to an attribute in said second object model based upon said first object model.
11. The method as described in claim 10, wherein the subgraph isomorphism process is matched utilizing an efficient process.
12. The method as described in claim 11, wherein a first node matched in the subgraph isomorphism process is the node of the highest degree.
13. The method as described in claim 11, wherein a first node matched in the subgraph isomorphism process is the node which has the rarest occurrence in the first object model.
14. A method for mapping information from a first object model to a relational model including the steps of:
defining search particulars by preparing subgraphs which are organized as a semantic query;
matching at least one node of the subgraph with the object model using subgraph isomorphism; and mapping said particulars into a relational model.
defining search particulars by preparing subgraphs which are organized as a semantic query;
matching at least one node of the subgraph with the object model using subgraph isomorphism; and mapping said particulars into a relational model.
15. The method as described in claim 14, further including the step of;
reporting locations of said particulars.
reporting locations of said particulars.
16. The method as described in claim 15, further including the steps of:
mapping said particulars from the relational model to a second object model: and creating relations between nodes in the second object model based upon said data.
mapping said particulars from the relational model to a second object model: and creating relations between nodes in the second object model based upon said data.
17. The method as described in claim 14, wherein a first node matched in the subgraph isomorphism process is matched utilizing an efficient process.
18. The method as described in claim 17, wherein the first node matched in the subgraph isomorphism process is the node of the highest degree.
19. The method as described in claim 17, wherein the first node matched in the subgraph isomorphism process is the node which has the rarest occurrence in the first object model.
20. The method as described in claim 14, wherein said mapping of particulars relates to transferring of data.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US13953393A | 1993-10-19 | 1993-10-19 | |
| US08/139,533 | 1993-10-19 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2118358A1 true CA2118358A1 (en) | 1995-04-20 |
| CA2118358C CA2118358C (en) | 2009-11-24 |
Family
ID=22487126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA 2118358 Expired - Lifetime CA2118358C (en) | 1993-10-19 | 1994-10-18 | Method for mapping between object-oriented models and relational models, or between two object models |
Country Status (2)
| Country | Link |
|---|---|
| JP (1) | JPH07191838A (en) |
| CA (1) | CA2118358C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110688693A (en) * | 2019-09-05 | 2020-01-14 | 临沂大学 | Indoor thin-wall three-dimensional model reconstruction method considering topology and part of building component semantics |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080028057A1 (en) * | 2006-07-26 | 2008-01-31 | International Business Machines Corporation | System and method to facilitate design and operation of event-driven, embedded solutions |
-
1994
- 1994-10-18 CA CA 2118358 patent/CA2118358C/en not_active Expired - Lifetime
- 1994-10-18 JP JP27721794A patent/JPH07191838A/en not_active Withdrawn
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110688693A (en) * | 2019-09-05 | 2020-01-14 | 临沂大学 | Indoor thin-wall three-dimensional model reconstruction method considering topology and part of building component semantics |
| CN110688693B (en) * | 2019-09-05 | 2023-02-21 | 临沂大学 | Indoor thin-wall three-dimensional model reconstruction method considering topology and part of building component semantics |
Also Published As
| Publication number | Publication date |
|---|---|
| CA2118358C (en) | 2009-11-24 |
| JPH07191838A (en) | 1995-07-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Berzal et al. | TBAR: An efficient method for association rule mining in relational databases | |
| KR100656528B1 (en) | Dynamic Update Cube and Hybrid Queries Search Method for Range-Sum Queries | |
| CN101436192B (en) | Method and apparatus for optimizing inquiry aiming at vertical storage type database | |
| US6980976B2 (en) | Combined database index of unstructured and structured columns | |
| ES2132922T3 (en) | COMPUTER SYSTEM FOR THE CREATION OF MODELS OF SEMANTIC OBJECTS FROM EXISTING DATABASES OF RELATIONAL DATABASES. | |
| CN102693310A (en) | Resource description framework querying method and system based on relational database | |
| CA2336651A1 (en) | Value-instance-connectivity computer-implemented database | |
| WO1998039697A3 (en) | System and method for accessing heterogeneous databases | |
| EP1317715A1 (en) | System and method for comparing heterogeneous data sources | |
| CN107169033A (en) | Relation data enquiring and optimizing method with parallel framework is changed based on data pattern | |
| JP2005534121A (en) | Data management architecture related to generic data items using references | |
| KR20060112191A (en) | Sql language extensions for modifying collection-valued and scalar valued columns in a single statement | |
| Chun et al. | Dynamic update cube for range-sum queries | |
| Saha et al. | Schema covering: a step towards enabling reuse in information integration | |
| Gahegan et al. | An intelligent, object-oriented geographical information system | |
| US20060161525A1 (en) | Method and system for supporting structured aggregation operations on semi-structured data | |
| Devarakonda | Object-relational database systems—the road ahead | |
| CN108241709A (en) | A kind of data integrating method, device and system | |
| Yaseen et al. | An extensible kernel object management system | |
| CN108984626A (en) | A kind of data processing method, device and server | |
| US20050060307A1 (en) | System, method, and service for datatype caching, resolving, and escalating an SQL template with references | |
| CA2118358A1 (en) | Method for mapping between object-oriented models and relational models, or between two object models | |
| Bartolini et al. | PAtterns for Next-generation DAtabase systems: preliminary results of the PANDA project. | |
| CN115048377A (en) | Time-space keyword query method under mixed storage block chain environment | |
| Carlis et al. | A descriptive model of physical database design problems and solutions |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20141020 |