Toward an Optimal Design of a Network Database from Relational Descriptions

Prabuddha De, William D. Haseman and Charles H. Kriebel
Additional contact information
Prabuddha De: Carnegie-Mellon University, Pittsburgh, Pennsylvania
William D. Haseman: Carnegie-Mellon University, Pittsburgh, Pennsylvania
Charles H. Kriebel: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1978, vol. 26, issue 5, 805-823

Abstract: This paper suggests a method for building up a network database starting from relational descriptions. The network generated is optimal in terms of data item appearances and, given that, it is also optimal in terms of the number of records. Moreover, it preserves third normality, in case we start with third-normal relations. We develop a model for implementing the network that guarantees the minimality of the sum of storage and access costs. We show that the model can be solved efficiently.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.5.805 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:5:p:805-823

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().