Abstract
The paper presents a formal language for specifying database schema transformations. This language consists of a set of primitive operators and a composition operator. Each of the primitive operators has associated the conditions under which it can be applied. A rule is given for generating the applicability conditions of a composed transformations from those of the component transformations. The paper shows how this language can be exploited for supporting a flexible and correct database schema design also when other transformational frameworks are used. © 2001 John Wiley & Sons, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
