Data Base Design Principles for Striping and Placement of Delay-Sensitive Data on Disks
Stavros Christodoulakis, Fenia Zioga
Full Paper (PDF)

Slides (HTML)

Abstract
We investigate design principles for placing striped delay-sensitive data on a number of disks in a distributed environment. The cost formulas allow us to calculate the maximum number of users that can be supported by n disks and the minimum number of disks needed to support k users, as well as to study the impact of other performance tuning options. Next, we examine the problem of optimal placement for striped data. We show that for fixed probabilities of accessing the delay-sensitive objects, partitioning the set of disks is always better than striping in all of the disks. Then, given a number n of disks and r distinct delay-sensitive objects with probabilities of access p1, p2,..., pr, that must be striped across r different disk partitions (i.e., non-overlapping subsets of the n disks), we use the Majorization theory and the theory of Schur functions in order to find what is the optimal number of disks that must be allocated to each partition. We analyze the problem of grouping the more and less popular delay-sensitive objects together in partitions when the partitions are less than the objects, so that the number of supported users is maximized. Finally, we present the tradeoff of striping on all the disks versus partitioning the set of the disks when the access probabilities of the delay-sensitive objects change with time.

References

References, where available, link to the DBLP on the World Wide Web.

[1]
Steven Berson, Shahram Ghandeharizadeh, Richard R. Muntz, Xiangyu Ju: Staggered Striping in Multimedia Information Systems. SIGMOD Conference 1994: 79-90
[2]
...
[3]
...
[4]
...
[5]
...
[6]
...
[7]
...
[8]
...
[9]
Jim Gemmell, Stavros Christodoulakis: Principles of Delay-Sensitive Multimedia Data Storage and Retrieval. TOIS 10(1): 51-90(1992)
[10]
Edward Chang, Hector Garcia-Molina: Effective Memory Use in a Media Server. VLDB 1997: 496-505
[11]
...
[12]
Arif Merchant, Philip S. Yu: Analytic Modeling and Comparisons of Striping Strategies for Replicated Disk Arrays. IEEE Transactions on Computers 44(3): 419-433(1995)
[13]
...
[14]
Banu Özden, Rajeev Rastogi, Abraham Silberschatz: On the Design of a Low-Cost Video-on-Demand Storage System. Multimedia Systems 4(1): 40-54(1996)
[15]
...
[16]
Kenneth Salem, Hector Garcia-Molina: Disk Striping. ICDE 1986: 336-342
[17]
Peter Scheuermann, Gerhard Weikum, Peter Zabback: Data Partitioning and Load Balancing in Parallel Disk Systems. VLDB Journal 7(1): 48-66(1998)
[18]
Fouad A. Tobagi, Joseph Pang, Randall Baird, Mark Gang: Streaming RAID: A Disk Array Management System for Video Files. ACM Multimedia 1993: 393-400
[19]
... Referenced By:
  1. Stavros Christodoulakis, Peter Triantafillou, Fenia Zioga: Principles of Optimally Placing Data in Tertiary Storage Libraries. VLDB 1997: 236-245
BIBTEX

@inproceedings{DBLP:conf/pods/ChristodoulakisZ98,
author = {Stavros Christodoulakis and
Fenia Zioga},
title = {Data Base Design Principles for Striping and Placement of Delay-Sensitive
Data on Disks},
booktitle = {Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium
on Principles of Database Systems, June 1-3, 1998, Seattle, Washington},
publisher = {ACM Press},
year = {1998},
isbn = {0-89791-966-3},
pages = {69-78},
crossref = {DBLP:conf/pods/98},
bibsource = {DBLP, http://dblp.uni-trier.de}
}


DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).