A data definition and mapping language
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
An Introduction to Database Systems
An Introduction to Database Systems
An approach to Stored Data Definition and Translation
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
Architecture to an interactive migration system (AIMS)
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
“Automatic generation of data conversion programs using a data description language”
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
Generalized data base management system data structures and their mappingto physical storage
Generalized data base management system data structures and their mappingto physical storage
An approach to data description and conversion
An approach to data description and conversion
Report to X3 on data definition languages
ACM SIGMOD Record
Software compatibility: what was promised, what we have, what we need
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
This paper is concerned with developing a methodology for designing optimal network data base structures. The model uses as an input the logical description of the files and existing network structures which are to compose the new network structure, along with a list of the functional dependencies of each file. From this input, a canonical plex structure is generated which contains all the known data and its relationships in a non-redundant form. This canonical form can be modified by adding additional sets and indexing schemes which can improve the retrieval efficiencies at the cost of additional storage. Given the set of queries or data requests and their relative importance, an operations research model can develop an optimal data structure which minimizes a multiple objective cost function. A methodology is then proposed for loading this optimal structure as well as for detecting when a reorganization or new network structure is necessary.