Optimal response time retrieval of replicated data (extended abstract)

Authors:
Ling Tony Chen;Doron Rotem
Affiliations:
Lawrence Berkeley Laboratory, Berkeley, CA;Lawrence Berkeley Laboratory, Berkeley, CA
Venue:
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1994

Citing 5
Cited 10

Introduction to algorithms

Introduction to algorithms
A Probabilistic Limit on the Virtual Size of Replicated Disk Systems

IEEE Transactions on Knowledge and Data Engineering
Disk Shadowing

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Declustering Objects for Visualization

VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Disk Mirroring with Alternating Deferred Updates

VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases

Replication and retrieval strategies of multidimensional data on parallel disks

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries

Journal of the ACM (JACM)
Replicated declustering of spatial data

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient retrieval of replicated data

Distributed and Parallel Databases
Efficient parallel processing of range queries through replicated declustering

Distributed and Parallel Databases
The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Selective Replicated Declustering for Arbitrary Queries

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Divide-and-conquer scheme for strictly optimal retrieval of range queries

ACM Transactions on Storage (TOS)
Optimal distributed declustering using replication

ICDT'05 Proceedings of the 10th international conference on Database Theory
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays

ACM Transactions on Storage (TOS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work deals with the problem of finding efficient access plans for retrieving a set of pages from a multi-disk system with replicated data. This paper contains two results related to this problem: (a) We solve the problem of finding an optimal access path by transforming it into a network flow problem. We also indicate how our method may be employed in dynamic environments where some (or all) of the disks have a preexisting load, are heterogeneous, and reside on different servers. (b) We present a lower bound for the worst case response time of a request under all replication schemes, and also discuss the replication scheme that results in this lower bound. We then use simulation to show how this replication scheme can also greatly reduce the average case response time.