A comprehensive model for the storage structure design of codasyl databases

摘要

The performance of a database system depends, to a large extent, on the storage structure selected to represent the logical schema of the database. A comprehensive model for the physical design of network model databases is presented. It evaluates the retrieval time for each user query, database updating cost, storage requirements and total cost of the system in terms of design parameters. A linear 0–1 goal programming model, because of its multicriteria nature, has been selected here as a solution procedure. It finds the optimal location mode of each database record type based on the priority and weights assigned to the conflicting design objectives; short retrieval time for a user query, low database updating cost, small storage requirements and low total cost of the system. The designer can interactively change value of design parameters, priority and weights to perform tradeoff analysis. The model has been tested in the design of a department store database.