Issue No. 06 - December (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.250089
<p>The problem of choosing a storage model for a nested relation (i.e., a relation containing relations) is considered. A technique is introduced that uses the workload information of the database system under consideration to obtain a better storage model (i.e., one with a lower query cost) for a given nested relation. The nested relation scheme is first represented as a tree called the scheme tree. By using the workload information and by performing a series of merges in the nodes of the scheme tree, a near-optimum scheme tree is produced, and file organization types are assigned to each node (file) in the scheme tree. The authors' methodology is applied by using a specific nested relational algebra and three file organization types, namely, sequential, heap, and dense index files. The proposed methodology locates the optimum storage model and the optimum file organization techniques for the external and internal relations of the nested relations tested.</p>
near-optimum storage models; nested relations; workload information; database system; query cost; scheme tree; merges; file organization types; nested relational algebra; dense index files; data structures; relational algebra; relational databases; storage management; trees (mathematics)
G. Ozsoyoglu and A. Hafez, "Near-Optimum Storage Models for Nested Relations Based on Workload Information," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 1018-1038, 1993.