Update and Retrieval in a Relational Database Through a Universal Schema Interface.

@article{DBLP:journals/tods/BrosdaV88,
  author    = {Volkert Brosda and
               Gottfried Vossen},
  title     = {Update and Retrieval in a Relational Database Through a Universal
               Schema Interface},
  journal   = {ACM Trans. Database Syst.},
  volume    = {13},
  number    = {4},
  year      = {1988},
  pages     = {449-485},
  ee        = {http://doi.acm.org/10.1145/49346.49884, db/journals/tods/BrosdaV88.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

A database system that is based on the universal relation (UR) model aims at freeing its users from specifying access paths on both the physical and on the logical levels. All information about the logical structure of the database (i.e., its conceptual scheme) is hidden from users; they need only to know the attribute names, which now carry all the semantics of the database.

Previous work on UR interfaces has concentrated on the design and implementation of query languages that serve to facilitate retrieval of data from a relational database. On the other hand, updates are always handled as before, which means that users still have to know the logical structure of the database in case they want to insert, delete, or modify tuples.

In this paper the concepts underlying a UR interface, which is really "universal," are presented; it is based on the UR model, and it permits not only queries but also updates: Combinations of attributes that may participate in an update-operation ("objects") have to be specified during the design phase of the database, and are then embodied into the database scheme by an extended synthesis algorithm. They form the basis for any insertion or deletion operation. A precise definition of "insertable" tuples, and of the insert- and delete-operation in this new context, is given. It is then shown that these operations modify a database state in such a way that a representative instance always exists. This is accomplished by providing a more detailed version of Sagiv's uniqueness condition and by exploring the structure of nonunique objects. Since the underlying database always has a representative instance, this instance can be used to define the window function for retrieval. It is shown that it is still possible to compute windows by a union of minimal extension joins.

Copyright © 1988 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-1 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

Conference Version

References

[1]

William Ward Armstrong: Dependency Structures of Data Base Relationships. IFIP Congress 1974: 580-583 BibTeX

[2]

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

[3]

Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalence of Relational Database Schemes. SIAM J. Comput. 10(2): 352-370(1981) BibTeX

[4]

Joachim Biskup, Hans Hermann Brüggemann: Universal Relation Views: A Pragmatic Approach. VLDB 1983: 172-185 BibTeX

[5]

Joachim Biskup, Umeshwar Dayal, Philip A. Bernstein: Synthesizing Independent Database Schemas. SIGMOD Conference 1979: 143-151 BibTeX

[6]

...

[7]

Ronald Fagin: A Normal Form for Relational Databases That Is Based on Domians and Keys. ACM Trans. Database Syst. 6(3): 387-415(1981) BibTeX

[8]

...

[9]

...

[10]

Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman: System/U: A Database System Based on the Universal Relation Assumption. ACM Trans. Database Syst. 9(3): 331-347(1984) BibTeX

[11]

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

[12]

...

[13]

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

[14]

David Maier, Jeffrey D. Ullman: Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. 8(1): 1-14(1983) BibTeX

[15]

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

[16]

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

[17]

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

[18]

Sharon C. Salveter: A Transportable Natural Language Database Update System. PODS 1984: 239-247 BibTeX

[19]

...

[20]

Edward Sciore: Improving Database Schemes by Adding Attributes. PODS 1983: 379-383 BibTeX

[21]

...

[22]

Jacob Stein, David Maier: Relaxing the Universal Relation Scheme Assumption. PODS 1985: 76-84 BibTeX

[23]

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

[24]

...

[25]

Jeffrey D. Ullman: On Kent's "Consequences of Assuming a Universal Relation". ACM Trans. Database Syst. 8(4): 637-643(1983) BibTeX

[26]

...

[27]

Gottfried Vossen, Volkert Brosda: A High-Level User Interface for Update and Retrieval in Relational Databases - Language Aspects. SIGMOD Conference 1985: 343-353 BibTeX

Referenced by

1. Elisa Bertino, Pierangela Samarati, Sushil Jajodia: An Extended Authorization Model for Relational Databases. IEEE Trans. Knowl. Data Eng. 9(1): 85-101(1997)
2. Paolo Atzeni, Riccardo Torlone: Updating Relational Databases Through Weak Instance Interfaces. ACM Trans. Database Syst. 17(4): 718-745(1992)
3. Jeffrey R. Horowitz, Alfonso F. Cardenas: Decomposing Heterogeneous Inter-Entity Relationship Updates. IEEE Trans. Knowl. Data Eng. 4(4): 360-370(1992)
4. Tzy-Hey Chang, Edward Sciore: A Universal Relation Data Model with Semantic Abstraction. IEEE Trans. Knowl. Data Eng. 4(1): 23-33(1992)
5. M. E. Iofinova: Updating Hierarchical Databases by Complex Forms. MFDBS 1991: 134-145
6. Rom Langerak: View Updates in Relational Databases with an Independent Scheme. ACM Trans. Database Syst. 15(1): 40-66(1990)
7. Paolo Atzeni, Riccardo Torlone: Approaches to Updates over Weak Instances. MFDBS 1989: 12-23