Abstract
The fundamental problem in the design of update strategies for views of database schemata is that of selecting how the view update is to be reflected back to the base schema. This work presents a solution to this problem, based upon the dual philosophies of closed update strategies and order-based database mappings. A closed update strategy is one in which the entire set of updates exhibit natural closure properties, including transitivity and reversibility. The order-based paradigm is a natural one; most database formalisms endow the database states with a natural order structure, under which update by insertion is an increasing operation, and update by deletion is decreasing. Upon augmenting the original constant-complement strategy of Bancilhon and Spyratos – which is an early version of a closed update strategy – with compatible order-based notions, the reflection to the base schema of any update to the view schema which is an insertion, a deletion, or a modification which is realizable as a sequence of insertions and deletions is shown to be unique and independent of the choice of complement. In addition to this uniqueness characterization, the paper also develops a theory which identifies conditions under which a natural, maximal, update strategy exists for a view. This theory is then applied to a ubiquitous example – single-relational schemata constrained by equality-generating dependencies. Within this framework it is shown that for a view defined as a projection of the main relation, the only possibility is that the complement defining the update process is also a projection, and that the reconstruction is based upon functional dependencies.
Similar content being viewed by others
References
S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, Reading, MA, 1995).
J. Adámek, H. Herrlich and G. Strecker, Abstract and Concrete Categories (Wiley-Interscience, New York, 1990).
F. Bancilhon and N. Spyratos, Update semantics of relational views, ACM Transactions on Database Systems 6 (1981) 557–575.
Z. Bellahsène, Updates and object-generating views in ODBS, Data and Knowledge Engineering 34 (2000) 125–163.
F. Bentayeb and D. Laurent, View updates translations in relational databases, in: Proc. of DEXA '98, Vienna (24-28 September 1998) pp. 322–331.
B.A. Davey and H.A. Priestly, Introduction to Lattices and Order, 2nd ed. (Cambridge Univ. Press, Cambridge, 2002).
P. De Bra and J. Paredaens, Horizontal decompositions for handling exceptions to functional dependencies, in: Advances in Data Base Theory, eds. H. Gallaire, J. Minker and J.M. Nicolas, Vol. 2 (Plenum Press, New York, 1984) pp. 123–141.
R. Fagin, Horn clauses and database dependencies, Journal of the Association for Computing Machinery 29(4) (1982) 952–985.
G. Gottlob, P. Paolini and R. Zicari, Properties and update semantics of consistent views, ACM Transactions on Database Systems 13 (1988) 486–524.
J. Grant and B.E. Jacobs, On the family of generalized dependency constraints, Journal of the Association for Computing Machinery 29(5) (1982) 986–997.
G. Grätzer, Universal Algebra (D. Van Nostrand, New York, 1968).
S.J. Hegner, Foundations of canonical update support for closed database views, in: ICDT'90, 3rd Internat. Conf. on Database Theory, eds. S. Abiteboul and P.C. Kanellakis, Paris, France (December 1990) pp. 422–436.
S.J. Hegner, Some open problems on view axiomatization, Bulletin of the EATCS (40) (1990) 496–498.
S.J. Hegner, Characterization of desirable properties of general database decompositions, Annals of Mathematics and Artificial Intelligence 7 (1993) 129–195.
S.J. Hegner, Unique complements and decompositions of database schemata, Journal of Computer and System Sciences 48(1) (1994) 9–57.
S.J. Hegner, Uniqueness of update strategies for database views, in: Foundations of Information and Knowledge Systems: Proc. of the 2nd Internat. Symposium, FoIKS 2002, Salzau Castle, Germany (February 2002) pp. 230–249.
R. Hull, Finitely specifiable implicational dependency families, Journal of the Association for Computing Machinery 31(2) (1984) 210–226.
E. Mayol and E. Teniente, A survey of current methods for integrity constraint maintenance and view updating, in: Proc. of ER '99 Workshops, Paris (15-18 November 1999) Lecture Notes in Computer Science, Vol. 1727 (Springer, New York, 1999).
J.D. Monk, Mathematical Logic (Springer, Berlin, 1976).
B. Thalheim, Entity-Relationship Modeling (Springer, Berlin, 2000).
K. Wang and M.H. Graham, Constant-time maintainability: A generalization of independence, ACM Transactions on Database Systems 17(2) (1992) 201–246.