Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Stonebraker, Paul Aoki, Robert Devine, W. Litwin, Michael Olson (1994)
Mariposa: a new architecture for distributed dataProceedings of 1994 IEEE 10th International Conference on Data Engineering
Lin Qiao, B. Iyer, D. Agrawal, A. Abbadi (2006)
Automated Storage Management with QoS Guarantees22nd International Conference on Data Engineering (ICDE'06)
(2008)
ACM Transactions on Storage
Paul Aoki (1999)
Algorithms for index-assisted selectivity estimationProceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)
(2006)
Storage network extension and routing
Edward Lee, C. Thekkath (1996)
Petal: distributed virtual disks
Muthian Sivathanu, Lakshmi Bairavasundaram, A. Arpaci-Dusseau, Remzi Arpaci-Dusseau (2005)
Database-aware semantically-smart storage
Guangyan Zhang, J. Shu, Wei Xue, Weimin Zheng (2007)
SLAS: An efficient approach to scaling round-robin striped volumesACM Trans. Storage, 3
Yong Feng, Yan-yuan Zhang (2005)
Virtual Disk Reconfiguration with Performance Guarantees in Shared Storage EnvironmentThird International Conference on Information Technology and Applications (ICITA'05), 2
(2007)
Received July
P. Chu, J. Beasley (1998)
A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 4
Article 16, Publication date: February 2008. Workload-Based Administrator Hints for Optimizing Database Storage
A. Kan, L. Stougie, C. Vercellis (1993)
A Class of Generalized Greedy Algorithms for the Multi-Knapsack ProblemDiscret. Appl. Math., 42
(2007)
Postgresql 8 . 2
(2006)
TPC benchmark C standard specification revision 5
(2006)
ILOG CPLEX World’s leading mathematical programming optimizers
(2001)
Hardware spending spatters
Changxun Wu, R. Burns (2005)
Tunable randomization for load management in shared-disk clustersACM Trans. Storage, 1
Chenyang Lu, G. Alvarez, J. Wilkes (2002)
Aqueduct: Online Data Migration with Performance Guarantees
(2008)
Workload - based generation of administrator hints for optimizing database storage utilization
N. An, Ji Jin, A. Sivasubramaniam (2003)
Toward an Accurate Analysis of Range Queries on Spatial DataIEEE Trans. Knowl. Data Eng., 15
D. Patterson, Garth Gibson, R. Katz (1988)
A case for redundant arrays of inexpensive disks (RAID)
J. Menon, David Pease, R. Rees, Linda Duyanovich, Bruce Hillsberg (2003)
IBM Storage Tank - A heterogeneous scalable SAN file systemIBM Syst. J., 42
Terence Sheppey, R. McGill (2007)
What is Sarbanes-Oxley?
K. Hua, Chiang Lee (1990)
An Adaptive Data Placement Scheme for Parallel Database Computer Systems
T. Kwan, Robert McCrath, D. Reed (1995)
NCSA's World Wide Web Server: Design and PerformanceComputer, 28
M. Mesnier, G. Ganger, E. Riedel (2003)
Object-based storageIEEE Commun. Mag., 41
J. Kephart, D. Chess (2003)
The Vision of Autonomic ComputingComputer, 36
家山 昇 (2000)
Storage Area Network(SAN)によるノンリニア編集機ネットワーク環境の構築について, 53
H. Yoshida (2009)
Storage Management
(2005)
Storage and server automation. http://www.symantec.com/Products/enterprise
Ashraf Aboulnaga, S. Chaudhuri (1999)
Self-tuning histograms: building histograms without looking at data
S. Khuller, Y. Kim, Yung-Chun Wan (2003)
Algorithms for data migration with cloningSIAM J. Comput., 33
G. Ganger, Bruce Worthington, Robert Hou, Y. Patt (1993)
Disk subsystem load balancing: disk striping vs. conventional data placement[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences, i
Kanishk Jain
Object-based Storage
P. Cappanera, M. Trubian (2001)
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack ProblemINFORMS J. Comput., 17
P. Furtado (2004)
Experimental evidence on partitioning in parallel data warehouses
Manish Mehta, D. DeWitt (1997)
Data placement in shared-nothing parallel database systemsThe VLDB Journal, 6
(2001)
Don't waste your storage dollars: What you need to know
(2008)
TRANSACTION PROCESSING PERFORMANCE COUNCIL (TPC)
Database storage management at data centers is a manual, time-consuming, and error-prone task. Such management involves regular movement of database objects across storage nodes in an attempt to balance the I/O bandwidth utilization across disk drives. Achieving such balance is critical for avoiding I/O bottlenecks and thereby maximizing the utilization of the storage system. However, manual management of the aforesaid task, apart from increasing administrative costs, encumbers the greater risks of untimely and erroneous operations. We address the preceding concerns with STORM, an automated approach that combines low-overhead information gathering of database access and storage usage patterns with efficient analysis to generate accurate and timely hints for the administrator regarding data movement operations. STORM's primary objective is minimizing the volume of data movement required (to minimize potential down-time or reduction in performance) during the reconfiguration operation, with the secondary constraints of space and balanced I/O-bandwidth-utilization across the storage devices. We analyze and evaluate STORM theoretically, using a simulation framework, as well as experimentally. We show that the dynamic data layout reconfiguration problem is NP-hard and we present a heuristic that provides an approximate solution in O ( Nlog ( N / M ) + ( N / M ) 2 ) time, where M is the number of storage devices and N is the total number of database objects residing in the storage devices. A simulation study shows that the heuristic converges to an acceptable solution that is successful in balancing storage utilization with an accuracy that lies within 7% of the ideal solution. Finally, an experimental study demonstrates that the STORM approach can improve the overall performance of the TPC-C benchmark by as much as 22%, by reconfiguring an initial random, but evenly distributed, placement of database objects.
ACM Transactions on Storage (TOS) – Association for Computing Machinery
Published: Feb 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.