Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1976 | 10.1145/1499799.1499912 | AFIPS Spring Conference |
Keywords | Field | DocType |
data request,optimal structure,optimal data structure,additional set,additional storage,new network structure,existing network structure,known data,canonical plex structure,optimal network data base,cost function,operations research,data structure,canonical form,design optimization,functional dependency,indexation | Data mining,Data structure,Computer science,Search engine indexing,Canonical form,Theoretical computer science,Functional dependency,Canonical model,Network data,Network structure | Conference |
Citations | PageRank | References |
1 | 2.79 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Larry Clough | 1 | 21 | 4.15 |
| William D. Haseman | 2 | 121 | 35.75 |
| Yuk Ho So | 3 | 7 | 3.98 |