A Design Methodology for A Universal Relation Scheme Implementation via Codasyl
Kuck, Sharon Mccure
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/69512
Description
Title
A Design Methodology for A Universal Relation Scheme Implementation via Codasyl
Author(s)
Kuck, Sharon Mccure
Issue Date
1982
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Abstract
We develop a design methodology for a relational database system that uses the network model for implementation purposes. Recent advances in design theory for relational databases are incorporated into the design. Two major topics in the translation of one data model into another, addressed in this thesis, are schema translation and query translation. Schema translation begins with a well-designed relational schema. We use calc and search keys to efficiently enforce all key constraints in the network database (thereby enforcing all functional dependencies embodied in the relational schema). The resulting network schema handles incomplete information, since we use only the modified foreign-key constraint and not the universal instance assumption. The representative instance, a correct representation of information stored in the relational database, can be stored into the network database and later retrieved. We include a schema translation algorithm for a relational schema whose corresponding database has the property that each relation can be updated independently of the other relations. We give two algorithms for translating a relational query to a network application program. Suppose that the relational query refers to the set of attributes X. The network query computes the X-total projection of the representative instance which is the correct answer to a query. The first algorithm is confined to relational queries that express selections and projections over the universal relation scheme. The second algorithm includes all relational queries over select, project and (natural) join. Optimization techniques are discussed for both types of translation along with a global optimization algorithm.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
