P. Atzeni
R. Torlone
ABSTRACT
Database updates have recently received much more attention than in the past. In this trend, a solid foundation is provided to the problem of updating databases through interfaces based on the weak instance model. Insertions and deletions of tuples are considered.
As a preliminary tool, a lattice on states is defined, based on the information content of the various states.
Potential results of an insertion are states that contain at least the information in the original state and that in the new tuple. Sometimes there is no potential result, and in the other cases there may be many of them. We argue that the insertion is deterministic if the state that contains the information common to all the potential results (the greatest lower bound, in the lattice framework) is itself a potential result. Effective characterizations for the various cases exist. A symmetric approach is followed for deletions, with fewer cases, since there are always potential results; determinism is characterized consequently.
- 1.S. Abiteboul. Updates, a new frontier. In Second International Conference on Data Base Theory, Bruges, Lecture Notes in Computer Science 356, pages 1-18, Springer-Verlag, 1988. Google Scholar
Digital Library
- 2.A.V. Aho, Y. Sagiv, and J.D. Ullman. Equivalence of relational expressions. SIAM Journal on Computing, 8(2):218-246, 1979.Google ScholarDigital Library
- 3.P. Atzeni and E.P.F. Chan. Efficient query answering in the representative instance approach. In Fourth ACM SIGA CT-SIGMOD Syrup. on Principles of Database Systems, pages 181-188, 1985. Google ScholarDigital Library
- 4.P. Atzeni and M.C. De Bernardis. A new basis for the weak instance model. In Sizth ACM SIGACT- SIGMOD-S1GART Syrup. on Principles of Database Systems, pages 79-86, 1987. Google ScholarDigital Library
- 5.P. Atzeni and R. Torlone. Updating Databases in the Weak Instance Model. Rapporto R.232, IASI- CNR, Roma, 1988.Google Scholar
- 6.F. Bancilhon and N. Spyratos. Update semantics of relational views. A CM Trans. on Database Syst., 6{4):557-575, 1981. Google ScholarDigital Library
- 7.G. Birkhoff. Lattice Theory. Colloquium Publications, Volume XXV, American Mathematical Society, third edition, 1967.Google Scholar
- 8.J. Biskup and H.H. Bruggemann. Data manipulation languages for the universal relation view DURST. In MFDBS87, LNCS 305, pages 20-41, Springer-Verlag, 1988. Google ScholarDigital Library
- 9.V. Brosda and G. Vossen. Updating a database through a universal scheme interface. In Fourth A CM SIGA CT-SIGMOD Syrup. on Principles of Database Systems, pages 66-75, 1985. Google ScholarDigital Library
- 10.E.P.F. Chan and A.O. Mendelzon. Answering queries on embedded-comphte database schemes. Journal of the ACM, 34{2}:349-375, 1987. Google ScholarDigital Library
- 11.E.F. Codd. 'Universal' relation fails to replace relational model {letter to the editor}. IEEE Software, 5(4):4-6, 1988. Google ScholarDigital Library
- 12.S.S. Cosmadakis, P.C. Kanellakis, and N. Spyratos. Partition semantics for relations. Journal of Comp. and System Sc., 33{1):203-233, 1986. Google ScholarDigital Library
- 13.R. Fagin, G.M. Kuper, J.D. Ullman, and M.Y. Vardi. Updating logical databases. In P.C. Kanellakis and F. Preparata, editors, Advances in Computing Research, Vol.$, pages 1-18, JAI Press, 1986.Google Scholar
- 14.R. Fagin, J.D. Ullman, and M.Y. Vardi. On the semantics of updates in databases. In .%cond A CM SIGACT-SIGMOD Syrup. on Principles of Database Systems, pages 352-365, 1983. Google ScholarDigital Library
- 15.P. Honeyman. Testing satisfaction of functional dependencies. Journal of the ACM, 29(3):668-677, 1982. Google ScholarDigital Library
- 16.C. Lecluse and N. Spyratos. implementing queries and updates on universal scheme interfaces. In Fourteenth International Conference on Very Large Data Bases, Los Angeles, pages 62-75, 1988. Google ScholarDigital Library
- 17.D. Maier. The Theory of Relational Databases. Computer Science Press, Potomac, Maryland, 1983. Google ScholarDigital Library
- 18.D. Maier, A.O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. A CM Trans. on Database Syst., 4{4):455-468, 1979. Google ScholarDigital Library
- 19.D. Maier, D. Rozenshtein, and D.S. Warren. Window functions. In P.C. Kanellakis and F. Preparata, editors, Advances in Computing Research, Vol.$, pages 213-246, JAI Press, 1986.Google Scholar
- 20.D. Maier, J.D. Ullman, and M. Vardi. On the foundations of the universal relation model. A CM Trans. on Database Syst., 9(2}:283-308, 1984. Google ScholarDigital Library
- 21.A.O. Mendelzon. Database states and their tableaux. A CM Trans. on Database Syst., 9(2):264-282, 1984. Google ScholarDigital Library
- 22.Y. Sagiv. A characterization of globally consistent databases and their correct access paths. A CM Trans. on Database Syst., 8(2):266-286, 1983. Google ScholarDigital Library
- 23.N. Spyratos. The partition model- a deductive database model. A CM Trans. on Database Syst., 12(I}:I-37, 1987. Google ScholarDigital Library
- 24.J.D. Ullman. Principles of Database Systems. Computer Science Press, Potomac, Maryland, second edition, 1982. Google ScholarDigital Library
- 25.M.Y. Vardi. The universal relation data model for logical independence. IEEE Software, 5(2):80-85, 1988. Google ScholarDigital Library
Index Terms
- Updating databases in the weak instance model
Recommendations
Updating relational databases through weak instance interfaces
The problem of updating databases through interfaces based on the weak instance model is studied, thus extending previous proposals that considered them only from the query point of view. Insertions and deletions of tuples are considered.
As a ...
Updating outsourced anatomized private databases
EDBT '13: Proceedings of the 16th International Conference on Extending Database TechnologyWe introduce operations to safely update an anatomized database. The result is a database where the view of the server satisfies standards such as k-anonymity or l-diversity, but the client is able to query and modify the original data. By exposing data ...
Comments