Software developers adapt to the fast-moving nature of software systems with agile development techniques. However, database developers lack the tools and concepts to keep pace. Data, already existing in a running product, needs to be evolved accordingly, usually by manually written SQL scripts. A promising approach in database research is to use a declarative database evolution language, which couples both schema and data evolution into intuitive operations. Existing database evolution languages focus on usability but did not aim for completeness. However, this is an inevitable prerequisite for reasonable database evolution to avoid complex and error-prone workarounds. We argue that relational completeness is the feasible expressiveness for a database evolution language. Building upon an existing language, we introduce CoDEL. We define its semantic using relational algebra, propose a syntax, and show its relational completeness.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:29504 |
| Date | 02 June 2016 |
| Creators | Herrmann, Kai, Voigt, Hannes, Behrend, Andreas, Lehner, Wolfgang |
| Contributors | Technische Universität Dresden |
| Publisher | Lecture Notes in Computer Science |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Source | Advances in Databases and Information Systems - 19th East European Conference, ADBIS 2015 Poitiers, France, September 8–11, 2015 Proceedings |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0021 seconds