ACM Home Page
Please provide us with feedback. Feedback
Updating relational databases through weak instance interfaces
Full text PdfPdf (1.93 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 17 ,  Issue 4  (December 1992) table of contents
Pages: 718 - 745  
Year of Publication: 1992
ISSN:0362-5915
Authors
Paola Atzeni  Univ. di Roma “La Sapienza,” Rome, Italy
Riccardo Torlone  IASI-CNR, Rome, Italy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 28,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/146931.146936
What is a DOI?

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
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...

Collaborative Colleagues:
Paola Atzeni: colleagues
Riccardo Torlone: colleagues