The purpose of this research is to improve on the current membership algorithms and their applications in relational database model and information retrieval. A new technique is proposed which makes up for deficiencies in existing methods. This membership algorithm is based on full first-order logic, extending Sagiv's propositional calculus approach. Our technique does not assign one relation name (association) to all database dependencies like the representation of Nicolas. Finally, it may be used to improve relation schema design. Furthermore, we can utilize our technique to derive data retrieval programs for answering queries, an idea that has not previously appeared in the literature.
ASJC Scopus subject areas