This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Near-Optimum Storage Models for Nested Relations Based on Workload Information
December 1993 (vol. 5 no. 6)
pp. 1018-1038

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.

[1] D. Bitton, D. J. DeWitt, and C. Turbyfill, "Benchmarking database systems--A systematic approach," inProc. 1983 Very Large Data-base conf., Oct. 1983.
[2] M. W. Blasgen and K. P. Eswaran, "Storage and access in relational databases,"IBM Syst. J., vol. 16, no. 4, 1977.
[3] K. Bratbergsengen, "Hashing methods and relational algebra operations," inProc. Conf. Very Large Data Bases(Singapore), Aug. 1984, pp. 323-333.
[4] E. F. Codd, "A relational model of data for large shared data banks,"Commun. ACM, pp. 377-387, June 1970.
[5] L. S. Colby, "A recursive algebra and query optimization for nested relations," inProc. ACM-SIGMOD Conf., 1989, pp. 273-283.
[6] G. P. Copeland and S. Khoshafian, "A decomposed storage model," inProc. ACM SIGMOD Conf. Management of Data, May 1985.
[7] V. Deshpande and P. Larson, "An algebra for nested relations," Tech. Rep. CS-87-65, Dept. Comput. Sci., Univ. of Waterloo, Dec. 1987.
[8] P. Dadamet al., "A DBMS prototype to support extended NF2 relations: An integrated view on flat tables and hierarchies," inProc. ACM SIGMOD, 1986, pp. 356-367.
[9] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[10] P. C. Fischer and S. J. Thomas, "Operations for non-first-normal-form relations,"IEEE COMPSAC Conf., 1983.
[11] A. Hafez, "Storage models for nested relations," Ph.D. dissertation, Thesis, Case Western Reserve Univ., Cleveland, OH, Aug. 1989.
[12] A. Hafez and G. Ozsoyoglu, "The partial normalized storage models,"VLDB Conf., 1988.
[13] M. Hammer and B. Niamir, "A heuristic approach to attribute partitioning," inProc. ACM SIGMOD Conf., 1979, pp. 93-101.
[14] J. A. Hoffer and D. G. Severance, "The use of cluster analysis in physical database design,"VLDB Conf., 1975.
[15] G. Jaeschke and H. J. Schek, "Remarks on the algebra of non first normal form relations," inProc. ACM Symp. Principles Database Syst., Los Angeles, CA, Mar. 1982, pp. 124-138.
[16] S. Khoshafian, G. Copeland, T. Jagodits, H. Boral, and P. Valduriez, "A query processing strategy for the decomposed storage mode,"Int. Conf. Data Eng., Feb. 1987.
[17] W. Kim, H.-T. Chou, and J. Banerjee, "Semantics and implementation of complex objects," inProc. Int. Conf. Data Engineering, Los Angeles, CA, Feb. 1987.
[18] A. Makinouchi, "A consideration of normal form of not necessarily-normalized relations in the relational data model,"VLDB Conf., 1977.
[19] J. Navathe et al., "Vertical Partitioning Algorithms for Database Design,"ACM Trans. Database Systems, Vol. 9, No. 4, Dec. 1984.
[20] G. Ozsoyoglu, Z. M. Ozsoyoglu, and V. Matos, "Extending relational algebra and relational calculus with set-valued attributes and aggregate functions,"ACM Trans. Database Syst., vol. 12, no. 4, pp. 566-592, Dec. 1987.
[21] Z. M. Ozsoyoglu and L.-Y. Yuan, "A new normal form for nested relations,"ACM Trans. Database Syst., vol. 12, Mar. 1987.
[22] M. A. Roth, H. F. Korth, and D. S. Batory, "SQL/NF: A query language for Non1NF relational databases,"Inform. Syst., vol. 11, no. 4, 1986.
[23] M. A. Roth, H. F. Korth, and A. Silberschatz, "Theory of non-first-normal-form relational databases,"ACM Trans. Database Syst., vol. 13, no. 4, Dec. 1988.
[24] D. Rotem, F. Tompa, and D. Kirkpatrick, "Foundations for multiple design by application partitioning," inProc. ACM Symp. Principles Databases Syst., Mar. 1982.
[25] H.-J. Schek and M. H. Scholl, "The relational model with relation-valued attributes,"Inform. Syst., vol. 11, no. 2, 1986.
[26] M. Stonebraker and L. Rowe, "The design of POSTGRES," inProc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986.
[27] M. Stonebraker,et al., "The design and implementation of INGRES,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[28] S. J. Thomas and P. C. Fischer,Nested Relational Structures, Advances in Computing Research Ill, The Theory of Databases, P.C. Kanellakis, Ed. JAI Press, 1986.
[29] P. Valduriez, S. Khoshafian, and G. Copeland, "Implementation techniques for complex objects," inProc. 12th Int. Conf. Very Large Data Bases, Kyoto, Japan, Aug. 1986.
[30] P. Valduriez, "Join indices,"ACM Trans. Database Syst., vol. 12, pp. 218-246, June 1987.
[31] P. Valduriez and H. Boral, "Evaluation of recursive queries using join indices, " inProc. 1st Int. Conf. Expert Syst., Apr. 1986.
[32] P. Valduriez and G. Gardarin, "Join and semi-join algorithms for a multiprocessor database machine,"ACM Trans. Database Syst., vol. 9, no. 1, pp. 133-161, 1984.
[33] G. Wiederhold,Database Design. New York: McGraw-Hill, 1983.
[34] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.

Index Terms:
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)
Citation:
G. Ozsoyoglu, A. Hafez, "Near-Optimum Storage Models for Nested Relations Based on Workload Information," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 6, pp. 1018-1038, Dec. 1993, doi:10.1109/69.250089
Usage of this product signifies your acceptance of the Terms of Use.