DocumentCode :
3470096
Title :
A Designer For DBMS-Processable Logical Database Structures
Author :
Irani, Keki B. ; Purkayastha, Subir ; Teorey, Toby J.
Author_Institution :
The University of Michigan
fYear :
1979
fDate :
3-5 Oct. 1979
Firstpage :
219
Lastpage :
231
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 prototype database management system (DBMS) processable schema for a hierarchical and/or network database 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 objective 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 :
Centralized control; Constraint optimization; Costs; Data security; Database systems; Design optimization; Frequency; Linear programming; Predictive models; Prototypes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Very Large Data Bases, 1979. Fifth International Conference on
Conference_Location :
Rio de Janeiro, Brazil
Type :
conf
DOI :
10.1109/VLDB.1979.718137
Filename :
718137
Link To Document :
بازگشت