|
ABSTRACT
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 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 a potential result itself. 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 as a consequence.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
| |
3
|
AHo, A V., SAGIV, Y., AND ULLMAN, d. D. Equivalence of relational expressions. SIAM d. Comput. 8, 2 (1979), 218-246.
|
 |
4
|
|
| |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
BmKHOF~~, G. Lattice Theory. Colloquium Pubhcations, Volume XXV. third ed., American Mathematical Society, 1967.
|
 |
12
|
|
 |
13
|
|
 |
14
|
|
| |
15
|
|
| |
16
|
|
 |
17
|
|
 |
18
|
|
| |
19
|
FAGIN, R., KUPER, G. M., ULLMAN, J. D., AND VARDI, M.Y. Updating logical databases. In Advances zn Computing Research, Vol 3, P C. Kanellakis and F. P. Preparata, Eds., JAI Press, 1986, pp. 1-18.
|
 |
20
|
|
| |
21
|
FU~TAr)O, A., SEVmK, K., Am} Dos SANTOS, C. S Permitting updates through wews of databases. Inf. ,~vst. 4, 4 (1979), 269-283.
|
 |
22
|
|
| |
23
|
GnAHA,X~, M H A~D YANNAKAIqS, M. Independent database schemas d. Comut. Sys Scl 28, I (1984), 121-141.
|
 |
24
|
|
 |
25
|
Arthur M. Keller, Algorithms for translating view updates to database updates for views involving selections, projections, and joins, Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.154-163, March 25-27, 1985, Portland, Oregon, United States
[doi> 10.1145/325405.325423]
|
 |
26
|
|
 |
27
|
|
| |
28
|
|
| |
29
|
MAmR, D The Theory af Relatmnal Databases Computer Science Press, Rockville, Md, 1983.
|
 |
30
|
|
| |
31
|
MAIER, D, ROZENSHTEIN, D , AND WARREN, D S. Window functions. In Advances m Comput- Ln~ Research, Vol 3, P. C. Kanellakis and F. P Preparata, Eds., JAI Press, 1986, pp. 213 246
|
 |
32
|
|
 |
33
|
|
 |
34
|
|
 |
35
|
|
 |
36
|
|
| |
37
|
UI,LMAN, J.D. Principles of Database Systems. 2nd ed., Computer Science Press, Rockwlle, Md., 1982.
|
| |
38
|
ULLMAN, J. D. Universal relation interfaces for database systems In Proceedzngs of IFIP Congress (1983), pp. 243 252.
|
| |
39
|
|
| |
40
|
|
REVIEW
"Rajeev Kaula : Reviewer"
In relational databases, a weak instance model provides a framework
to consider the database as a whole, regardless of the way the
attributes appear in the various relation schemes. The weak instance
model has been used as a basis for an inter
more...
|