Update and Retrieval in a Relational Database through a Universal Schema Interface

Abstract

A database system that is based on the universal relation (UR) model aims at freezing its users from specifying access paths on both the physical and on the logical levels. All information about the logical structure of the database is hidden from users; they need only to know the attribute names, which now carry all the semantics of the database. 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. 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.