Updating Relational Databases Through Weak Instance Interfaces.

@article{DBLP:journals/tods/AtzeniT92,
  author    = {Paolo Atzeni and
               Riccardo Torlone},
  title     = {Updating Relational Databases Through Weak Instance Interfaces},
  journal   = {ACM Trans. Database Syst.},
  volume    = {17},
  number    = {4},
  year      = {1992},
  pages     = {718-745},
  ee        = {http://doi.acm.org/10.1145/146931.146936, db/journals/tods/AtzeniT92.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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.

Copyright © 1992 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

Online Edition: ACM Digital Library

Conference Version

References

[1]

Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman: The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 4(3): 297-314(1979) BibTeX

[2]

Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions. ACM Trans. Database Syst. 4(4): 435-454(1979) BibTeX

[3]

Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246(1979) BibTeX

[4]

Paolo Atzeni, Maria Cristina De Bernardis: A New Basis for the Weak Instance Model. PODS 1987: 79-86 BibTeX

[5]

Paolo Atzeni, Maria Cristina De Bernardis: A New Interpretation for Null Values in the Weak Instance Model. J. Comput. Syst. Sci. 41(1): 25-43(1990) BibTeX

[6]

Paolo Atzeni, Riccardo Torlone: Approaches to Updates over Weak Instances. MFDBS 1989: 12-23 BibTeX

[7]

Paolo Atzeni, Riccardo Torlone: Efficient Updates to Independent Schemes in the Weak Instance Model. SIGMOD Conference 1990: 84-93 BibTeX

[8]

Paolo Atzeni, Riccardo Torlone: Updating intensional predicates in Datalog. Data Knowl. Eng. 8: 1-17(1992) BibTeX

[9]

François Bancilhon, Nicolas Spyratos: Update Semantics of Relational Views. ACM Trans. Database Syst. 6(4): 557-575(1981) BibTeX

[10]

Catriel Beeri, Philip A. Bernstein: Computational Problems Related to the Design of Normal Form Relational Schemas. ACM Trans. Database Syst. 4(1): 30-59(1979) BibTeX

[11]

...

[12]

Volkert Brosda, Gottfried Vossen: Update and Retrieval in a Relational Database Through a Universal Schema Interface. ACM Trans. Database Syst. 13(4): 449-485(1988) BibTeX

[13]

Edward P. F. Chan: Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions. SIGMOD Conference 1984: 149-163 BibTeX

[14]

Edward P. F. Chan, Alberto O. Mendelzon: Answering queries on embedded-complete database schemes. J. ACM 34(2): 349-375(1987) BibTeX

[15]

...

[16]

Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos: Partition Semantics for Relations. J. Comput. Syst. Sci. 33(2): 203-233(1986) BibTeX

[17]

Stavros S. Cosmadakis, Christos H. Papadimitriou: Updates of Relational Views. J. ACM 31(4): 742-760(1984) BibTeX

[18]

Umeshwar Dayal, Philip A. Bernstein: On the Correct Translation of Update Operations on Relational Views. ACM Trans. Database Syst. 7(3): 381-416(1982) BibTeX

[19]

Ronald Fagin, Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi: Updating Logical Databases. Advances in Computing Research 3: 1-18(1986) BibTeX

[20]

Ronald Fagin, Jeffrey D. Ullman, Moshe Y. Vardi: On the Semantics of Updates in Databases. PODS 1983: 352-365 BibTeX

[21]

Antonio L. Furtado, Kenneth C. Sevcik, Clesio Saraiva dos Santos: Permitting updates through views of data bases. Inf. Syst. 4(4): 269-283(1979) BibTeX

[22]

Georg Gottlob, Paolo Paolini, Roberto Zicari: Properties and Update Semantics of Consistent Views. ACM Trans. Database Syst. 13(4): 486-524(1988) BibTeX

[23]

Marc H. Graham, Mihalis Yannakakis: Independent Database Schemas. J. Comput. Syst. Sci. 28(1): 121-141(1984) BibTeX

[24]

Peter Honeyman: Testing satisfaction of functional dependencies. J. ACM 29(3): 668-677(1982) BibTeX

[25]

Arthur M. Keller: Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins. PODS 1985: 154-163 BibTeX

[26]

Arthur M. Keller, Jeffrey D. Ullman: On Complementary and Independent Mappings on Databases. SIGMOD Conference 1984: 143-148 BibTeX

[27]

Rom Langerak: View Updates in Relational Databases with an Independent Scheme. ACM Trans. Database Syst. 15(1): 40-66(1990) BibTeX

[28]

Christophe Lécluse, Nicolas Spyratos: Implementing Queries and Updates on Universal Scheme Interfaces. VLDB 1988: 62-75 BibTeX

[29]

David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX

[30]

David Maier, Alberto O. Mendelzon, Yehoshua Sagiv: Testing Implications of Data Dependencies. ACM Trans. Database Syst. 4(4): 455-469(1979) BibTeX

[31]

David Maier, David Rozenshtein, David Scott Warren: Window Functions. Advances in Computing Research 3: 213-246(1986) BibTeX

[32]

David Maier, Jeffrey D. Ullman, Moshe Y. Vardi: On the Foundations of the Universal Relation Model. ACM Trans. Database Syst. 9(2): 283-308(1984) BibTeX

[33]

Alberto O. Mendelzon: Database States and Their Tableaux. ACM Trans. Database Syst. 9(2): 264-282(1984) BibTeX

[34]

Yehoshua Sagiv: Can We Use the Universal Instance Assumption Without Using Nulls? SIGMOD Conference 1981: 108-120 BibTeX

[35]

Yehoshua Sagiv: A Characterization of Globally Consistent Databases and Their Correct Access Paths. ACM Trans. Database Syst. 8(2): 266-286(1983) BibTeX

[36]

Nicolas Spyratos: The Partition Model: A Deductive Database Model. ACM Trans. Database Syst. 12(1): 1-37(1987) BibTeX

[37]

Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6
BibTeX

[38]

...

[39]

...

[40]

...