Referenced Items are not available for this document.
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
Published in:
Knowledge and Data Engineering, IEEE Transactions on
(Volume:5
,
Issue:
5
)
Date of Publication: Oct 1993
- Page(s):
- 882 - 887
- ISSN :
- 1041-4347
- INSPEC Accession Number:
- 4588616
- Digital Object Identifier :
- 10.1109/69.243516
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Oct 1993
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
