Relational database: selected writings
Relational database: selected writings
The relational model for database management: version 2
The relational model for database management: version 2
Optimization of relational schemas containing inclusion dependencies
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Referential integrity revisited: an object-oriented perspective
Proceedings of the sixteenth international conference on Very large databases
Identifying Extended Entity-Relationship Object Structures in Relational Schemas
IEEE Transactions on Software Engineering
An introduction to database systems (7th ed.)
An introduction to database systems (7th ed.)
Managing referential integrity and non key-based dependencies in a denormalized context
Proceedings of the 2000 information resources management association international conference on Challenges of information technology management in the 21st century
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Justification for Inclusion Dependency Normal Form
IEEE Transactions on Knowledge and Data Engineering
A Methodology for Semantically Enriching Interoperable Databases
BNCOD 11 Proceedings of the 11th British National Conference on Databases: Advances in Databases
Data Dependency Elicitation in Database Reverse Engineering
CSMR '01 Proceedings of the Fifth European Conference on Software Maintenance and Reengineering
Hi-index | 0.00 |
Mapping a database schema from one model into another, with a higher semantic capacity, is a current research subject with application in several development fields, such as schema integration and translation, migration from legacy systems and reengineering of poor quality or no-longer accurate data models. Inclusion dependencies are one of the most important concepts in relational databases and they are the key to perform some reengineering of database schemas. Referential integrity restrictions (rir), a particular case of an inclusion constraint, requires that the set of distinct values occurring in some specified column, simple or composite (foreign key), must be a subset of the set of distinct primary key values drawn from the same domain. Pure inclusion dependencies (id), however, may apply between other pairs of attributes also (alternate keys or non-keys). Database schemas containing ids frequently reveal the presence of hidden objects and misrepresented relationships and, as a consequence, increase the effort to develop program applications and maintain the integrity. This work presents a heuristics for the conversion of schemas with ids into equivalent schemas with only rirs. In case some irreducible ids remain, a semantic interpretation of their necessity and maintenance is given.