This Article 
 Bibliographic References 
 Add to: 
Data Allocation for Multidisk Databases
October 1993 (vol. 5 no. 5)
pp. 882-887

This paper deals with I/O throughput maximization in a single processor/multidisk database system, by means of optimal allocation of entire relations (or other nonfragmented data objects) to disks. We examine the cases in which such allocation is beneficial, and present a mathematical formulation of the problem. This formulation is shown to be flexible enough to accommodate various objectives and constraints of a typical system design.

[1] D. S. Batory, "On searching transposed files,"ACM Trans. Data-base Syst., vol. 4, no. 4, pp. 531-544, Dec. 1979.
[2] D. Bitton and J. Gray, "Disk shadowing," inProc. 14th Int. Conf. Very Large Databases, 1988, pp. 331-338.
[3] H. Boral, "Parallelism and data management,"Proc. 3rd Conf. on Data and Knowledge Bases, June 1988.
[4] G. Copeland, W. Alexander, E. Boughter, and T. Keller, "Data placement in bubba," inProc. ACM SIGMOD, Chicago, IL, June 1-3, 1988, pp. 99-109.
[5] D. J. DeWitt and R. Gerber, "Multiprocessor hash-based algorithms," inProc. 11th VLDB Conf., Aug. 1985.
[6] S. Finkelstein, M. Schkolnick, and P. Tiberio, "Physical database design for relational databases,"ACM Trans. Database Syst., vol. 13, no. 1, pp. 91-129, Mar. 1988.
[7] W. Kim, "Highly available systems for database applications,"ACM Computing Surveys, vol. 16, Mar. 1984.
[8] M. Y. Kim, "Synchronized disk interleaving," inProc. IEEE Trans. Comput., vol. C-35, no. 11, pp. 978-988, Nov. 1986.
[9] M. Y. Kim and A. N. Tanwani, "Asynchronous disk interleaving,"Res. Rep. RC 12497 (#56 190), IBM T. J. Watson Research Center, Feb. 1987.
[10] M. Livny, S. Khoshafian, and H. Boral, "Multi-disk management algorithms," inProc. SIGMETRICS, pp. 69-77, May 1987.
[11] S. B. Navathe, S. Ceri, G. Wiederhold, and J. Dou, "Vertical partitioning algorithms for database design,"ACM Trans. Database Syst., vol. 4, Dec. 1979.
[12] S. B. Navathe and M. Ra, "Vertical partitioning for database design: a graphical algorithm," inProc. ACM SIGMOD Int. Conf. on Management of Data, Portland, OR, pp. 440-450, May 1989.
[13] A. Osterhaug,Guide to Parallel Programming on Sequent Com puter Systems, Sequent Computer Systems, Beaverton, Ore., 1986.
[14] D. A. Patterson, G. Gibson, and R. H. Katz, "A case for redundant arrays of inexpensive disks (RAID)," inProc. ACM SIGMOD, Chicago, IL, June 1-3, 1988, pp. 109-116.
[15] D. Rotem, "Spatial join indices,"IEEE Int. Conf. on Data Engineering, Apr. 1991.
[16] K. Salem and H. Garcia-Molina, "Disk striping," inProc. IEEE Data Eng., pp. 336-342, Feb. 1986.
[17] L. Schrage, "LINDO," Scientific Press, 1986.
[18] M. Stonebraker, "The design of XPRS," inProc. 14th Int. Conf. VLDB, pp. 318-330, Los Angeles, Aug. 1988.
[19] T. J. Teorey and J. R. Fry,Design of Database Structures. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[20] Teradata Corp., "DBC/1012 Data Base Computer System Manual," Rel. 2.0, Teradata Corp. Document C10-0001-02, Nov. 1985.

Index Terms:
multidisk databases; data allocation; input output throughput maximization; single processor; optimal allocation; entire relations; mathematical formulation; system design; relational database; data handling; database theory; relational databases; storage allocation
D. Rotem, G.A. Schloss, A. Segev, "Data Allocation for Multidisk Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 5, pp. 882-887, Oct. 1993, doi:10.1109/69.243516
Usage of this product signifies your acceptance of the Terms of Use.