A Designer For DBMS-Processable Logical Database Structures
- 24 August 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 219-231
- https://doi.org/10.1109/vldb.1979.718137
Abstract
An analytical approach to the design of logical database structures is presented. Inputs to the model consist of data item types and volume, associations among items, security constraints, and item access frequencies required to satisfy known database applications. The output is a pro- totype database management system (DBMS) process- able schema for a hierarchical and/or network data- base structure. The design problem is formulated as an integer programming problem and the branch and bound method is used to generate an optimal solution for the parameters specified. The objec- tive function to be minimized is logical record access, subject to constraints on record size and total database size. Experience with the model has shown it to be an excellent predictor of real performance, easy to use, and have relatively low computing cost for moderately-sized database design problems. Use of the model is illustrated through an example problem and its solution. Direct comparison with a previous methodology clearly establishes the superiority of the current approach.Keywords
This publication has 5 references indexed in Scilit:
- From information requirements to DBTG-data structuresPublished by Association for Computing Machinery (ACM) ,1976
- A preliminary system for the design of DBTG data structuresCommunications of the ACM, 1975
- Automatic generation of physical data base structuresPublished by Association for Computing Machinery (ACM) ,1975
- Automatic data base schema design and optimizationPublished by Association for Computing Machinery (ACM) ,1975
- Automating logical file designPublished by Association for Computing Machinery (ACM) ,1975