An approximation algorithm for the physical access path selection in the CODASYL environment

A heuristic algorithm for the selection of an optimal access path configuration for CODASYL databases is presented. This algorithm is based on the idea of extending index selection techniques proposed for relational systems to COD ASYL systems. The proposed approach has the worth effacing the physical design problem in a unified way; moreover, it allows for covering a large spectrum of physical decision variables, namely, location modes, set implementations, set orders and search keys.