The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
A modeling study of the TPC-C benchmark
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Background data movement in a log-structured disk subsystem
IBM Journal of Research and Development
Load-balanced join processing in shared-nothing systems
Journal of Parallel and Distributed Computing
Retrospection on a database system
ACM Transactions on Database Systems (TODS)
A history and evaluation of System R
Communications of the ACM
The Implementation of POSTGRES
IEEE Transactions on Knowledge and Data Engineering
Multiple Prefetch Adaptive Disk Caching
IEEE Transactions on Knowledge and Data Engineering
Concurrent File Reorganization for Record Clustering: A Performance Study
Proceedings of the Eighth International Conference on Data Engineering
Analysis of Reorganization Overhead in Log-Structured File Systems
Proceedings of the Tenth International Conference on Data Engineering
Prefetch throttling and data pinning for improving performance of shared caches
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Profiler and compiler assisted adaptive I/O prefetching for shared storage caches
Proceedings of the 17th international conference on Parallel architectures and compilation techniques
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
| Hi-index | 0.00 |
We present a storage management system that has the ability to adapt to the data access characteristics of the application that uses it, based on collection and analysis of runtime statistics. Adaptive reorganization is performed by the storage management system in a manner that optimizes the access patterns of the system for which it is used. Application-specific data clustering mechanisms can also be specified to override the default mechanisms provided by our prototype. Performance results from our prototype show potential read time speedups of over 80% in the best case, using a combination of storage reorganization and prefetching.