On compiling access paths and query processing in relational databases

Includes bibliographical references (pages 76-77)There is interest in making the relational data model to\ud employ more meaningful concepts in its usage. This\ud project intends to allow the user to retrieve data in\ud data dependency form such that the relationships among\ud attributes are transparent to users of relational\ud databases.\ud The concept is similar to Ullman's universal relation\ud as a user interface. The approach taken in this research\ud to interpret the query is totally different and\ud utilizes Sagiv's membership algorithm.\ud A program "SCHEMER", which is written in FORTRAN 5,\ud is built on RIM (Relational Information Management\ud System) to investigate the results of our approach. It\ud is shown that a relational database in the fourth normal\ud form can be built with the aid of the "SCHEMER" and the\ud "SCHEMER'' can compile access paths for user queries