Principles of Optimally Placing Data in Tertiary Storage Libraries.
Stavros Christodoulakis, Peter Triantafillou, Fenia Zioga:
Principles of Optimally Placing Data in Tertiary Storage Libraries.
VLDB 1997: 236-245@inproceedings{DBLP:conf/vldb/ChristodoulakisTZ97,
author = {Stavros Christodoulakis and
Peter Triantafillou and
Fenia Zioga},
editor = {Matthias Jarke and
Michael J. Carey and
Klaus R. Dittrich and
Frederick H. Lochovsky and
Pericles Loucopoulos and
Manfred A. Jeusfeld},
title = {Principles of Optimally Placing Data in Tertiary Storage Libraries},
booktitle = {VLDB'97, Proceedings of 23rd International Conference on Very
Large Data Bases, August 25-29, 1997, Athens, Greece},
publisher = {Morgan Kaufmann},
year = {1997},
isbn = {1-55860-470-7},
pages = {236-245},
ee = {db/conf/vldb/ChristodoulakisTZ97.html},
crossref = {DBLP:conf/vldb/97},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Recently, technological advances have resulted in the wide
availability of commercial products offering near-line, robot-based,
tertiary storage libraries. Thus, such libraries have become a crucial
component of modern large-scale storage servers, given the very large
storage requirements of modern applications. Although the subject of
optimal data placement (ODP) strategies has received considerable attention
for other storage devices (such as magnetic and optical disks and disk
arrays), the issue of optimal data placement in tertiary libraries has
been neglected. The latter issue is more critical since tertiary storage
remains three orders of magnitude slower than secondary storage.
In this paper, we address this issue by deriving such optimal placement
algorithms. First, we study the ODP problem in disk libraries (jukeboxes) and
subsequently, in tape libraries. In our studies, we consider different
scheduling algorithms, different configurations of disk libraries and
different tape library technologies (reflecting different existing
commercial products) and show how these impact on the ODP strategy.
Copyright © 1997 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
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Matthias Jarke, Michael J. Carey, Klaus R. Dittrich, Frederick H. Lochovsky, Pericles Loucopoulos, Manfred A. Jeusfeld (Eds.):
VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece.
Morgan Kaufmann 1997, ISBN 1-55860-470-7
Contents 
Electronic Edition
From CS Dept.,
University Trier (Germany)
References
- [Amp97]
- ...
- [Che94]
- ...
- [Chr91]
- Daniel Alexander Ford, Stavros Christodoulakis:
Optimal Placement of High-Probability Randomly Retrieved Blocks on CLV Optical Discs.
ACM Trans. Inf. Syst. 9(1): 1-30(1991)
- [Chr97a]
- ...
- [Chr97b]
- Stavros Christodoulakis, Fenia Zioga:
Data Base Design Principles for Striping and Placement of Delay-Sensitive Data on Disks.
PODS 1998: 69-78
- [Chr97c]
- ...
- [Exa97]
- ...
- [Hor78]
- Ellis Horowitz, Sartaj Sahni:
Fundamentals of Computer Algorithms.
Computer Science Press 1978
- [Mar79]
- Albert W. Marshall, Ingram Olkin:
Inequalities: Theory of Majorization and Its Application.
Academic Press 1979, ISBN 0-12-473750-1
- [Tri97a]
- ...
- [Tri97b]
- ...
- [Won83]
- C. K. Wong:
Algorithmic Studies in Mass Storage Systems.
Computer Science Press 1983
Copyright © Tue Mar 16 02:22:06 2010
by Michael Ley (ley@uni-trier.de)
