Data Model Equivalence
The current proliferation of proposals for database system data models and the desire for database systems which support several different data models raise many questions concerning "equivalence properties" of different data models. To answer these questions, one first needs clear definit...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148946 |
| _version_ | 1811073274463911936 |
|---|---|
| author | Borkin, Sheldon A. |
| author_facet | Borkin, Sheldon A. |
| author_sort | Borkin, Sheldon A. |
| collection | MIT |
| description | The current proliferation of proposals for database system data models and the desire for database systems which support several different data models raise many questions concerning "equivalence properties" of different data models. To answer these questions, one first needs clear definitions of the concepts under discussion. This paper presents formal definitions of the terms database, operation, operation type, application model and data model. Using this formal framework, database state equivalence, operation equivalence, application model equivalence and data model equivalence are distinguished. Three types of application and data model equivalence are defined - isomorphic, composed operation and state dependent. Possiblities for partial equivalences are mentioned. Implementation implications of these different equivalences are discussed. Examples are presented using two semantic data models, the semantic relation data model and the semantic graph data model. |
| first_indexed | 2024-09-23T09:30:52Z |
| id | mit-1721.1/148946 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T09:30:52Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1489462023-03-30T04:11:11Z Data Model Equivalence Borkin, Sheldon A. The current proliferation of proposals for database system data models and the desire for database systems which support several different data models raise many questions concerning "equivalence properties" of different data models. To answer these questions, one first needs clear definitions of the concepts under discussion. This paper presents formal definitions of the terms database, operation, operation type, application model and data model. Using this formal framework, database state equivalence, operation equivalence, application model equivalence and data model equivalence are distinguished. Three types of application and data model equivalence are defined - isomorphic, composed operation and state dependent. Possiblities for partial equivalences are mentioned. Implementation implications of these different equivalences are discussed. Examples are presented using two semantic data models, the semantic relation data model and the semantic graph data model. 2023-03-29T14:11:45Z 2023-03-29T14:11:45Z 1978-12 https://hdl.handle.net/1721.1/148946 4888489 MIT-LCS-TM-118 application/pdf |
| spellingShingle | Borkin, Sheldon A. Data Model Equivalence |
| title | Data Model Equivalence |
| title_full | Data Model Equivalence |
| title_fullStr | Data Model Equivalence |
| title_full_unstemmed | Data Model Equivalence |
| title_short | Data Model Equivalence |
| title_sort | data model equivalence |
| url | https://hdl.handle.net/1721.1/148946 |
| work_keys_str_mv | AT borkinsheldona datamodelequivalence |