Optimizing Random Retrievals from CLV format Optical Disks.

Daniel Alexander Ford, Stavros Christodoulakis: Optimizing Random Retrievals from CLV format Optical Disks. VLDB 1991: 413-422

@inproceedings{DBLP:conf/vldb/FordC91,
  author    = {Daniel Alexander Ford and
               Stavros Christodoulakis},
  editor    = {Guy M. Lohman and
               Am\'{\i}lcar Sernadas and
               Rafael Camps},
  title     = {Optimizing Random Retrievals from CLV format Optical Disks},
  booktitle = {17th International Conference on Very Large Data Bases, September
               3-6, 1991, Barcelona, Catalonia, Spain, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1991},
  isbn      = {1-55860-150-3},
  pages     = {413-422},
  ee        = {db/conf/vldb/FordC91.html},
  crossref  = {DBLP:conf/vldb/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

One technique often employed to improve retrieval performance from storage devices is to reduce seek costs by to clustering frequently accessed data together in locations on the storage device that are physically close. For magnetic disks determining the best position on the disk to place frequently accessed data is straightforward, for optical disks with their many different recording formats the solution is much more difficult. We develop a detailed model for the placement of data on Constant Linear Velocity (CLV) format optical disks that includes distribution of storage capacity across the disks surface (which is variable for CLV format optical disks), the seek performance of the disk drive, delays due to rotational latency, and the distribution of accesses over the data set. We derive closed form expressions which determine the position of frequently accessed data that will minimize the expected cost of random accesses to the data set.

Copyright © 1991 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb8997 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Guy M. Lohman, Amílcar Sernadas, Rafael Camps (Eds.): 17th International Conference on Very Large Data Bases, September 3-6, 1991, Barcelona, Catalonia, Spain, Proceedings. Morgan Kaufmann 1991, ISBN 1-55860-150-3

References

[Laub 86]: ...
[Mckusick 84]: Marshall K. McKusick, William N. Joy, Samuel J. Leffler, Robert S. Fabry: A Fast File System for UNIX. ACM Trans. Comput. Syst. 2(3): 181-197(1984)
[Grossman 73]: David D. Grossman, Harvey F. Silverman: Placement of Records on a Secondary Storage Device to Minimize Access Time. J. ACM 20(3): 429-438(1973)
[Yue and Wong 73]: P. C. Yue, C. K. Wong: On the Optimality of the Probability Ranking Scheme in Storage Applications. J. ACM 20(4): 624-633(1973)
[Wong 80]: C. K. Wong: Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems. ACM Comput. Surv. 12(2): 167-178(1980)
[Wong 83]: C. K. Wong: Algorithmic Studies in Mass Storage Systems. Computer Science Press 1983
[Hardy 34]: ...
[Ford 91]: ...
[Char 85]: ...