Implementation of a linear transitive closure algorithm in relational database design

This paper describes a correction to an existing linear transitive closure algorithm found in [1], explains how the algorithm works and provides an example of how it works. Relational database design involves the generation of relational schemes that avoid unnecessary repetition of information. At the same time the ability to accurately retrieve all data stored in the database must be preserved. A transitive closure algorithm can be used in the design process to identify the correct attributes that can be removed without jeopardizing the accuracy of data retrieval [2]. Linear run time can be achieved with the corrected algorithm described in this paper.