The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Database abstractions: aggregation
Communications of the ACM
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
On the semantics of the relational data model
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
View representation in logical database design
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Formal definition of mappings in a data base
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Systems for Large Data Bases
The relational and network approaches: Comparison of the application programming interfaces
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
Schema equivalence as a counting problem
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Method for data models integration in the common paradigm
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
| Hi-index | 0.00 |
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, dabase state equivalence, operation equuivalence, 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. Possibilities for partial equivalences are mentioned. Implementation implications of these different equivalences are discussed.