dc.contributor.author |
Link, Sebastian |
en |
dc.coverage.spatial |
Bad Salzau, Germany |
en |
dc.date.accessioned |
2012-12-06T00:48:43Z |
en |
dc.date.issued |
2002 |
en |
dc.identifier.citation |
Lecture Notes in Computer Science. 2284: 160-177. 2002 |
en |
dc.identifier.isbn |
978-3-540-45758-9 |
en |
dc.identifier.issn |
0302-9743 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/19721 |
en |
dc.description.abstract |
The idea to enforce consistency in databases tries to overcome widely known weaknesses for consistency checking and verification techniques. In general terms, a database transition S is systematically modified to a new transition S_I (greatest consistent specialization, GCS) that is provably consistent with respect to a given static constraint I, preserves the effects of S and is maximal with these properties. Effect preservation has been formalized by the operational specialization order ⊑ on (semantic equivalence classes of) database transitions. Its simplicity makes it possible to establish a well-founded theory for reasonably large classes of database programs and static constraints. However, the specialization order may be criticized in some aspects, in particular in its coarseness. We characterize specialization of a database transition S by the preservation of all transition constraints that S satisfies (δ-constraints). This enables us to weaken the original order ⊑ leading to the central definition of maximal consistent effect preservers (MCEs). We proof a normal form result for MCEs that relates them to GCSs and implies existence and uniqueness. This close relationship suggests the conjecture that there is a theory for MCEs similar to the GCS theory. We support this statement by showing that an MCE with respect to a set of static constraints can be enforced sequentially, and independently from the given order. |
en |
dc.publisher |
Springer |
en |
dc.relation.ispartof |
Foundations of Information and Knowledge Systems |
en |
dc.relation.ispartofseries |
Second International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2002) |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.sherpa.ac.uk/romeo/issn/0302-9743/ |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Towards a Tailored Theory of Consistency Enforcement in Databases |
en |
dc.type |
Conference Item |
en |
dc.identifier.doi |
10.1007/3-540-45758-5_11 |
en |
pubs.begin-page |
160 |
en |
pubs.volume |
2284 |
en |
dc.rights.holder |
Copyright: Springer-Verlag Berlin Heidelberg |
en |
pubs.end-page |
177 |
en |
pubs.finish-date |
2002-02-23 |
en |
pubs.place-of-publication |
Lecture Notes in Computer Science |
en |
pubs.start-date |
2002-02-20 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
Conference Paper |
en |
pubs.elements-id |
366077 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.record-created-at-source-date |
2012-11-30 |
en |